533 search results - page 24 / 107 » Playing games with approximation algorithms |
AAMAS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract In this paper we address the problem of simultaneous learning and coordination in multiagent Markov decision problems (MMDPs) with infinite state-spaces. We separate this ...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Many real life situations, like the financial market, auctions and resources competitions, can be modeled as Minority Games. In minority games, players choose to join one of the ...
CHI
2006
ACM
14 years 9 months ago
2006
ACM
We introduce Peekaboom, an entertaining web-based game that can help computers locate objects in images. People play the game because of its entertainment value, and as a side eff...
QEST
2006
IEEE
14 years 3 months ago
2006
IEEE
A concurrent reachability game is a two-player game played on a graph: at each state, the players simultaneously and independently select moves; the two moves determine jointly a ...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...