par Filiot, Emmanuel 
;Le Gall, Tristan ;Raskin, Jean-François
Référence Lecture notes in computer science, 6281, page (342-354)
Publication Publié, 2010
;Le Gall, Tristan ;Raskin, Jean-François Référence Lecture notes in computer science, 6281, page (342-354)
Publication Publié, 2010
Article révisé par les pairs
| Résumé : | 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. © 2010 Springer-Verlag. |
