Abstract : Iterated regret minimization has been introduced recently by J.Y. Halpern and R. Pass in classical strategic games. For many games of interest, this new solution concept provides solutions that are judged more reasonable than solutions offered by traditional game concepts -- such as Nash equilibrium --. In this paper, we investigate iterated regret minimization for infinite duration two-player quantitative non-zero sum games played on graphs.
Type de document :
Communication dans un congrès
35th International Symposium on Mathematical Foundations of Computer Science, Aug 2010, Brno, Czech Republic. 2010
https://hal.inria.fr/inria-00492237
Contributeur : Emmanuel Filiot
<>
Soumis le : mardi 15 juin 2010 - 15:36:59
Dernière modification le : jeudi 9 juillet 2015 - 14:41:53
Document(s) archivé(s) le : mercredi 15 septembre 2010 - 20:33:05
Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin. Iterated Regret Minimization in Game Graphs. 35th International Symposium on Mathematical Foundations of Computer Science, Aug 2010, Brno, Czech Republic. 2010. 〈inria-00492237〉
