48 search results - page 4 / 10 » The Winning Ways of Concurrent Games |
79
Voted
JAL
2002
14 years 11 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
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...
JCT
2010
14 years 10 months ago
2010
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
78
Voted
SIAMDM
2008
14 years 11 months ago
2008
Let m and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vert...