294 search results - page 23 / 59 » The complexity of computing a Nash equilibrium |
100
click to vote
WIOPT
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
104
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract—In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful frame...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper is concerned with the problem of identifying robust equilibrium postures of a planar mechanism supported by fixed frictional contacts in a twodimensional gravitation...