Undergraduate Course: Algorithmic Game Theory and its Applications (UG) (INFR11218)
|School||School of Informatics
||College||College of Science and Engineering
|Credit level (Normal year taken)||SCQF Level 11 (Year 4 Undergraduate)
||Availability||Available to all students
|Summary||This course follows the delivery and assessment of Algorithmic Game Theory and its Applications (INFR11020) exactly. Undergraduate students must register for this course, while MSc students must register for INFR11020 instead.
This course follows the delivery and assessment of Algorithmic Game Theory and its Applications (INFR11020) exactly. Undergraduate students must register for this course, while MSc students must register for INFR11020 instead.
Entry Requirements (not applicable to Visiting Students)
|| It is RECOMMENDED that students have passed
Algorithms and Data Structures (INFR10052)
|Prohibited Combinations|| Students MUST NOT also be taking
Algorithmic Game Theory and its Applications (INFR11020)
||Other requirements|| This course follows the delivery and assessment of Algorithmic Game Theory and its Applications (INFR11020) exactly. Undergraduate students must register for this course, while MSc students must register for INFR11020 instead.
This course is open to all Informatics students including those on joint degrees. For external students where this course is not listed in your DPT, please seek special permission from the course organiser.
Some mathematical maturity, and concretely some basic background in linear algebra; discrete mathematics; probability; at the level of the year 1 and 2 required undergraduate courses in these topics.
Background in algorithms, and exposure to computational complexity theory (NP - completeness, etc.) is desirable but not required.
Information for Visiting Students
|High Demand Course?
Course Delivery Information
|Academic year 2022/23, Available to all students (SV1)
|Learning and Teaching activities (Further Info)
Lecture Hours 20,
Seminar/Tutorial Hours 8,
Summative Assessment Hours 2,
Programme Level Learning and Teaching Hours 2,
Directed Learning and Independent Learning Hours
|Assessment (Further Info)
|Additional Information (Assessment)
Students will be given written practical assignments reinforcing the material taught in class. The assignments are mainly theoretical, but some of the assigned questions may ask students to implement parts of algorithms for "solving" a game.
You should expect to spend approximately 32 hours on the coursework and tutorial sheet exercises, combined, for this course.
||Marked coursework, plus weekly tutorial sheets which are not marked, but whose solutions are discussed at weekly tutorials.
||Hours & Minutes
|Main Exam Diet S2 (April/May)||Algorithmic Game Theory and its Applications (UG) (INFR11218)||2:00|
On completion of this course, the student will be able to:
- Understand various models of games, how they are related, and how they arise in various applications in computer science and elsewhere
- Understand linear programming and some of its broad applicability
- Understand how algorithms are used to "solve" such games and their efficiency
- Model various scenarios as strategic games, and devise algorithms to solve them
- Understand the aims of the current research frontier
|M. Maschler, E. Solan, & S. Zamir, "Game Theory", 2013.|
V. Chvátal, "Linear Programming", 1980.
N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani (editors), "Algorithmic Game Theory", 2007.
Y. Shoham & K. Leyton-Brown, "Multiagent systems: algorithmic, game-theoretic, and logical foundations", 2009.
A. Mas-Colell, M. Whinston, and J. Green, "Microeconomic Theory", 1995.
T. Roughgarden, "Twenty Lectures on Algorithmic Game Theory", 2016.
|Graduate Attributes and Skills
|Keywords||game theory,alogirithms,data structures
|Course organiser||Dr Kousha Etessami
Tel: (0131 6)50 5197
|Course secretary||Mrs Helen Tweedale
Tel: (0131 6)50 2692