Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.”https://doi.org/10.1007/978-3-319-10575-8_27__In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018.https://doi.org/10.1007/978-3-319-10575-8_27 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.”https://doi.org/10.1007/978-3-319-95246-8_9__In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018.https://doi.org/10.1007/978-3-319-95246-8_9 .

Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.”https://doi.org/10.1038/s41467-017-02721-8__Nature Communications. Nature Publishing Group, 2018.https://doi.org/10.1038/s41467-017-02721-8 .

Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kudera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,”https://doi.org/10.1145/3209108.3209191__8033:185–94. IEEE, 2018.https://doi.org/10.1145/3209108.3209191 .

Hilbe, Christian, Stepán Simsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.”https://doi.org/10.1038/s41586-018-0277-x__Nature. Nature Publishing Group, 2018.https://doi.org/10.1038/s41586-018-0277-x .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,”https://doi.org/10.1137/1.9781611975031.151__2341–56. ACM, 2018.https://doi.org/10.1137/1.9781611975031.151 .

Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.”https://doi.org/10.1007/978-3-030-02768-1_11__edited by Sukyoung Ryu, 11275:181–201. Springer, 2018.https://doi.org/10.1007/978-3-030-02768-1_11 .

Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.”https://doi.org/10.1038/s41562-018-0320-9__Nature Human Behaviour. Nature Publishing Group, 2018.https://doi.org/10.1038/s41562-018-0320-9 .

Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,”https://doi.org/10.1007/978-3-319-99154-2_4__11024:53–70. Springer, 2018.https://doi.org/10.1007/978-3-319-99154-2_4 .

Brázdil, Tomás, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,”https://doi.org/10.1007/978-3-319-89960-2_21__10805:385–407. Springer, 2018.https://doi.org/10.1007/978-3-319-89960-2_21 .

Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,”https://doi.org/10.1007/978-3-319-96142-2_13__10982:178–97. Springer, 2018.https://doi.org/10.1007/978-3-319-96142-2_13 .

Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.”https://doi.org/10.1038/s41562-018-0354-z__Nature Human Behaviour. Nature Publishing Group, 2018.https://doi.org/10.1038/s41562-018-0354-z .

Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.”https://doi.org/10.1145/3219166.3219198__In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, 149–50. ACM Press, 2018.https://doi.org/10.1145/3219166.3219198 .

Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.”https://doi.org/10.1145/3174800__ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018.https://doi.org/10.1145/3174800 .

Horák, Karel, Branislav Bosanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.”https://doi.org/10.24963/ijcai.2018/662__In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018.https://doi.org/10.24963/ijcai.2018/662 .

Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,”https://doi.org/10.24963/ijcai.2018/652__2018:4692–99. IJCAI, 2018.https://doi.org/10.24963/ijcai.2018/652 .

Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.

Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”https://doi.org/10.1007/s11241-017-9293-4__Real-Time Systems. Springer, 2018.https://doi.org/10.1007/s11241-017-9293-4 .

Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.”https://doi.org/10.1098/rsif.2018.0073__Journal of the Royal Society Interface. The Royal Society, 2018.https://doi.org/10.1098/rsif.2018.0073 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.”https://doi.org/10.1038/s42003-018-0078-7__Communications Biology. Springer Nature, 2018.https://doi.org/10.1038/s42003-018-0078-7 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,”https://doi.org/10.4230/LIPIcs.CONCUR.2018.11__Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.CONCUR.2018.11 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,”https://doi.org/10.1007/978-3-319-89884-1_26__10801:739–67. Springer, 2018.https://doi.org/10.1007/978-3-319-89884-1_26 .

Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.”https://doi.org/10.1109/Cybermatics_2018.2018.00231__In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018.https://doi.org/10.1109/Cybermatics_2018.2018.00231 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.”https://doi.org/10.1145/3210257__ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018.https://doi.org/10.1145/3210257 .

Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.”https://doi.org/10.24963/ijcai.2018/653__In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018.https://doi.org/10.24963/ijcai.2018/653 .

Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.”https://doi.org/10.1073/pnas.1810565115__PNAS. National Academy of Sciences, 2018.https://doi.org/10.1073/pnas.1810565115 .

Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.”https://doi.org/10.1145/3158121__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158121 .

Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.”https://doi.org/10.23638/LMCS-13(3:26)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(3:26)2017 .

Chatterjee, Krishnendu, Zuzana Ketínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”https://doi.org/10.23638/LMCS-13(2:15)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(2:15)2017 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1145/3152769__ACM Transactions on Computational Logic (TOCL). ACM, 2017.https://doi.org/10.1145/3152769 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(3:23)2017 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.”https://doi.org/10.1038/s41598-017-00107-w__Scientific Reports. Nature Publishing Group, 2017.https://doi.org/10.1038/s41598-017-00107-w .

Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.”https://doi.org/10.1145/3158118__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158118 .

Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017.https://doi.org/10.15479/AT:IST-2017-870-v1-1 .

Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.”https://doi.org/10.1145/3158119__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158119 .

Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017.https://doi.org/10.15479/AT:IST-2017-872-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.”https://doi.org/10.4230/LIPIcs.MFCS.2017.61__In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.MFCS.2017.61 .

Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.”https://doi.org/10.4230/LIPIcs.MFCS.2017.39__In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.MFCS.2017.39 .

Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.”https://doi.org/10.4230/LIPIcs.MFCS.2017.55__In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.MFCS.2017.55 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.”https://doi.org/10.1007/978-3-319-63121-9_18__In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017.https://doi.org/10.1007/978-3-319-63121-9_18 .

Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.”https://doi.org/10.1007/978-3-319-63387-9_6__edited by Rupak Majumdar and Viktor Kundak, 10426:118–39. Springer, 2017.https://doi.org/10.1007/978-3-319-63387-9_6 .

Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.”https://doi.org/10.1007/978-3-319-63387-9_10__edited by Rupak Majumdar and Viktor Kundak, 10426:201–21. Springer, 2017.https://doi.org/10.1007/978-3-319-63387-9_10 .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,”https://doi.org/10.4230/LIPICS.CSL.2017.18__Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.https://doi.org/10.4230/LIPICS.CSL.2017.18 .

Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Boei, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.”https://doi.org/10.1038/ng.3764__Nature Genetics. Nature Publishing Group, 2017.https://doi.org/10.1038/ng.3764 .

Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.”https://doi.org/10.1073/pnas.1621239114__PNAS. National Academy of Sciences, 2017.https://doi.org/10.1073/pnas.1621239114 .

Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.”https://doi.org/10.1016/j.ic.2016.10.012__Information and Computation. Elsevier, 2017.https://doi.org/10.1016/j.ic.2016.10.012 .

Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.”https://doi.org/10.1017/jsl.2016.71__Journal of Symbolic Logic. Cambridge University Press, 2017.https://doi.org/10.1017/jsl.2016.71 .

Veller, Carl, Laura Hayward, Martin Nowak, and Christian Hilbe. “The Red Queen and King in Finite Populations.”https://doi.org/10.1073/pnas.1702020114__PNAS. National Academy of Sciences, 2017.https://doi.org/10.1073/pnas.1702020114 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.5__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.5 .

Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.”https://doi.org/10.1145/3121408__Journal of the ACM. ACM, 2017.https://doi.org/10.1145/3121408 .

Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.”https://doi.org/10.1016/j.jcss.2017.04.005__Journal of Computer and System Sciences. Academic Press, 2017.https://doi.org/10.1016/j.jcss.2017.04.005 .

Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.”https://doi.org/10.1007/s00236-017-0299-0__Acta Informatica. Springer, 2017.https://doi.org/10.1007/s00236-017-0299-0 .

Kretinsky, Jan, Tobias Meggendorfer, Clara Waldmann, and Maximilian Weininger. “Index Appearance Record for Transforming Rabin Automata into Parity Automata.”https://doi.org/10.1007/978-3-662-54577-5_26__In Tools and Algorithms for the Construction and Analysis of Systems, 10205:443–60. Springer, 2017.https://doi.org/10.1007/978-3-662-54577-5_26 .

Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.21__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.21 .

Pavlogiannis, Andreas. “Algorithmic Advances in Program Analysis and Their Applications.”https://doi.org/10.15479/AT:ISTA:th_854__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:th_854 .

Svoreová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”https://doi.org/10.1016/j.nahs.2016.04.006__Nonlinear Analysis: Hybrid Systems. Elsevier, 2017.https://doi.org/10.1016/j.nahs.2016.04.006 .

Brázdil, Tomás, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Trading Performance for Stability in Markov Decision Processes.”https://doi.org/10.1016/j.jcss.2016.09.009__Journal of Computer and System Sciences. Elsevier, 2017.https://doi.org/10.1016/j.jcss.2016.09.009 .

Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Boei, Krishnendu Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing Metastatic Seeding Patterns of Human Cancers.”https://doi.org/10.1038/ncomms14114__Nature Communications. Nature Publishing Group, 2017.https://doi.org/10.1038/ncomms14114 .

Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.”https://doi.org/10.1016/j.ipl.2017.02.003__Information Processing Letters. Elsevier, 2017.https://doi.org/10.1016/j.ipl.2017.02.003 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.”https://doi.org/10.1016/j.ic.2016.10.006__Information and Computation. Elsevier, 2017.https://doi.org/10.1016/j.ic.2016.10.006 .

Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.”https://doi.org/10.1007/978-3-662-54434-1_11__edited by Hongseok Yang, 10201:287–313. Springer, 2017.https://doi.org/10.1007/978-3-662-54434-1_11 .

Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In Proceedings of the 31st AAAI Conference on Artificial Intelligence, 5:3725–32. AAAI Press, 2017.

Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.”https://doi.org/10.1016/j.jtbi.2017.08.025__https://doi.org/10.1016/j.jtbi.2017.08.025__Journal of Theoretical Biology. Elsevier, 2017.https://doi.org/10.1016/j.jtbi.2017.08.025 .

Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,”https://doi.org/10.1145/3009837.3009873__52:145–60. ACM, 2017.https://doi.org/10.1145/3009837.3009873 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.”https://doi.org/10.15479/AT:ISTA:51__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:51 .

Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.”https://doi.org/10.1007/978-3-319-63390-9_3__edited by Rupak Majumdar and Viktor Kundak, 10427:41–63. Springer, 2017.https://doi.org/10.1007/978-3-319-63390-9_3 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.”https://doi.org/10.1007/978-3-319-68167-2_4__edited by Deepak D’Souza, 10482:59–66. Springer, 2017.https://doi.org/10.1007/978-3-319-68167-2_4 .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,”https://doi.org/10.4230/LIPIcs.MFCS.2016.25__Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.MFCS.2016.25 .

Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,”https://doi.org/10.4230/LIPIcs.ICALP.2016.100__Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.https://doi.org/10.4230/LIPIcs.ICALP.2016.100 .

Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,”https://doi.org/10.4230/LIPIcs.ICALP.2016.98__Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.https://doi.org/10.4230/LIPIcs.ICALP.2016.98 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,”https://doi.org/10.4230/LIPIcs.MFCS.2016.24__Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.MFCS.2016.24 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Automata under Probabilistic Semantics.”https://doi.org/10.1145/2933575.2933588__In Proceedings of the 31st Annual ACM/IEEE Symposium, 76–85. IEEE, 2016.https://doi.org/10.1145/2933575.2933588 .

Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.”https://doi.org/10.1145/2933575.2935304__In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 197–206. IEEE, 2016.https://doi.org/10.1145/2933575.2935304 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.

Hilbe, Christian, and Arne Traulsen. “Only the Combination of Mathematics and Agent Based Simulations Can Leverage the Full Potential of Evolutionary Modeling: Comment on ‘Evolutionary Game Theory Using Agent-Based Methods’ by C. Adami, J. Schossau and A. Hintze.”https://doi.org/10.1016/j.plrev.2016.10.004__Physics of Life Reviews. Elsevier, 2016.https://doi.org/10.1016/j.plrev.2016.10.004 .

Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.”https://doi.org/10.1145/2818052.2869122__In Proceedings of the ACM Conference on Computer Supported Cooperative Work, 26:365–68. ACM, 2016.https://doi.org/10.1145/2818052.2869122 .

Brázdil, Tomás, Vojtbch Forejt, Antonín Kudera, and Petr Novotný. “Stability in Graphs and Games,”https://doi.org/10.4230/LIPIcs.CONCUR.2016.10__Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.CONCUR.2016.10 .

Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016.

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, 1465–66. ACM, 2016.

Brázdil, Tomás, Antonín Kudera, and Petr Novotný. “Optimizing the Expected Mean Payoff in Energy Markov Decision Processes,”https://doi.org/10.1007/978-3-319-46520-3_3__9938:32–49. Springer, 2016.https://doi.org/10.1007/978-3-319-46520-3_3 .

Milinski, Manfred, Christian Hilbe, Dirk Semmann, Ralf Sommerfeld, and Jochem Marotzke. “Humans Choose Representatives Who Enforce Cooperation in Social Dilemmas through Extortion.”https://doi.org/10.1038/ncomms10915__Nature Communications. Nature Publishing Group, 2016.https://doi.org/10.1038/ncomms10915 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Monitor Automata,”https://doi.org/10.1007/978-3-662-53413-7_2__9837:23–38. Springer, 2016.https://doi.org/10.1007/978-3-662-53413-7_2 .

Hansen, Kristoffer, Rasmus Ibsen-Jensen, and Michal Koucký. “The Big Match in Small Space,”https://doi.org/10.1007/978-3-662-53354-3_6__9928:64–76. Springer, 2016.https://doi.org/10.1007/978-3-662-53354-3_6 .

Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Complexity of the Orbit Problem.”https://doi.org/10.1145/2857050__Journal of the ACM. ACM, 2016.https://doi.org/10.1145/2857050 .

Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On Recurrent Reachability for Continuous Linear Dynamical Systems.”https://doi.org/10.1145/2933575.2934548__In LICS ’16, 515–24. IEEE, 2016.https://doi.org/10.1145/2933575.2934548 .

Chakra, Maria, Christian Hilbe, and Arne Traulsen. “Coevolutionary Interactions between Farmers and Mafia Induce Host Acceptance of Avian Brood Parasites.”https://doi.org/10.1098/rsos.160036__Royal Society Open Science. Royal Society, The, 2016.https://doi.org/10.1098/rsos.160036 .

Baek, Seung, Hyeongchai Jeong, Christian Hilbe, and Martin Nowak. “Comparing Reactive and Memory-One Strategies of Direct Reciprocity.”https://doi.org/10.1038/srep25676__Scientific Reports. Nature Publishing Group, 2016.https://doi.org/10.1038/srep25676 .

Lohse, Konrad, Martin Chmelik, Simon Martin, and Nicholas H Barton. “Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent.”https://doi.org/10.1534/genetics.115.183814__Genetics. Genetics Society of America, 2016.https://doi.org/10.1534/genetics.115.183814 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,”https://doi.org/10.3233/978-1-61499-672-9-1432__285:1432–39. IOS Press, 2016.https://doi.org/10.3233/978-1-61499-672-9-1432 .

Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,”https://doi.org/10.1145/2933575.2934513__05-08-July-2016:247–56. IEEE, 2016.https://doi.org/10.1145/2933575.2934513 .

Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives.”https://doi.org/10.1016/j.jcss.2016.02.009__Journal of Computer and System Sciences. Elsevier, 2016.https://doi.org/10.1016/j.jcss.2016.02.009 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.”https://doi.org/10.1016/j.artint.2016.01.007__Artificial Intelligence. Elsevier, 2016.https://doi.org/10.1016/j.artint.2016.01.007 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative Interprocedural Analysis. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-523-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-648-v1-1 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2017-749-v3-1 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-728-v1-1 .

Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Experimental Game Instructions.”https://doi.org/10.1371/journal.pone.0163867.s008__Public Library of Science, 2016.https://doi.org/10.1371/journal.pone.0163867.s008 .

Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Asymmetric Power Boosts Extortion in an Economic Experiment.”https://doi.org/10.1371/journal.pone.0163867__PLoS One. Public Library of Science, 2016.https://doi.org/10.1371/journal.pone.0163867 .