Iterated regret minimization in game graphs

Authors:
Emmanuel Filiot;Tristan Le Gall;Jean-François Raskin
Affiliations:
Université Libre de Bruxelles;Université Libre de Bruxelles;Université Libre de Bruxelles
Venue:
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Year:
2010

Citing 5
Cited 0

Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Games with Secure Equilibria

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Iterated regret minimization: a new solution concept

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Equilibria in quantitative reachability games

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Rational synthesis

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

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.