Sciweavers

1410 search results - page 10 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
ATAL
2004
Springer
15 years 2 months ago
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Ke...
FUN
2010
Springer
285views Algorithms» more  FUN 2010»
15 years 2 months ago
An Algorithmic Analysis of the Honey-Bee Game
The Honey-Bee game is a two-player board game that is played on a connected hexagonal colored grid, or in a generalized setting, on a connected graph with colored nodes. In a singl...
Rudolf Fleischer, Gerhard J. Woeginger
STOC
2004
ACM
104views Algorithms» more  STOC 2004»
15 years 9 months ago
Network games
The growth in computer games and wireless networks has catalyzed the production of a new generation of hand-held game consoles that support multi-player gaming over IEEE 802.11 ne...
Éva Tardos
SODA
2010
ACM
145views Algorithms» more  SODA 2010»
14 years 7 months ago
On the Equilibria of Alternating Move Games
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
Aaron Roth, Maria-Florina Balcan, Adam Kalai, Yish...
LOGCOM
2002
100views more  LOGCOM 2002»
14 years 9 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling