Program Overview

FEP3301 Computational Game Theory

Course Information

The course FEP3301 Computational Game Theory is offered with 8.0 credits.

Information per Course Offering

Termin

Autumn 2025

Information for Autumn 2025 Start

• Course location: KTH Campus
• Duration: 27 Oct 2025 - 12 Jan 2026
• Periods: Autumn 2025: P2 (8 hp)
• Pace of study: 50%
• Application code: 50667
• Form of study: Normal Daytime
• Language of instruction: English
• Course memo: Course memo is not published
• Number of places: Places are not limited
• Target group: No information inserted
• Planned modular schedule: No information inserted
• Schedule: Schedule is not published
• Part of programme: No information inserted

Contact

• Examiner: György Dán
• Course coordinator: György Dán
• Teachers: György Dán

Course Syllabus

The course syllabus for FEP3301 (Spring 2019–) is available. Headings with content from the Course syllabus are denoted with an asterisk.

Content and Learning Outcomes

Course Contents

The course covers strategic games in normal form, Kakutani's fixed point theorem, best reply, Nash equilibrium, dominance solvability, rationalizability, existence of equilibria, zeros-sum games, minimax theorem, cardinality of solutions, refinement of Nash equilibria, robustness of equilibria, Bayesian games, potential games, submodular games, extensive games with perfect information, subgame perfect equilibria, repeated games and folk theorems, stochastic games, Markov perfect equilibria, finite and infinite evolutionary games, replicator dynamic, evolutionary stable states and sets, coalition games, core, kernel, nucleolus, Shapley value, social choice theory, Arrow's impossibility theorem, implementation in dominant strategies, strategyproof implementation, Gibbard-Sattertwhwaite theorem, implementation with money, Groves mechanism, Clarke's pivot rule, VCG mechanism, implementation in Nash equilibrium.

Intended Learning Outcomes

Upon completion of the course, the student should be able to:

• Formalize problems that involve more than one decision-making entity in a game theoretical context
• Critically assess the research literature in the area
• Use the game theoretical tools and methods to solve problems
• Contribute to the research frontier in the area

Literature and Preparations

Specific Prerequisites

No information inserted

Literature

Information about course literature can be found in the course memo for the course offering or in the course room in Canvas.

Examination and Completion

Grading Scale

P, F

Examination

• EXA1 - Examination, 8.0 credits, grading scale: P, F Based on recommendation from KTH's coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability. The examiner may apply another examination format when re-examining individual students. If the course is discontinued, students may request to be examined during the following two academic years.

Other Requirements for Final Grade

• 15 min oral presentation at one of the lectures
• 75% on weekly home-work problems and the presentation
• 50% on 72 h take home exam

Examiner

György Dán

Ethical Approach

• All members of a group are responsible for the group's work.
• In any assessment, every student shall honestly disclose any help received and sources used.
• In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further Information

Course Room in Canvas

Registered students find further information about the implementation of the course in the course room in Canvas.

Offered by

EECS/Network and Systems Engineering

Education Cycle

Third cycle

Postgraduate Course

Postgraduate courses at EECS/Network and Systems Engineering