Sciweavers

40 search results - page 2 / 8
» Fast winning strategies in positional games
Sort
View
JCT
2007
85views more  JCT 2007»
13 years 5 months ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
LICS
2009
IEEE
14 years 11 days 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 10 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
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
14 years 11 days ago
Lion and man game in the presence of a circular obstacle
— In the lion and man game, a lion tries to capture a man who is as fast as the lion. We study a new version of this game which takes place in a Euclidean environment with a circ...
Nikhil Karnad, Volkan Isler
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 5 months ago
Best-Effort Strategies for Losing States
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
Marco Faella