Sciweavers

234 search results - page 15 / 47
» A polynomial-time nash equilibrium algorithm for repeated ga...
Sort
View
ESA
2005
Springer
77views Algorithms» more  ESA 2005»
15 years 3 months ago
On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games
We consider the price of stability for Nash and correlated equilibria of linear congestion games. The price of stability is the optimistic price of anarchy, the ratio of the cost ...
George Christodoulou, Elias Koutsoupias
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
14 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
GLOBECOM
2006
IEEE
15 years 3 months ago
Leveraging Downlink for Regulation of Distributed Uplink CDMA
Abstract— In this paper, we formulate an optimal rate allocation scheme for uplink and downlink in a single-cell CDMA system. Using concepts from game theory, we show that it is ...
Jennifer Price, Tara Javidi
JSAC
2008
140views more  JSAC 2008»
14 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
MOBIHOC
2012
ACM
13 years 7 days ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang