✦ LIBER ✦

The determinacy of context-free games

✍ Scribed by Finkel, Olivier

Book ID: 121837213
Publisher: Association for Symbolic Logic
Year: 2013
Tongue: English
Weight: 221 KB
Volume: 78
Category: Article
ISSN: 0022-4812
DOI: 10.2178/jsl.7804050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Active Context-Free Games

✍ Anca Muscholl; Thomas Schwentick; Luc Segoufin 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 397 KB

On the positional determinacy of edge-la

On the positional determinacy of edge-labeled games

✍ Thomas Colcombet; Damian Niwiński 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Generic determinacy of Nash equilibrium

Generic determinacy of Nash equilibrium in network-formation games

✍ Carlos Pimienta 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 176 KB

Weak axioms of determinacy and subsystem

Weak axioms of determinacy and subsystems of analysis II (∑02 games)

✍ Kazuyuki Tanaka 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 901 KB

Weak axioms of determinacy and subsystem

Weak axioms of determinacy and subsystems of analysis I: δ games

✍ Kazuyuki Tanaka 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

Memoryless determinacy of parity and mea

Memoryless determinacy of parity and mean payoff games: a simple proof

✍ Henrik Björklund; Sven Sandberg; Sergei Vorobyov 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We give a simple, direct, and constructive proof of memoryless determinacy for parity and mean payo games. First, we prove by induction that the ÿnite duration versions of these games, played until some vertex is repeated, are determined and both players have memoryless winning strategies. In contra