533 search results - page 2 / 107 » Playing games with approximation algorithms |
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
JMLR
2010
12 years 11 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...