In this paper we give a survey of certain results on the determinacy of games on ordinals and its various applications. A more comprehensive treatment including more detailed versions, extensions and proofs of the theorems mentioned here, will appear in a forthcoming paper by the authors
Two structures A and B are n-equivalent if player II has a winning strategy in the n-move Ehrenfeuch...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
We consider an extension of Church\u27s synthesis problem to ordinals by adding limit transitions to...
In this paper we give a survey of certain results on the determinacy of games on ordinals and its v...
Let λ be an ordinal and A ⊆ λ^ω x λ^ω. As usual we associate with it the game G(A;λ): I II I and II ...
Let λ be an ordinal and A ⊆ λ^ω x λ^ω. As usual we associate with it the game G(A;λ): I II I and II ...
The traditional field of cardinal game theory requires that the objective functions, which map the c...
The traditional field of cardinal game theory requires that the objective functions, which map the c...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
Abstract. We introduce a new method, involving infinite games and Borel determinacy, which we use to...
A fundamental theorem of Buchi and Landweber shows that the Church synthesisproblem is computable. B...
The 2×2 games, the the simplest of all games, serve as the workhorses of applied game theory. Robins...
International audienceThe graphical, hypergraphical and polymatrix games frameworks provide concise ...
In the class of smooth non-cooperative games, exact potential games and weighted potential games are...
In the class of smooth non-cooperative games, exact potential games and weighted potential games are...
Two structures A and B are n-equivalent if player II has a winning strategy in the n-move Ehrenfeuch...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
We consider an extension of Church\u27s synthesis problem to ordinals by adding limit transitions to...
In this paper we give a survey of certain results on the determinacy of games on ordinals and its v...
Let λ be an ordinal and A ⊆ λ^ω x λ^ω. As usual we associate with it the game G(A;λ): I II I and II ...
Let λ be an ordinal and A ⊆ λ^ω x λ^ω. As usual we associate with it the game G(A;λ): I II I and II ...
The traditional field of cardinal game theory requires that the objective functions, which map the c...
The traditional field of cardinal game theory requires that the objective functions, which map the c...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
Abstract. We introduce a new method, involving infinite games and Borel determinacy, which we use to...
A fundamental theorem of Buchi and Landweber shows that the Church synthesisproblem is computable. B...
The 2×2 games, the the simplest of all games, serve as the workhorses of applied game theory. Robins...
International audienceThe graphical, hypergraphical and polymatrix games frameworks provide concise ...
In the class of smooth non-cooperative games, exact potential games and weighted potential games are...
In the class of smooth non-cooperative games, exact potential games and weighted potential games are...
Two structures A and B are n-equivalent if player II has a winning strategy in the n-move Ehrenfeuch...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
We consider an extension of Church\u27s synthesis problem to ordinals by adding limit transitions to...
DOI
Add to ORKG