22-25 June 2010
Aarhus, Denmark
Workshop on Solution Concepts for Extensive Games Center for Algorithmic Game Theory Aarhus University, Aarhus, Denmark June 22-25, 2010 Solution concepts for extensive form games is a classical topic of game theory. In recent years, the topic has also been attracting attention from various subcommunities of the theoretical computer science community. This workshop brings together researchers from game theory, economics, cryptography, algorithms and formal methods. Topics to be discussed include * Game theoretic analysis and solution concepts for cryptographic protocols, * Computational properties of solution concepts (e.g., algorithms and computational hardness of equilibrium refinements), * Bounded and computational rationality in extensive games, * Solution concepts for extensive form games from the perspective of epistemic game theory, * Solution concepts for infinite duration games (stochastic games, recursive games, reachability games etc.). Confirmed speakers are * Geir Asheim (University of Oslo), * Christian Bach (Maastricht University) * Jing Chen (M.I.T.), * Kousha Etessami (University of Edinburgh), * Janos Flesch (Maastricht University) * Ronen Gradwohl (Northwestern) * Erich Grdel (Aachen), * Josh Letchford (Duke), * Silvio Micali (M.I.T.), * Moni Naor (Weizmann), * Andres Perea (Maastricht University), * Rafael Pass (Cornell), * Alon Rosen (Herzliya) * Rahul Santhanam (University of Edinburgh), * abhi shelat (University of Virginia), * Bernhard von Stengel (London School of Economics), * Troels Bjerre Srensen (University of Warwick) The workshop will be open to a limited number of participants. There will be no registration fee. If you wish to participate please send an email to cagt@cs.au.dk with subject header [SCEG] by May 15th. Local organizers: * Peter Bro Miltersen * Jesper Buus Nielsen Detailed information about the workshop will be added later at the workshop webpage: http://www.cs.au.dk/cagt/sol.html A detailed program can be expected around June 1st.