Sciweavers

108 search results - page 3 / 22
» -Hardness of Pure Nash Equilibrium in Scheduling and Connect...
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 5 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
CSL
2009
Springer
13 years 12 months ago
Decision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Michael Ummels, Dominik Wojtczak
GLOBECOM
2008
IEEE
13 years 11 months ago
Game Theoretic Rate Adaptation for Spectrum-Overlay Cognitive Radio Networks
— We consider the issue of fair share of the spectrum opportunity for the case of spectrum-overlay cognitive radio networks. Owing to the decentralized nature of the network, we ...
Laxminarayana S. Pillutla, Vikram Krishnamurthy
SODA
2007
ACM
115views Algorithms» more  SODA 2007»
13 years 6 months ago
Strong price of anarchy
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...
Nir Andelman, Michal Feldman, Yishay Mansour
CDC
2008
IEEE
141views Control Systems» more  CDC 2008»
13 years 11 months ago
Distributed welfare games with applications to sensor coverage
We consider a variation of the resource allocation problem. In the traditional problem, there is a global planner who would like to assign a set of players to a set of resources s...
Jason R. Marden, Adam Wierman