Skip to Main content Skip to Navigation

Iterated Regret Minimization in Game Graphs

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.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/inria-00492237
Contributor : Emmanuel Filiot <>
Submitted on : Tuesday, June 15, 2010 - 3:36:59 PM
Last modification on : Thursday, July 9, 2015 - 2:41:53 PM
Document(s) archivé(s) le : Wednesday, September 15, 2010 - 8:33:05 PM

File

regrets-mfcs.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00492237, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

232

Files downloads

200