A tight characterization of strategic games with a unique equilibrium

Authors:
Antoniy Ganchev;Lata Narayanan;Sunil Shende
Affiliations:
Department of Computer Science and Software Engineering, Concordia University, Montreal, Canada;Department of Computer Science and Software Engineering, Concordia University, Montreal, Canada;Department of Computer Science, Rutgers University, Camden, NJ 08102, USA
Venue:
Theoretical Computer Science
Year:
2013

Citing 3
Cited 0

Cooperation Issues in Mobile Ad Hoc Networks

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Games to induce specified equilibria

Theoretical Computer Science
The role of the access point in Wi-Fi networks with selfish nodes

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider the problem of designing a strategic game (i.e. the utilities) for a set of players where distinct players may have sets of actions with possibly different cardinalities. Furthermore, for each player, a full-support probability distribution on its action set is apriori specified. The goal is to ensure that this pre-specified profile of distributions is the unique Nash equilibrium for the game. One motivation for our problem comes from exponential backoff shared-media access protocols in wireless networks: a static version of protocol compliance can be modeled as an instance of the problem. Building on results from an earlier paper, we provide a tight characterization of the conditions under which such a strategic game may be constructed. Our results not only establish the exact relationship that must hold between the cardinalities of the players' action sets but also provide the players' utilities for the desired unique equilibrium to be achieved.