533 search results - page 13 / 107 » Playing games with approximation algorithms |
NETGAMES
2004
ACM
14 years 29 days ago
2004
ACM
Ordering of command messages from the clients at the game servers is an important issue that impacts fairness, response times, and smoothness of the game play. Recently, protocols...
KI
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player gam...
COCOA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
A satisfactory multiagent learning algorithm should, at a minimum, learn to play optimally against stationary opponents and converge to a Nash equilibrium in self-play. The algori...
FORMATS
2005
Springer
14 years 1 months ago
2005
Springer
We consider real-time games where the goal consists, for each player, in maximizing the average amount of reward he or she receives per time unit. We consider zero-sum rewards, so ...