2010 | OriginalPaper | Buchkapitel
Iterated Regret Minimization in Game Graphs
verfasst von : Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin
Erschienen in: Mathematical Foundations of Computer Science 2010
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.