Natural Solutions for a Class of Symmetric Games

Stephen D. Patek, Peter A. Beling, Yijia Zhao

We introduce a new equilibrium selection mechanism for a class of symmetric coordination games. Taking advantage of the structure of these games, we assert that the equilibrium selected by this mechanism constitutes a natural solution in the sense that the associated expected payoff is the highest equilibrium value that can be achieved without any player having to guess how to do so. We illustrate the concept for specific examples, discuss computational issues, and then briefly conclude with a discussion about how the concept can be generalized to other coordination games.

Subjects: 7.1 Multi-Agent Systems

Submitted: Jan 24, 2007


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.