Memoryless determinacy of infinite parity games: Another simple proof

被引：0

作者：

Le Roux, Stephane ^{[1
]}

机构：

[1] Tech Univ Darmstadt, Fachbereich Math, Darmstadt, Germany

来源：

INFORMATION PROCESSING LETTERS | 2019年 / 143卷

关键词：

Formal methods; Positional determinacy; Finitely many priorities; Infinite graph; (Transfinite) induction;

D O I：

10.1016/j.ipl.2018.10.015

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In 1998 Zielonka simplified the proofs of memoryless determinacy of infinite parity games. In 2018 Haddad simplified some proofs of memoryless determinacy of finite parity games. This article adapts Haddad's technique for infinite parity games. Two proofs are given, a shorter one and a more constructive one. None of them uses Zielonka's traps and attractors. (C) 2018 Published by Elsevier B.V.

引用

页码：8 / 13

页数：6

共 50 条

[41] Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)
Panagiota N. Panagopoulou
Paul G. Spirakis
Theory of Computing Systems, 2014, 54 : 479 - 490
[42] Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)
Panagopoulou, Panagiota N.
Spirakis, Paul G.
THEORY OF COMPUTING SYSTEMS, 2014, 54 (03) : 479 - 490
[43] Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof)
Panagopoulou, Panagiota N.
Spirakis, Paul G.
ALGORITHMIC GAME THEORY, 2011, 6982 : 190 - 199
[44] Another existence and uniqueness proof for the Higman-Sims simple group
Michler, GO
Previtali, A
ALGEBRA COLLOQUIUM, 2005, 12 (03) : 369 - 398
[45] Another simple proof of the high girth, high chromatic number theorem
Marshall, Simon
AMERICAN MATHEMATICAL MONTHLY, 2008, 115 (01): : 68 - 70
[46] A SIMPLE PROOF FOR THE CONTINUITY OF INFINITE CONVOLUTIONS OF BINARY RANDOM-VARIABLES
GALAMBOS, J
KATAI, I
STATISTICS & PROBABILITY LETTERS, 1989, 7 (05) : 369 - 370
[47] Infinite divisibility of infinite sums of lower records: a simple proof (vol 41, pg 1187, 2004)
Iksanov, A. M.
JOURNAL OF APPLIED PROBABILITY, 2006, 43 (02) : 602 - 602
[48] Another Uniqueness Proof of the Dickson Simple Group G2(3)
Michler, Gerhard O.
Wang, Lizhong
ALGEBRA COLLOQUIUM, 2011, 18 (02) : 181 - 210
[49] Another proof that assignment games have singleton cores only if multiple optimal matchings exist
Wako, Jun
ECONOMIC THEORY, 2006, 29 (01) : 213 - 217
[50] Another proof that assignment games have singleton cores only if multiple optimal matchings exist
Jun Wako
Economic Theory, 2006, 29 : 213 - 217

← 1 2 3 4 5 →