533 search results - page 32 / 107 » Playing games with approximation algorithms |
AAAI
2007
13 years 10 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
ATAL
2011
Springer
12 years 7 months ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
CG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...