533 search results - page 35 / 107 » Playing games with approximation algorithms |
111
click to vote
FLAIRS
2009
14 years 11 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
123
click to vote
SIGECOM
2003
ACM
15 years 7 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
UAI
2008
15 years 3 months ago
2008
In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. ...
120
click to vote
GI
2009
Springer
14 years 11 months ago
2009
Springer
: ConnectIT uses a graphical representation to express strategies for playing the connect-four game. With this tool we can transfer complex knowledge about the connect-four game it...
143
click to vote
QEST
2008
IEEE
15 years 8 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...