Algorithmic Game Theory and its Applications (AGTA) is a 10 credit course at Level 11, normally taken in Year 4. It runs in Semester 2. The exam is in April/May, and is worth 80% of the course mark. The University descriptor is here.
Course Outline
* Examples of diverse games. * Zero-sum two-person games: LP, simplex, LP-duality, mixed strategies and the minimax theorem. * General games in strategic form: o Equilibria and Nash's theorem. o 2-player equilibria: Lemke-Howson algorithm and its variants. * Games in Extensive form (mainly zero-sum, perfect information): o Game trees. Relation to Strategic games. o And/Or game graphs and reachability games. o bisimulation, simulation, parity games, and other omega-games on automata(finitely presented, infinite duration games). o mean value games, MDPs, and stochastic games. * Mechanism design and inverse game theory: designing games where selfish players will behave as desired. o Vickery auctions and other mechanisms. o Combinatorial auctions. o Incentive structures for the internet.
Relevant QAA Computing Curriculum Sections: Artificial Intelligence, Data Structures and Algorithms, e-commerce, Simulation and Modelling, Theoretical Computing
Timetable
If you are looking for your class times for this course, these can be found via your University of Edinburgh calendar (links provided below):
