Iterated Regret Minimization in Game Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

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.
Fichier principal
Vignette du fichier
regrets-mfcs.pdf (150.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00492237 , version 1 (15-06-2010)


  • HAL Id : inria-00492237 , version 1


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. ⟨inria-00492237⟩
119 View
104 Download


Gmail Facebook X LinkedIn More