144 search results - page 13 / 29 » Computing Nash Equilibria of Action-Graph Games |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Generalized Second Price Auction, also knows as Ad Word auctions, and its variants has been the main mechanism used by search companies to auction positions for sponsored search l...
DIALM
2003
ACM
14 years 19 days 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...