12 November 2010, Computational Social Choice Seminar, Eric Pacuit

Abstract

In this talk I will introduce and diagnose a number of problems that arise when trying to provide a rigorous epistemic characterization of game-theoretic solutions concepts. Much of the talk will focus on issues surrounding Iterated Admissibility. The goal of the talk is to compare the "static" epistemic characterizations with dynamic accounts (including a recent proposal by R. Cubbitt and R. Sugden introducing a new iterative procedure for solving finite strategic games).

For more information, see http://www.illc.uva.nl/~ulle/seminar/, or contact Ulle Endriss (ulle.endriss at uva.nl).