Sciweavers

41 search results - page 6 / 9
» On the geographic distribution of on-line game servers and p...
Sort
View
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
14 years 22 days ago
Playing large games using simple strategies
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...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
ACMACE
2005
ACM
14 years 1 months ago
Fast delivery of game events with an optimistic synchronization mechanism in massive multiplayer online games
As smart players often win MMOG sessions by adopting frantic gaming strategies along the game evolution, also the system activities concerned with the distributed support of MMOGs...
Stefano Ferretti, Marco Roccetti
ICDE
2009
IEEE
121views Database» more  ICDE 2009»
14 years 2 months ago
Scalability for Virtual Worlds
— Networked virtual environments (net-VEs) are the next wave of digital entertainment, with Massively Multiplayer Online Games (MMOs) a very popular instance. Current MMO archite...
Nitin Gupta 0003, Alan J. Demers, Johannes Gehrke,...
ICCCN
2007
IEEE
14 years 1 months ago
Grid Computing on Massively Multi-User Online Platform
—Large-scale online applications such as Massively Multiplayer Online Games (MMOGs) require large amount of computing resources that support many players interacting simultaneous...
Y. C. Allen Yu, Ka Lun Eddie Law
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 7 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna