Algorithmic Game Theory
Computer Science and Electronic Engineering (School of)
Undergraduate: Level 6
Thursday 03 October 2019
Saturday 14 December 2019
04 October 2018
Requisites for this module
This module prepares students to understand and design the kinds of systems that are coming to define modern life, such as Amazon, Uber, eBay, etc. These companies need analysts who can decide which objectives to maximize, what information and choices to offer, what rules to set, and so on. These questions require a broad understanding of topics at the interface of theoretical computer science and economics. This module will take a computational and algorithmic approach to designing and analyzing such systems. Students will explore the interaction between self-interested agents and strategic scenarios through the lens of Algorithmic Game Theory and Mechanism Design.
Algorithmic game theory lies at the exciting intersection of CS and Economics and is an area of expertise that is in great demand within the UK Finance Industry, forming one of the primary recruiting sectors for graduates from Computer Science. The aim of this module is to introduce this subject to students using research-led teaching that uses expertise from staff within the Centre for Computational Finance and Economic Agents (CCFEA) at the University of Essex. This model also provides an excellent opportunity for students to explore continuing their studies in a postgraduate CCFEA degree programme.
By the end of this module, students will:
1. Be able to model various situations as strategic games
2. Understand and use computational and algorithmic aspects of game theory
3. Appreciate incentive structures used in certain situations
4. Carry out a model of a realistic scenario, perform evaluations and draw conclusions from the model evaluation.
Game Theory Basics:
* Mixed Strategies, Expected Payoffs, and Nash Equilibrium.
* 2-Player Zero-Sum Games, and The Minimax Theorem, Introduction to Linear
* Selfish Network Routing, Congestion Games, and the Price of Anarchy
Auctions and Mechanism Design Basics;
* Auctions as games, Bayesian games, and Vickrey auctions
* Matching Markets, unit-demand auctions, and VCG
* Revenue maximizing auctions, and Simple auctions
* Combinatorial auctions
* Online auctions, sponsored search auctions
* Mechanism design without money
Algorithms and complexity theory basics
* learning and computing Nash and market equilibria
* NP-Completeness, PLS-Completeness, PPAD-Completeness
Current research challenges in algorithmic game theory.
No information available.
This module does not appear to have any essential texts. To see non-essential items, please refer to the module's reading list.
Assessment items, weightings and deadlines
|Coursework / exam
||Lab Script Solutions
Module supervisor and teaching staff
No external examiner information available for this module.
Available via Moodle
Of 50 hours, 34 (68%) hours available to students:
16 hours not recorded due to service coverage or fault;
0 hours not recorded due to opt-out by lecturer(s).
Disclaimer: The University makes every effort to ensure that this information on its Module Directory is accurate and up-to-date. Exceptionally it can
be necessary to make changes, for example to programmes, modules, facilities or fees. Examples of such reasons might include a change of law or regulatory requirements,
industrial action, lack of demand, departure of key personnel, change in government policy, or withdrawal/reduction of funding. Changes to modules may for example consist
of variations to the content and method of delivery or assessment of modules and other services, to discontinue modules and other services and to merge or combine modules.
The University will endeavour to keep such changes to a minimum, and will also keep students informed appropriately by updating our programme specifications and module directory.
The full Procedures, Rules and Regulations of the University governing how it operates are set out in the Charter, Statutes and Ordinances and in the University Regulations, Policy and Procedures.