Sciweavers

179 search results - page 2 / 36
» On Learning Algorithms for Nash Equilibria
Sort
View
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
CDC
2009
IEEE
178views Control Systems» more  CDC 2009»
13 years 10 months ago
Distributed coverage games for mobile visual sensors (I): Reaching the set of Nash equilibria
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...
Minghui Zhu, Sonia Martínez
COCOON
2009
Springer
13 years 12 months ago
On the Performances of Nash Equilibria in Isolation Games
: Network games play a fundamental role in understanding behavior in many domains, ranging from communication networks through markets to social networks. Such networks are used, a...
Vittorio Bilò, Michele Flammini, Gianpiero ...
COLT
2004
Springer
13 years 10 months ago
Deterministic Calibration and Nash Equilibrium
Abstract. We provide a natural learning process in which the joint frequency of empirical play converges into the set of convex combinations of Nash equilibria. In this process, al...
Sham Kakade, Dean P. Foster
STOC
2004
ACM
96views Algorithms» more  STOC 2004»
14 years 5 months ago
The complexity of pure Nash equilibria
Alex Fabrikant, Christos H. Papadimitriou, Kunal T...