Sciweavers

533 search results - page 55 / 107
» Playing games with approximation algorithms
Sort
View
NETGAMES
2005
ACM
14 years 1 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...
CG
2004
Springer
14 years 1 months ago
Searching over Metapositions in Kriegspiel
Kriegspiel is a Chess variant similar to wargames, in which players have to deal with uncertainty. Kriegspiel increases the difficulty typical of Chess by hiding from each player h...
Andrea Bolognesi, Paolo Ciancarini
AMC
2008
86views more  AMC 2008»
13 years 7 months ago
Numerical solution of stochastic Nash games with state-dependent noise for weakly coupled large-scale systems
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
Muneomi Sagara, Hiroaki Mukaidani, Toru Yamamoto
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
14 years 1 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
ATAL
2009
Springer
14 years 2 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...