Sciweavers

48 search results - page 1 / 10
» The Winning Ways of Concurrent Games
Sort
View
LICS
2012
IEEE
11 years 7 months ago
The Winning Ways of Concurrent Games
Abstract—A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an ex...
Pierre Clairambault, Julian Gutierrez, Glynn Winsk...
LICS
2009
IEEE
13 years 11 months ago
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience
—We exhibit a deterministic concurrent reachability game PURGATORYn with n non-terminal positions and a binary choice for both players in every position so that any positional st...
Kristoffer Arnsfelt Hansen, Michal Koucký, ...
LICS
2000
IEEE
13 years 9 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
FLAIRS
2008
13 years 7 months ago
Win, Lose, or Get Out the Way - Eliminating Unnecessary Evaluation in Game Search
In this paper we present our approach of improving the traditional alpha-beta search process for strategic board games by modifying the method in two ways: 1) forgoing the evaluat...
Hsiu-Chin Lin, Colleen van Lent
DIMACS
1996
13 years 6 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin