234 search results - page 29 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
107
click to vote
SODA
2012
ACM
13 years 5 days ago
2012
ACM
A Nash Equilibrium is a joint strategy profile at which each agent myopically plays a best response to the other agents’ strategies, ignoring the possibility that deviating fro...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
156
click to vote
INFOCOM
2012
IEEE
13 years 5 days ago
2012
IEEE
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...