Sciweavers

14 search results - page 3 / 3
» New Results on the Complexity of Uniformly Mixed Nash Equili...
Sort
View
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
13 years 10 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
ESA
2010
Springer
178views Algorithms» more  ESA 2010»
13 years 6 months ago
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
FOCS
2009
IEEE
14 years 3 days ago
Reducibility among Fractional Stability Problems
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
Shiva Kintali, Laura J. Poplawski, Rajmohan Rajara...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 5 months ago
The MIMO Iterative Waterfilling Algorithm
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...