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 3^n 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 zero-sum games on infinite graphs, with objectives specified as sets of infinite words o...
We discuss several notions of "simple" winning strategies for Banach-Mazur games on graphs, such as ...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
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...
AbstractThe concept of an infinite game played on a finite graph is perhaps novel in the context of ...
We investigate the existence and the complexity of computing and implementing optimal winning strate...
We consider the complexity of infinite games played on finite graphs. We estab-lish a framework in w...
We continue the investigation of finite-duration variants of infinite-duration games by extending kn...
Delay games are two-player games of infinite duration in which one player may delay her moves to obt...
Delay games are two-player games of infinite duration in which one player may delay her moves to obt...
We consider an extension of Church\u27s synthesis problem to ordinals by adding limit transitions to...
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning c...
We continue the investigation of delay games, infinite games in which one player may postpone her mo...
We continue the investigation of delay games, infinite games in which one player may postpone her mo...
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words o...
We discuss several notions of "simple" winning strategies for Banach-Mazur games on graphs, such as ...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
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...
AbstractThe concept of an infinite game played on a finite graph is perhaps novel in the context of ...
We investigate the existence and the complexity of computing and implementing optimal winning strate...
We consider the complexity of infinite games played on finite graphs. We estab-lish a framework in w...
We continue the investigation of finite-duration variants of infinite-duration games by extending kn...
Delay games are two-player games of infinite duration in which one player may delay her moves to obt...
Delay games are two-player games of infinite duration in which one player may delay her moves to obt...
We consider an extension of Church\u27s synthesis problem to ordinals by adding limit transitions to...
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning c...
We continue the investigation of delay games, infinite games in which one player may postpone her mo...
We continue the investigation of delay games, infinite games in which one player may postpone her mo...
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words o...
We discuss several notions of "simple" winning strategies for Banach-Mazur games on graphs, such as ...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...