Naive asymptotics for hitting time bounds in Markov chains
Acta Informatica
Dispersion games: general definitions and some specific learning results
Eighteenth national conference on Artificial intelligence
Minority Games: Interacting Agents in Financial Markets (Oxford Finance Series)
Minority Games: Interacting Agents in Financial Markets (Oxford Finance Series)
Exploring selfish reinforcement learning in repeated games with stochastic rewards
Autonomous Agents and Multi-Agent Systems
Computing correlated equilibria in multi-player games
Journal of the ACM (JACM)
Full length article: Minority game for cognitive radios: Cooperating without cooperation
Physical Communication
| Hi-index | 0.00 |
Many games have undesirable Nash equilibria. For example consider a resource allocation game in which two players compete for an exclusive access to a single resource. It has three Nash equilibria. The two pure-strategy NE are efficient, but not fair. The one mixed-strategy NE is fair, but not efficient. Aumann's notion of correlated equilibrium fixes this problem: It assumes a correlation device which suggests each agent an action to take. However, such a "smart" coordination device might not be available. We propose using a randomly chosen, "stupid" integer coordination signal. "Smart" agents learn which action they should use for each value of the coordination signal. We present a multi-agent learning algorithm which converges in polynomial number of steps to a correlated equilibrium of a wireless channel allocation game, a variant of the resource allocation game. We show that the agents learn to play for each coordination signal value a randomly chosen pure-strategy Nash equilibrium of the game. Therefore, the outcome is an efficient correlated equilibrium. This CE becomes more fair as the number of the available coordination signal values increases. We believe that a similar approach can be used to reach efficient and fair correlated equilibria in a wider set of games, such as potential games.