206 search results - page 15 / 42 » Computing Equilibria in Anonymous Games |
136
click to vote
DIALM
2003
ACM
15 years 7 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
116
Voted
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
UAI
2000
15 years 3 months ago
2000
We introduce Game networks (G nets), a novel representation for multi-agent decision problems. Compared to other game-theoretic representations, such as strategic or extensive for...
111
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...