Sciweavers

294 search results - page 41 / 59
» The complexity of computing a Nash equilibrium
Sort
View
CORR
2010
Springer
186views Education» more  CORR 2010»
14 years 11 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...
WIOPT
2010
IEEE
14 years 10 months ago
Competitive interference-aware spectrum access in cognitive radio networks
—Cognitive radio networks provide the capability to share the wireless channel with licensed (primary) users in an opportunistic manner. Primary users have a license to operate i...
Jocelyne Elias, Fabio Martignon, Antonio Capone, E...
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
15 years 4 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
FOCS
2009
IEEE
15 years 6 months ago
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
NAR
2006
98views more  NAR 2006»
14 years 11 months ago
oGNM: online computation of structural dynamics using the Gaussian Network Model
An assessment of the equilibrium dynamics of biomolecular systems, and in particular their most cooperativefluctuationsaccessibleundernativestate conditions, is a first step towar...
Lee-Wei Yang, A. J. Rader, Xiong Liu, Christopher ...