This work studies the following question: can plays in a Muller game be stopped after a finite number of moves and a winner be declared? A criterion to do this is sound if Player 0 wins an infinite-duration Muller game if and only if she wins the finite-duration version. A sound criterion is presented that stops a play after at most 3n moves, where n is the size of the arena. This improves the bound (n!+1)n obtained by McNaughton and the bound n!+1 derived from a reduction to parity games.
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: ...
Delay games are two-player games of infinite duration in which one player may delay her moves to obt...
This work studies the following question: can plays in a Muller game be stopped after a finite numbe...
This work studies the following question: can plays in a Muller game be stopped after a finite numbe...
We consider the complexity of infinite games played on finite graphs. We estab-lish a framework in w...
Abstract—We transform a Muller game with n vertices into a safety game with (n!)3 vertices whose sol...
We investigate the existence and the complexity of computing and implementing optimal winning strate...
Abstract. In the musical chairs game MC(n,m), a team of n players plays against an adver-sarial sche...
Muller games are played by two players moving a token along a graph; the winner is determined by the...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
We continue the investigation of finite-duration variants of infinite-duration games by extending kn...
Abstract. Muller games are played by two players moving a token along a graph; the winner is determi...
The subject of study of game theory - games - serves as mathematical models for real-life problems. ...
The 2-player impartial game of Wythoff Nim is played on two piles of tokens. A move consists in remo...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: ...
Delay games are two-player games of infinite duration in which one player may delay her moves to obt...
This work studies the following question: can plays in a Muller game be stopped after a finite numbe...
This work studies the following question: can plays in a Muller game be stopped after a finite numbe...
We consider the complexity of infinite games played on finite graphs. We estab-lish a framework in w...
Abstract—We transform a Muller game with n vertices into a safety game with (n!)3 vertices whose sol...
We investigate the existence and the complexity of computing and implementing optimal winning strate...
Abstract. In the musical chairs game MC(n,m), a team of n players plays against an adver-sarial sche...
Muller games are played by two players moving a token along a graph; the winner is determined by the...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
We continue the investigation of finite-duration variants of infinite-duration games by extending kn...
Abstract. Muller games are played by two players moving a token along a graph; the winner is determi...
The subject of study of game theory - games - serves as mathematical models for real-life problems. ...
The 2-player impartial game of Wythoff Nim is played on two piles of tokens. A move consists in remo...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: ...
Delay games are two-player games of infinite duration in which one player may delay her moves to obt...