Sciweavers

130 search results - page 21 / 26
» Convergence Time to Nash Equilibria
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 5 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
INFOCOM
2011
IEEE
12 years 10 months ago
Pricing-based spectrum access control in cognitive radio networks with random access
Abstract—Market-based mechanisms offer promising approaches for spectrum access in cognitive radio networks. In this paper, we focus on two market models, one with a monopoly pri...
Lei Yang, Hongseok Kim, Junshan Zhang, Mung Chiang...
MOBIHOC
2008
ACM
14 years 7 months ago
A game approach for multi-channel allocation in multi-hop wireless networks
Channel allocation was extensively investigated in the framework of cellular networks, but it was rarely studied in the wireless ad-hoc networks, especially in the multi-hop ad-ho...
Lin Gao, Xinbing Wang
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 1 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
INFOCOM
2000
IEEE
13 years 11 months ago
Distributed Power Control and Spreading Gain Allocation in CDMA Data Networks
We study the radio resource allocation problem of distributed joint transmission power control and spreading gain allocation in a DS-CDMA mobile data network. The network consists...
Seong-Jun Oh, Tava Lennon Olsen, Kimberly M. Wasse...