Research Article
Nash equilibrium design and optimization
@INPROCEEDINGS{10.1109/GAMENETS.2009.5137398, author={Tansu Alpcan and Lacra Pavel}, title={Nash equilibrium design and optimization}, proceedings={1st International Conference on Game Theory for Networks}, publisher={IEEE}, proceedings_a={GAMENETS}, year={2009}, month={6}, keywords={}, doi={10.1109/GAMENETS.2009.5137398} }
- Tansu Alpcan
Lacra Pavel
Year: 2009
Nash equilibrium design and optimization
GAMENETS
IEEE
DOI: 10.1109/GAMENETS.2009.5137398
Abstract
The general problem of Nash equilibrium design is investigated from an optimization perspective. Within this context, a specific but fairly broad class of noncooperative games are considered that have been applied to a variety of settings including network congestion control, wireless uplink power control, and optical power control. The Nash equilibrium design problem is analyzed under various knowledge assumptions (full versus limited information) and design objectives (QoS versus utility maximization). Among other results, the ldquoprice of anarchyrdquo is shown not to be an inherent feature of games that incorporate pricing mechanisms, but merely a misconception that often stems from arbitrary choice of game parameters. Moreover, a simple linear pricing is sufficient for design of Nash equilibrium according to a chosen global objective for a general class of games and under suitable information assumptions.