466 search results - page 47 / 94 » A Parallel General Game Player |
131
Voted
SIROCCO
2008
15 years 5 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
130
Voted
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
133
Voted
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
129
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
150
Voted
NETGAMES
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we propose a new distributed event delivery method for MMORPG (Massively Multiplayer Online Role Playing Games). In our method, the whole game space is divided into...