Games with winning conditions of high Borel complexity (Q817850)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Games with winning conditions of high Borel complexity |
scientific article; zbMATH DE number 5013344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Games with winning conditions of high Borel complexity |
scientific article; zbMATH DE number 5013344 |
Statements
Games with winning conditions of high Borel complexity (English)
0 references
20 March 2006
0 references
This research work represents a significant contribution to the study of the infinite two-player games on pushdown graphs. The author establishes the best recent result concerning the families of decidable winning conditions for arbitrary finite Borel complexity with the important particular cases of games played on finite graphs. The method provides effective winning strategies and the exact form of the winning sets together with the existence of positional strategies remains open. Several pertinent references complete the paper.
0 references
pushdown automata
0 references
infinite two player games
0 references
winning decidable condition
0 references
0 references
0.9292667
0 references
0.8739408
0 references
0.8593756
0 references
0 references
0.8549989
0 references
0.8545497
0 references
0.8513612
0 references
