Sciweavers

466 search results - page 47 / 94
» A Parallel General Game Player
Sort
View
SIROCCO
2008
13 years 11 months ago
Computing Approximate Nash Equilibria in Network Congestion Games
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...
Andreas Emil Feldmann, Heiko Röglin, Berthold...
ATAL
2011
Springer
12 years 10 months ago
Solving Stackelberg games with uncertain observability
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...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
MFCS
2010
Springer
13 years 8 months ago
Asynchronous Omega-Regular Games with Partial Information
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...
Bernd Puchala
ATAL
2009
Springer
14 years 4 months ago
Adversarial search with procedural knowledge heuristic
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...
Viliam Lisý, Branislav Bosanský, Mic...
NETGAMES
2005
ACM
14 years 3 months ago
A distributed event delivery method with load balancing for MMORPG
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...
Shinya Yamamoto, Yoshihiro Murata, Keiichi Yasumot...