CS6382 - Algorithm Analysis and Game Theory | ||||||||||
| ||||||||||
* The offering term is subject to change without prior notice | ||||||||||
Course Aims | ||||||||||
The goal of this course is to introduce students to the field of algorithm analysis and game theory. Different ways of algorithm analysis are coupled with algorithm design, showing provable bounds either in running time or performance. Game theory is a rich domain which interplays with many subjects including computer science. This course is intended to give a broad overview of game theory together with different ways of analysing algorithms, which could be used to explain interactive nature of real-world problems and provide provable performance for them. Computational aspects of game theory will also be covered. At the end of the course, students will have knowledge on how to apply game theory and algorithm analysis in the problems that may arise around them. | ||||||||||
Assessment (Indicative only, please check the detailed course information) | ||||||||||
Continuous Assessment: 40% | ||||||||||
Examination: 60% | ||||||||||
Examination Duration: 2 hours | ||||||||||
Detailed Course Information | ||||||||||
CS6382.pdf | ||||||||||
Useful Links | ||||||||||
Department of Computer Science |