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