Skip to main content
Till KTH:s startsida

FEP3301 Computational Game Theory 8.0 credits

Information per course offering

Termin

Information for Autumn 2025 Start 27 Oct 2025 programme students

Course location

KTH Kista

Duration
27 Oct 2025 - 12 Jan 2026
Periods
P2 (8.0 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
[object Object]
Schedule
Schedule is not published
Part of programme
No information inserted

Contact

Course coordinator
No information inserted
Teachers
No information inserted

Course syllabus as PDF

Please note: all information from the Course syllabus is available on this page in an accessible format.

Course syllabus FEP3301 (Spring 2019–)
Headings with content from the Course syllabus FEP3301 (Spring 2019–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

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

You can find information about course literature either in the course memo for the course offering or in the course room in Canvas.

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

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.

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

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. A link to the course room can be found under the tab Studies in the Personal menu at the start of the course.

Offered by

Main field of study

This course does not belong to any Main field of study.

Education cycle

Third cycle

Postgraduate course

Postgraduate courses at EECS/Network and Systems Engineering