FEP3301 Spelteori 8,0 hp

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.

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

När kurs inte längre ges har student möjlighet att examineras under ytterligare två läsår.

• EXA1 - Examination, 8,0 hp, betygsskala: P, F

Examinator beslutar, baserat på rekommendation från KTH:s handläggare av stöd till studenter med funktionsnedsättning, om eventuell anpassad examination för studenter med dokumenterad, varaktig funktionsnedsättning.

Examinator får medge annan examinationsform vid omexamination av enstaka studenter.

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

György Dán

• Vid grupparbete har alla i gruppen ansvar för gruppens arbete.
• Vid examination ska varje student ärligt redovisa hjälp som erhållits och källor som använts.
• Vid muntlig examination ska varje student kunna redogöra för hela uppgiften och hela lösningen.