2017/06/22 by Goranko, Valentin, Kuusisto, Antti, Rönnholm, Raine
#Artificial Intelligence (cs.AI) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #I.2.11 #Multiagent Systems (cs.MA) #Social and Information Networks (cs.SI)
paper · doi:10.48550/arxiv.1706.07412
We study pure coordination games where in every outcome, all players have identical payoffs, 'win' or 'lose'. We identify and discuss a range of 'purely rational principles' guiding the reasoning of rational players in such games and analyze which classes of coordination games can be solved by such players with no preplay communication or conventions. We observe that it is highly nontrivial to delineate a boundary between purely rational principles and other decision methods, such as conventions, for solving such coordination games.