论文信息 - Iterated Regret Minimization in Game Graphs

Iterated Regret Minimization in Game Graphs

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.

Jean-François Raskin | Tristan Le Gall | Emmanuel Filiot | E. Filiot | Jean-François Raskin

[1] Michael Ummels,et al. Solution Concepts and Algorithms for Infinite Multiplayer Games , 2008 .

[2] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .

[3] Joseph Y. Halpern,et al. Iterated Regret Minimization: A New Solution Concept , 2009, IJCAI.

[4] Michael H. Bowling,et al. Regret Minimization in Games with Incomplete Information , 2007, NIPS.

[5] Joseph Y. Halpern,et al. Iterated Regret Minimization: A More Realistic Solution Concept , 2008, ArXiv.

[6] Dana Fisman,et al. Rational Synthesis , 2009, TACAS.

[7] Véronique Bruyère,et al. Equilibria in Quantitative Reachability Games , 2010, CSR.

[8] R. Rosenthal. Games of perfect information, predatory pricing and the chain-store paradox , 1981 .

[9] Kaushik Basu,et al. The traveler's dilemma: Paradoxes of rationality in game theory , 1994 .

[10] Thomas Wilke,et al. Automata logics, and infinite games: a guide to current research , 2002 .

[11] Thomas Wilke,et al. Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[12] Krishnendu Chatterjee,et al. Games with secure equilibria , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[13] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .