Julio Aracena
Jacques Demongeot
Eric Goles
2004
On limit cycles of monotone functions with symmetric connection graph
Theoretical Computer Science
322
2
237 – 244
10.1016/j.tcs.2004.03.010
Nicolas Basset
Gilles Geeraerts
Jean-François Raskin
Ocan Sankur
2017
Admissiblity in Concurrent Games
Ioannis Chatzigiannakis
Piotr Indyk
Fabian Kuhn
Anca Muscholl
44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland
LIPIcs
80
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
123:1–123:14
10.4230/LIPIcs.ICALP.2017.123
http://www.dagstuhl.de/dagpub/978-3-95977-041-5
Nicolas Basset
Ismaël Jecker
Arno Pauly
Jean-François Raskin
Marie Van den Boogard
2018
Beyond admissibility: Dominance between chains of strategies
arXiv 1805.11608
https://arxiv.org/abs/1805.11608
Nicolas Basset
Jean-François Raskin
Ocan Sankur
2017
Admissible Strategies in Timed Games
Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday
403–425
10.1007/978-3-319-63121-9_20
Dietmar Berwanger
2007
Admissibility in Infinite Games
STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings
188–199
10.1007/978-3-540-70918-3_17
Stanislav Böhm
Stefan Göller
Simon Halfon
Piotr Hofman
2017
On Büchi One-Counter Automata
Heribert Vollmer
Brigitte ValleĢe
34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
LIPIcs
66
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Dagstuhl, Germany
14:1–14:13
10.4230/LIPIcs.STACS.2017.14
Tomáš Brázdil
Krishnendu Chatterjee
Antonín Kučera
Petr Novotný
2012
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types
P. Madhusudan
Sanjit A. Seshia
Computer Aided Verification (CAV)
Springer
23–38
10.1007/978-3-642-31424-7_8
Romain Brenguier
Arno Pauly
Jean-François Raskin
Ocan Sankur
2017
Admissibility in Games with Imperfect Information (Invited Talk)
Roland Meyer
Uwe Nestmann
28th International Conference on Concurrency Theory (CONCUR 2017)
LIPIcs
85
Schloss Dagstuhl
2:1–2:23
10.4230/LIPIcs.CONCUR.2017.2
http://drops.dagstuhl.de/opus/volltexte/2017/7806
Romain Brenguier
Arno Pauly
Jean-François Raskin
Ocan Sankur
2017
Admissibility in Games with Imperfect Information (Invited Talk)
28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany
2:1–2:23
10.4230/LIPIcs.CONCUR.2017.2
Romain Brenguier
Guillermo A. Pérez
Jean-François Raskin
Ocan Sankur
2016
Admissibility in Quantitative Graph Games
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India
42:1–42:14
10.4230/LIPIcs.FSTTCS.2016.42
Romain Brenguier
Jean-François Raskin
Ocan Sankur
2017
Assume-admissible synthesis
Acta Inf.
54
1
41–83
10.1007/s00236-016-0273-2
Romain Brenguier
Jean-François Raskin
Mathieu Sassolas
2014
The complexity of admissibility in Omega-regular games
CSL-LICS '14, 2014
ACM
http://doi.acm.org/10.1145/2603088.2603143
Cristian S. Calude
Sanjay Jain
Bakhadyr Khoussainov
Wei Li
Frank Stephan
2017
Deciding parity games in quasipolynomial time
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017
252–263
10.1145/3055399.3055409
Krishnendu Chatterjee
Laurent Doyen
Thomas A. Henzinger
Jean-François Raskin
2010
Generalized Mean-payoff and Energy Games
Kamal Lodaya
Meena Mahajan
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)
Leibniz International Proceedings in Informatics (LIPIcs)
8
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Dagstuhl, Germany
505–516
10.4230/LIPIcs.FSTTCS.2010.505
Thomas Colcombet
2017
Logic and regular cost functions
32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
1–4
10.1109/LICS.2017.8005061
Anuj Dawar
Erich Grädel
2008
The Descriptive Complexity of Parity Games
Michael Kaminski
Simone Martini
Computer Science Logic (CSL)
Springer
354–368
10.1007/978-3-540-87531-4_26
Anuj Dawar
Yuri Gurevich
2002
Fixed point logics
Bulletin of Symbolic Logic
8
1
65–88
10.2178/bsl/1182353853
Allan Gibbard
1973
Manipulation of Voting Schemes: A General Result
Econometrica
41
4
587–601
10.2307/1914083
Marcin Jurdzinski
1998
Deciding the winner in parity games is in UP co-UP
Information Processing Letters
68
119–124
10.1016/S0020-0190(98)00150-1
Marcin Jurdziński
Ranko Lazi\'c
Sylvain Schmitz
2015
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
Magnús M. Halldórsson
Kazuo Iwama
Naoki Kobayashi
Bettina Speckmann
Automata, Languages, and Programming (ICALP)
Springer
Berlin, Heidelberg
260–272
10.1007/978-3-662-47666-6_21
A D Korshunov
2003
Monotone Boolean functions
Russian Mathematical Surveys
58
5
929
10.1070/RM2003v058n05ABEH000667
D. Lubell
1966
A short proof of Sperner's lemma
Journal of Combinatorial Theory
1
2
299
10.1016/S0021-9800(66)80035-2
Donald A. Martin
1975
Borel Determinacy
Annals of Mathematics
102
2
pp. 363–371
10.2307/1971035
Y. Robert
M. Tchuente
1985
Connection-graph and iteration-graph of monotone boolean functions
Discrete Applied Mathematics
11
3
245 – 253
10.1016/0166-218X(85)90076-9
http://www.sciencedirect.com/science/article/pii/0166218X85900769
Leslie G. Valiant
Michael S. Paterson
1975
Deterministic one-counter automata
Journal of Computer and System Sciences
10
3
340 – 350
10.1016/S0022-0000(75)80005-5