230 search results - page 4 / 46 » UPPAAL-Tiga: Time for Playing Games! |
JMLR
2010
13 years 2 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
NETGAMES
2005
ACM
14 years 29 days ago
2005
ACM
This paper presents traffic measurement of a Massively Multiplayer On-line Role Playing Game (MMORPG). This analysis characterizes the MMORPG traffic and shows its implications fo...
SIGECOM
2003
ACM
14 years 19 days ago
2003
ACM
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...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Game theoretic models of learning which are based on the strategic form of the game cannot explain learning in games with large extensive form. We study learning in such games by ...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...