Julio Aracena, Jacques Demongeot & Eric Goles (2004):
On limit cycles of monotone functions with symmetric connection graph.
Theoretical Computer Science 322(2),
pp. 237 – 244,
doi:10.1016/j.tcs.2004.03.010.
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin & Ocan Sankur (2017):
Admissiblity in Concurrent Games.
In: 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,
pp. 123:1–123:14,
doi:10.4230/LIPIcs.ICALP.2017.123.
Available at 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.
Available at https://arxiv.org/abs/1805.11608.
Nicolas Basset, Jean-François Raskin & Ocan Sankur (2017):
Admissible Strategies in Timed Games.
In: Models, Algorithms, Logics and Tools - Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday,
pp. 403–425,
doi:10.1007/978-3-319-63121-9_20.
Dietmar Berwanger (2007):
Admissibility in Infinite Games.
In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings,
pp. 188–199,
doi: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.
In: 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,
pp. 14:1–14:13,
doi: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.
In: P. Madhusudan & Sanjit A. Seshia: Computer Aided Verification (CAV).
Springer,
pp. 23–38,
doi: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).
In: Roland Meyer & Uwe Nestmann: 28th International Conference on Concurrency Theory (CONCUR 2017),
LIPIcs 85.
Schloss Dagstuhl,
pp. 2:1–2:23,
doi:10.4230/LIPIcs.CONCUR.2017.2.
Available at 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).
In: 28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany,
pp. 2:1–2:23,
doi:10.4230/LIPIcs.CONCUR.2017.2.
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin & Ocan Sankur (2016):
Admissibility in Quantitative Graph Games.
In: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India,
pp. 42:1–42:14,
doi:10.4230/LIPIcs.FSTTCS.2016.42.
Romain Brenguier, Jean-François Raskin & Mathieu Sassolas (2014):
The complexity of admissibility in Omega-regular games.
In: CSL-LICS '14, 2014.
ACM.
Available at 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.
In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017,
pp. 252–263,
doi:10.1145/3055399.3055409.
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger & Jean-François Raskin (2010):
Generalized Mean-payoff and Energy Games.
In: 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,
pp. 505–516,
doi:10.4230/LIPIcs.FSTTCS.2010.505.
Thomas Colcombet (2017):
Logic and regular cost functions.
In: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
pp. 1–4,
doi:10.1109/LICS.2017.8005061.
Anuj Dawar & Erich Grädel (2008):
The Descriptive Complexity of Parity Games.
In: Michael Kaminski & Simone Martini: Computer Science Logic (CSL).
Springer,
pp. 354–368,
doi:10.1007/978-3-540-87531-4_26.
Anuj Dawar & Yuri Gurevich (2002):
Fixed point logics.
Bulletin of Symbolic Logic 8(1),
pp. 65–88,
doi:10.2178/bsl/1182353853.
Allan Gibbard (1973):
Manipulation of Voting Schemes: A General Result.
Econometrica 41(4),
pp. 587–601,
doi:10.2307/1914083.
Marcin Jurdzinski (1998):
Deciding the winner in parity games is in UP co-UP.
Information Processing Letters 68,
pp. 119–124,
doi: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.
In: Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi & Bettina Speckmann: Automata, Languages, and Programming (ICALP).
Springer,
Berlin, Heidelberg,
pp. 260–272,
doi:10.1007/978-3-662-47666-6_21.
A D Korshunov (2003):
Monotone Boolean functions.
Russian Mathematical Surveys 58(5),
pp. 929,
doi:10.1070/RM2003v058n05ABEH000667.
D. Lubell (1966):
A short proof of Sperner's lemma.
Journal of Combinatorial Theory 1(2),
pp. 299,
doi:10.1016/S0021-9800(66)80035-2.
Donald A. Martin (1975):
Borel Determinacy.
Annals of Mathematics 102(2),
pp. pp. 363–371,
doi:10.2307/1971035.
Leslie G. Valiant & Michael S. Paterson (1975):
Deterministic one-counter automata.
Journal of Computer and System Sciences 10(3),
pp. 340 – 350,
doi:10.1016/S0022-0000(75)80005-5.
eptcs@eptcs.org