The optimal way to play the most difficult repeated two-player coordination games

DOI10.1016/j.dam.2023.06.010zbMath1530.91055arXiv2109.08318OpenAlexW4381929075MaRDI QIDQ6064834

Raine Rönnholm, Antti Kuusisto

Publication date: 11 December 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.08318

zbMATH Keywords

bipartite graphssymmetry breakingoptimal strategiesrelational structuresreachability objectivesrepeated coordination gamesaverage and worst case analysis

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coordination games on graphs
• Rational coordination with no communication or conventions
• Can we rationally learn to coordinate?
• Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
• Repeated Games
• Learning How to Cooperate: Optimal Play in Repeated Coordination Games
• Asynchronous Choice in Repeated Coordination Games
• Adaptive Dynamics in Coordination Games
• Gradual Guaranteed Coordination in Repeated Win-Lose Coordination Games.
• Rational coordination with no communication or conventions

This page was built for publication: The optimal way to play the most difficult repeated two-player coordination games