234 search results - page 25 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
JSAC
2007
14 years 9 months ago
2007
— 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...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
—This paper considers a non-cooperative game in which competing users sharing a frequency-selective interference channel selfishly optimize their power allocation in order to imp...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...