30 search results - page 5 / 6 » Choosing Samples to Compute Heuristic-Strategy Nash Equilibr... |
MFCS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
SIGECOM
2006
ACM
13 years 12 months ago
2006
ACM
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
ICNP
2007
IEEE
14 years 10 days ago
2007
IEEE
—We present a game-theoretic study on the power and rate control problem in IEEE 802.11 WLANs where network participants choose appropriate transmission power and data rate to ac...