[{"year":"2017","date_created":"2018-12-11T11:47:39Z","doi":"10.1007/978-3-319-63390-9_3","publication_identifier":{"isbn":["978-331963389-3"]},"quality_controlled":"1","conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","location":"Heidelberg, Germany","end_date":"2017-07-28"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.00317"}],"volume":10427,"editor":[{"last_name":"Majumdar","first_name":"Rupak","full_name":"Majumdar, Rupak"},{"last_name":"Kunčak","first_name":"Viktor","full_name":"Kunčak, Viktor"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"last_name":"Goharshady","first_name":"Amir","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"status":"public","id":"7014","relation":"later_version"},{"id":"8934","relation":"dissertation_contains","status":"public"}]},"abstract":[{"text":"We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of non-recursive programs. First, we apply ranking functions to recursion, resulting in measure functions, and show that they provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in non-polynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas’ Lemma, and Handelman’s Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form O(n log n) as well as O(nr) where r is not an integer. We present experimental results to demonstrate that our approach can efficiently obtain worst-case bounds of classical recursive algorithms such as Merge-Sort, Closest-Pair, Karatsuba’s algorithm and Strassen’s algorithm.","lang":"eng"}],"external_id":{"isi":["000431900900003"],"arxiv":["1705.00317"]},"publication_status":"published","page":"41 - 63","article_processing_charge":"No","title":"Non-polynomial worst case analysis of recursive programs","ec_funded":1,"day":"01","status":"public","alternative_title":["LNCS"],"project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"citation":{"ista":"Chatterjee K, Fu H, Goharshady AK. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427, 41–63.","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst case analysis of recursive programs. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:41-63. doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">10.1007/978-3-319-63390-9_3</a>","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.","mla":"Chatterjee, Krishnendu, et al. <i>Non-Polynomial Worst Case Analysis of Recursive Programs</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 41–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">10.1007/978-3-319-63390-9_3</a>.","apa":"Chatterjee, K., Fu, H., &#38; Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">https://doi.org/10.1007/978-3-319-63390-9_3</a>","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor Kunčak, 10427:41–63. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">https://doi.org/10.1007/978-3-319-63390-9_3</a>."},"type":"conference","oa_version":"Submitted Version","intvolume":"     10427","_id":"639","scopus_import":"1","publist_id":"7149","oa":1,"isi":1,"department":[{"_id":"KrCh"}],"arxiv":1,"publisher":"Springer","date_updated":"2026-09-04T22:31:01Z","language":[{"iso":"eng"}],"month":"01","date_published":"2017-01-01T00:00:00Z"},{"file":[{"file_size":564560,"date_updated":"2018-12-12T10:17:31Z","access_level":"open_access","relation":"main_file","file_id":"5286","creator":"system","file_name":"IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:17:31Z"}],"quality_controlled":"1","conference":{"start_date":"2016-08-22","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2016-08-26","location":"Krakow; Poland"},"ddc":["004"],"has_accepted_license":"1","article_number":"24","date_created":"2018-12-11T11:50:05Z","year":"2016","doi":"10.4230/LIPIcs.MFCS.2016.24","publication_status":"published","abstract":[{"text":" While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than weighted automata (e.g., average response time can be expressed with nested weighted automata), but the basic decision questions have higher complexity (e.g., for deterministic automata, the emptiness question for nested weighted automata is PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME). We consider a natural subclass of nested weighted automata where at any point at most a bounded number k of slave automata can be active. We focus on automata whose master value function is the limit average. We show that these nested weighted automata with bounded width are strictly more expressive than weighted automata (e.g., average response time with no overlapping requests can be expressed with bound k=1, but not with non-nested weighted automata). We show that the complexity of the basic decision problems (i.e., emptiness and universality) for the subclass with k constant matches the complexity for weighted automata. Moreover, when k is part of the input given in unary we establish PSPACE-completeness.","lang":"eng"}],"article_processing_charge":"No","title":"Nested weighted limit-average automata of bounded width","volume":58,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science, Krakow; Poland, 2016, vol. 58.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>","ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 58, 24.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science, Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Limit-Average Automata of Bounded Width</i>. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"pubrep_id":"795","status":"public","day":"01","alternative_title":["LIPIcs"],"file_date_updated":"2018-12-12T10:17:31Z","oa":1,"date_updated":"2025-07-10T11:50:02Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2016-08-01T00:00:00Z","language":[{"iso":"eng"}],"month":"08","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under grant 2014/15/D/ST6/04543.","type":"conference","oa_version":"Published Version","intvolume":"        58","scopus_import":"1","_id":"1090","publist_id":"6286"},{"doi":"10.4230/LIPIcs.CONCUR.2016.20","date_created":"2018-12-11T11:50:06Z","year":"2016","article_number":"20","has_accepted_license":"1","ddc":["004"],"conference":{"start_date":"2016-08-23","name":"CONCUR: Concurrency Theory","location":"Quebec City; Canada","end_date":"2016-08-26"},"quality_controlled":"1","file":[{"date_updated":"2018-12-12T10:11:39Z","file_size":501827,"access_level":"open_access","relation":"main_file","file_id":"4895","creator":"system","content_type":"application/pdf","file_name":"IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf","date_created":"2018-12-12T10:11:39Z"}],"related_material":{"record":[{"id":"1155","relation":"dissertation_contains","status":"public"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Daca","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"last_name":"Petrov","first_name":"Tatjana","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","full_name":"Petrov, Tatjana"}],"volume":59,"title":"Linear distances between Markov chains","publication_status":"published","abstract":[{"text":"We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by temporal logics or automata. We investigate which of the distances can be approximated by observing the systems, i.e. by black-box testing or simulation, and we provide both negative and positive results. ","lang":"eng"}],"alternative_title":["LIPIcs"],"day":"01","pubrep_id":"794","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"citation":{"ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","mla":"Daca, Przemyslaw, et al. <i>Linear Distances between Markov Chains</i>. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>"},"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"publist_id":"6283","scopus_import":1,"_id":"1093","intvolume":"        59","oa_version":"Published Version","type":"conference","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF) under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award), by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced Postdoc. Mobility Fellowship – grant number P300P2_161067.","date_published":"2016-08-01T00:00:00Z","language":[{"iso":"eng"}],"month":"08","date_updated":"2026-04-15T10:02:12Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"KrCh"},{"_id":"CaGu"}],"file_date_updated":"2018-12-12T10:11:39Z","oa":1},{"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” <i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>, IEEE, 2016, pp. 197–206, doi:<a href=\"https://doi.org/10.1145/2933575.2935304\">10.1145/2933575.2935304</a>.","apa":"Chatterjee, K., Dvoák, W., Henzinger, M., &#38; Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In <i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 197–206). New York, NY, USA: IEEE. <a href=\"https://doi.org/10.1145/2933575.2935304\">https://doi.org/10.1145/2933575.2935304</a>","chicago":"Chatterjee, Krishnendu, Wolfgang Dvoák, Monika Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” In <i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 197–206. IEEE, 2016. <a href=\"https://doi.org/10.1145/2933575.2935304\">https://doi.org/10.1145/2933575.2935304</a>.","ama":"Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In: <i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2016:197-206. doi:<a href=\"https://doi.org/10.1145/2933575.2935304\">10.1145/2933575.2935304</a>","ista":"Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, , 197–206.","ieee":"K. Chatterjee, W. Dvoák, M. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds: disjunction is harder than conjunction,” in <i>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science</i>, New York, NY, USA, 2016, pp. 197–206.","short":"K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206."},"day":"05","status":"public","alternative_title":["Proceedings Symposium on Logic in Computer Science"],"oa":1,"isi":1,"date_updated":"2025-09-22T14:12:05Z","arxiv":1,"publisher":"IEEE","department":[{"_id":"KrCh"}],"date_published":"2016-07-05T00:00:00Z","month":"07","language":[{"iso":"eng"}],"type":"conference","acknowledgement":"K.  C.,  M.  H.,  and  W.  D.  are  partially  supported  by  the  Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003.\r\nK. C. is partially supported by the Austrian Science Fund (FWF)\r\nNFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant\r\n(279307: Graph Games). For W. D., M. H., and V. L. the research\r\nleading to these results has received funding from the European\r\nResearch Council under the European Union’s Seventh Framework\r\nProgramme (FP/2007-2013) / ERC Grant Agreement no. 340506.","oa_version":"Preprint","scopus_import":"1","_id":"1140","publist_id":"6219","quality_controlled":"1","conference":{"start_date":"2016-07-05","name":"LICS: Logic in Computer Science","location":"New York, NY, USA","end_date":"2016-07-08"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02670"}],"date_created":"2018-12-11T11:50:22Z","year":"2016","publication":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","doi":"10.1145/2933575.2935304","publication_status":"published","external_id":{"arxiv":["1602.02670"],"isi":["000387609200020"]},"abstract":[{"text":"Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental -regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lower bounds based on widely believed assumptions about the complexity of CNF-SAT and combinatorial Boolean matrix multiplication. A separation result for two models with respect to an objective means a conditional lower bound for one model that is strictly higher than the existing upper bound for the other model, and similarly for two objectives with respect to a model. Our results establish the following separation results: (1) A separation of models (graphs and MDPs) for disjunctive queries of reachability and Büchi objectives. (2) Two kinds of separations of objectives, both for graphs and MDPs, namely, (2a) the separation of dual objectives such as Streett/Rabin objectives, and (2b) the separation of conjunction and disjunction of multiple objectives of the same type such as safety, Büchi, and coBüchi. In summary, our results establish the first model and objective separation results for graphs and MDPs for various classical -regular objectives. Quite strikingly, we establish conditional lower bounds for the disjunction of objectives that are strictly higher than the existing upper bounds for the conjunction of the same objectives. © 2016 ACM.","lang":"eng"}],"article_processing_charge":"No","page":"197 - 206","title":"Model and objective separation with conditional lower bounds: disjunction is harder than conjunction","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Wolfgang","last_name":"Dvoák","full_name":"Dvoák, Wolfgang"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik"},{"id":"378E0060-F248-11E8-B48F-1D18A9856A87","full_name":"Davies, Jessica","last_name":"Davies","first_name":"Jessica"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","volume":2016,"related_material":{"record":[{"status":"public","id":"5443","relation":"earlier_version"}],"link":[{"relation":"table_of_contents","url":"https://dl.acm.org/citation.cfm?id=3016355"}]},"page":"3225 - 3232","article_processing_charge":"No","abstract":[{"text":"POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIMEcomplete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach. © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.","lang":"eng"}],"publication_status":"published","external_id":{"arxiv":["1511.08456"]},"title":"A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs","year":"2016","date_created":"2018-12-11T11:50:30Z","doi":"10.1609/aaai.v30i1.10422","publication":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","corr_author":"1","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1511.08456","open_access":"1"}],"conference":{"end_date":"2016-02-17","location":"Phoenix, AZ, United States","start_date":"2016-02-12","name":"AAAI: Conference on Artificial Intelligence"},"intvolume":"      2016","oa_version":"Preprint","type":"conference","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","publist_id":"6191","_id":"1166","oa":1,"month":"12","language":[{"iso":"eng"}],"date_published":"2016-12-02T00:00:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"arxiv":1,"publisher":"AAAI Press","date_updated":"2025-06-25T11:52:14Z","OA_type":"green","ec_funded":1,"status":"public","day":"02","citation":{"chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in POMDPs.” In <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, 2016:3225–32. AAAI Press, 2016. <a href=\"https://doi.org/10.1609/aaai.v30i1.10422\">https://doi.org/10.1609/aaai.v30i1.10422</a>.","apa":"Chatterjee, K., Chmelik, M., &#38; Davies, J. (2016). A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. In <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i> (Vol. 2016, pp. 3225–3232). Phoenix, AZ, United States: AAAI Press. <a href=\"https://doi.org/10.1609/aaai.v30i1.10422\">https://doi.org/10.1609/aaai.v30i1.10422</a>","mla":"Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in POMDPs.” <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, vol. 2016, AAAI Press, 2016, pp. 3225–32, doi:<a href=\"https://doi.org/10.1609/aaai.v30i1.10422\">10.1609/aaai.v30i1.10422</a>.","short":"K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232.","ieee":"K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs,” in <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>, Phoenix, AZ, United States, 2016, vol. 2016, pp. 3225–3232.","ista":"Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016, 3225–3232.","ama":"Chatterjee K, Chmelik M, Davies J. A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs. In: <i>Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence</i>. Vol 2016. AAAI Press; 2016:3225-3232. doi:<a href=\"https://doi.org/10.1609/aaai.v30i1.10422\">10.1609/aaai.v30i1.10422</a>"},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}]},{"oa_version":"Preprint","type":"conference","publist_id":"6171","scopus_import":"1","_id":"1182","oa":1,"date_published":"2016-01-01T00:00:00Z","language":[{"iso":"eng"}],"month":"01","date_updated":"2025-04-22T13:42:22Z","arxiv":1,"publisher":"AAAI Press","department":[{"_id":"KrCh"}],"ec_funded":1,"status":"public","day":"01","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Tkadlec, J. (2016). Robust draws in balanced knockout tournaments (Vol. 2016–January, pp. 172–179). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA: AAAI Press.","mla":"Chatterjee, Krishnendu, et al. <i>Robust Draws in Balanced Knockout Tournaments</i>. Vol. 2016–January, AAAI Press, 2016, pp. 172–79.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.","short":"K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.","ista":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. 2016. Robust draws in balanced knockout tournaments. IJCAI: International Joint Conference on Artificial Intelligence vol. 2016–January, 172–179.","ama":"Chatterjee K, Ibsen-Jensen R, Tkadlec J. Robust draws in balanced knockout tournaments. In: Vol 2016-January. AAAI Press; 2016:172-179."},"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"}],"volume":"2016-January","related_material":{"link":[{"url":"https://www.ijcai.org/proceedings/2016","relation":"table_of_contents"}]},"article_processing_charge":"No","page":"172 - 179","external_id":{"arxiv":["1604.05090"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decisionmaking and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning probability for a distinguished player, has received a lot of attention. Previous works consider the problem where the pairwise winning probabilities are known precisely, while we study how robust is the winning probability with respect to small errors in the pairwise winning probabilities. First, we present several illuminating examples to establish: (a) there exist deterministic tournaments (where the pairwise winning probabilities are 0 or 1) where one optimal draw is much more robust than the other; and (b) in general, there exist tournaments with slightly suboptimal draws that are more robust than all the optimal draws. The above examples motivate the study of the computational problem of robust draws that guarantee a specified winning probability. Second, we present a polynomial-time algorithm for approximating the robustness of a draw for sufficiently small errors in pairwise winning probabilities, and obtain that the stated computational problem is NP-complete. We also show that two natural cases of deterministic tournaments where the optimal draw could be computed in polynomial time also admit polynomial-time algorithms to compute robust optimal draws."}],"title":"Robust draws in balanced knockout tournaments","date_created":"2018-12-11T11:50:35Z","year":"2016","corr_author":"1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.05090"}],"conference":{"location":"New York, NY, USA","end_date":"2016-07-15","start_date":"2016-07-09","name":"IJCAI: International Joint Conference on Artificial Intelligence"}},{"quality_controlled":"1","file":[{"file_id":"4855","access_level":"open_access","checksum":"95e6dc78278334b99dacbf8822509364","relation":"main_file","date_updated":"2020-07-14T12:44:39Z","file_size":171352,"date_created":"2018-12-12T10:11:02Z","content_type":"application/pdf","file_name":"IST-2017-798-v1+1_comment_adami.pdf","creator":"system"}],"ddc":["530"],"has_accepted_license":"1","year":"2016","date_created":"2018-12-11T11:50:40Z","publication":"Physics of Life Reviews","doi":"10.1016/j.plrev.2016.10.004","publication_status":"published","external_id":{"isi":["000390640200003"]},"page":"29 - 31","article_processing_charge":"No","title":"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","volume":19,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","last_name":"Hilbe"},{"full_name":"Traulsen, Arne","last_name":"Traulsen","first_name":"Arne"}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"citation":{"chicago":"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.” <i>Physics of Life Reviews</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">https://doi.org/10.1016/j.plrev.2016.10.004</a>.","apa":"Hilbe, C., &#38; Traulsen, A. (2016). 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. <i>Physics of Life Reviews</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">https://doi.org/10.1016/j.plrev.2016.10.004</a>","mla":"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.” <i>Physics of Life Reviews</i>, vol. 19, Elsevier, 2016, pp. 29–31, doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">10.1016/j.plrev.2016.10.004</a>.","short":"C. Hilbe, A. Traulsen, Physics of Life Reviews 19 (2016) 29–31.","ieee":"C. Hilbe and A. 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,” <i>Physics of Life Reviews</i>, vol. 19. Elsevier, pp. 29–31, 2016.","ista":"Hilbe C, Traulsen A. 2016. 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. Physics of Life Reviews. 19, 29–31.","ama":"Hilbe C, Traulsen A. 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. <i>Physics of Life Reviews</i>. 2016;19:29-31. doi:<a href=\"https://doi.org/10.1016/j.plrev.2016.10.004\">10.1016/j.plrev.2016.10.004</a>"},"ec_funded":1,"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"pubrep_id":"798","day":"01","status":"public","oa":1,"file_date_updated":"2020-07-14T12:44:39Z","isi":1,"department":[{"_id":"KrCh"}],"publisher":"Elsevier","date_updated":"2025-09-22T09:42:11Z","month":"12","language":[{"iso":"eng"}],"date_published":"2016-12-01T00:00:00Z","acknowledgement":"C.H. acknowledges generous support from the ISTFELLOW program.","type":"journal_article","intvolume":"        19","oa_version":"Submitted Version","_id":"1200","scopus_import":"1","publist_id":"6150"},{"volume":26,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Vineet","last_name":"Pandey","full_name":"Pandey, Vineet"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"}],"title":"Game-theoretic models identify useful principles for peer collaboration in online learning platforms","abstract":[{"text":"To facilitate collaboration in massive online classrooms, instructors must make many decisions. For instance, the following parameters need to be decided when designing a peer-feedback system where students review each others' essays: the number of students each student must provide feedback to, an algorithm to map feedback providers to receivers, constraints that ensure students do not become free-riders (receiving feedback but not providing it), the best times to receive feedback to improve learning etc. While instructors can answer these questions by running experiments or invoking past experience, game-theoretic models with data from online learning platforms can identify better initial designs for further improvements. As an example, we explore the design space of a peer feedback system by modeling it using game theory. Our simulations show that incentivizing students to provide feedback requires the value obtained from receiving a feedback to exceed the cost of providing it by a large factor (greater than 7). Furthermore, hiding feedback from low-effort students incentivizes them to provide more feedback.","lang":"eng"}],"external_id":{"isi":["000468137600088"]},"publication_status":"published","page":"365 - 368","article_processing_charge":"No","publication":"Proceedings of the ACM Conference on Computer Supported Cooperative Work","issue":"Februar-2016","doi":"10.1145/2818052.2869122","year":"2016","date_created":"2018-12-11T11:50:55Z","conference":{"end_date":"2016-03-02","location":"San Francisco, CA, USA","start_date":"2016-02-26","name":"CSCW: Computer Supported Cooperative Work and Social Computing"},"quality_controlled":"1","_id":"1245","scopus_import":"1","publist_id":"6083","type":"conference","acknowledgement":"ERC Start Grant Graph Games 279307 supported this  research. ","intvolume":"        26","oa_version":"None","publisher":"ACM","department":[{"_id":"KrCh"}],"date_updated":"2025-09-22T09:14:46Z","language":[{"iso":"eng"}],"month":"02","date_published":"2016-02-27T00:00:00Z","isi":1,"day":"27","status":"public","ec_funded":1,"project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"citation":{"ieee":"V. Pandey and K. Chatterjee, “Game-theoretic models identify useful principles for peer collaboration in online learning platforms,” in <i>Proceedings of the ACM Conference on Computer Supported Cooperative Work</i>, San Francisco, CA, USA, 2016, vol. 26, no. Februar-2016, pp. 365–368.","short":"V. Pandey, K. Chatterjee, in:, Proceedings of the ACM Conference on Computer Supported Cooperative Work, ACM, 2016, pp. 365–368.","ista":"Pandey V, Chatterjee K. 2016. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. Proceedings of the ACM Conference on Computer Supported Cooperative Work. CSCW: Computer Supported Cooperative Work and Social Computing vol. 26, 365–368.","ama":"Pandey V, Chatterjee K. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In: <i>Proceedings of the ACM Conference on Computer Supported Cooperative Work</i>. Vol 26. ACM; 2016:365-368. doi:<a href=\"https://doi.org/10.1145/2818052.2869122\">10.1145/2818052.2869122</a>","apa":"Pandey, V., &#38; Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In <i>Proceedings of the ACM Conference on Computer Supported Cooperative Work</i> (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM. <a href=\"https://doi.org/10.1145/2818052.2869122\">https://doi.org/10.1145/2818052.2869122</a>","chicago":"Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.” In <i>Proceedings of the ACM Conference on Computer Supported Cooperative Work</i>, 26:365–68. ACM, 2016. <a href=\"https://doi.org/10.1145/2818052.2869122\">https://doi.org/10.1145/2818052.2869122</a>.","mla":"Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.” <i>Proceedings of the ACM Conference on Computer Supported Cooperative Work</i>, vol. 26, no. Februar-2016, ACM, 2016, pp. 365–68, doi:<a href=\"https://doi.org/10.1145/2818052.2869122\">10.1145/2818052.2869122</a>."}},{"corr_author":"1","file":[{"date_created":"2018-12-12T10:08:08Z","content_type":"application/pdf","file_name":"IST-2016-716-v1+1_journal.pone.0163867.PDF","creator":"system","file_id":"4668","relation":"main_file","checksum":"6b33e394003dfe8b4ca6be1858aaa8e3","access_level":"open_access","file_size":2077905,"date_updated":"2020-07-14T12:44:44Z"}],"quality_controlled":"1","has_accepted_license":"1","ddc":["004","006"],"date_created":"2018-12-11T11:51:22Z","year":"2016","article_number":"e0163867","doi":"10.1371/journal.pone.0163867","issue":"10","publication":"PLoS One","article_processing_charge":"No","external_id":{"isi":["000385696900024"]},"publication_status":"published","abstract":[{"text":"Direct reciprocity is a major mechanism for the evolution of cooperation. Several classical studies have suggested that humans should quickly learn to adopt reciprocal strategies to establish mutual cooperation in repeated interactions. On the other hand, the recently discovered theory of ZD strategies has found that subjects who use extortionate strategies are able to exploit and subdue cooperators. Although such extortioners have been predicted to succeed in any population of adaptive opponents, theoretical follow-up studies questioned whether extortion can evolve in reality. However, most of these studies presumed that individuals have similar strategic possibilities and comparable outside options, whereas asymmetries are ubiquitous in real world applications. Here we show with a model and an economic experiment that extortionate strategies readily emerge once subjects differ in their strategic power. Our experiment combines a repeated social dilemma with asymmetric partner choice. In our main treatment there is one randomly chosen group member who is unilaterally allowed to exchange one of the other group members after every ten rounds of the social dilemma. We find that this asymmetric replacement opportunity generally promotes cooperation, but often the resulting payoff distribution reflects the underlying power structure. Almost half of the subjects in a better strategic position turn into extortioners, who quickly proceed to exploit their peers. By adapting their cooperation probabilities consistent with ZD theory, extortioners force their co-players to cooperate without being similarly cooperative themselves. Comparison to non-extortionate players under the same conditions indicates a substantial net gain to extortion. Our results thus highlight how power asymmetries can endanger mutually beneficial interactions, and transform them into exploitative relationships. In particular, our results indicate that the extortionate strategies predicted from ZD theory could play a more prominent role in our daily interactions than previously thought.","lang":"eng"}],"title":"Asymmetric power boosts extortion in an economic experiment","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","first_name":"Christian","last_name":"Hilbe"},{"last_name":"Hagel","first_name":"Kristin","full_name":"Hagel, Kristin"},{"full_name":"Milinski, Manfred","first_name":"Manfred","last_name":"Milinski"}],"volume":11,"related_material":{"record":[{"status":"public","relation":"research_data","id":"9867"},{"status":"public","relation":"research_data","id":"9868"}]},"citation":{"ama":"Hilbe C, Hagel K, Milinski M. Asymmetric power boosts extortion in an economic experiment. <i>PLoS One</i>. 2016;11(10). doi:<a href=\"https://doi.org/10.1371/journal.pone.0163867\">10.1371/journal.pone.0163867</a>","ista":"Hilbe C, Hagel K, Milinski M. 2016. Asymmetric power boosts extortion in an economic experiment. PLoS One. 11(10), e0163867.","ieee":"C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” <i>PLoS One</i>, vol. 11, no. 10. Public Library of Science, 2016.","short":"C. Hilbe, K. Hagel, M. Milinski, PLoS One 11 (2016).","mla":"Hilbe, Christian, et al. “Asymmetric Power Boosts Extortion in an Economic Experiment.” <i>PLoS One</i>, vol. 11, no. 10, e0163867, Public Library of Science, 2016, doi:<a href=\"https://doi.org/10.1371/journal.pone.0163867\">10.1371/journal.pone.0163867</a>.","chicago":"Hilbe, Christian, Kristin Hagel, and Manfred Milinski. “Asymmetric Power Boosts Extortion in an Economic Experiment.” <i>PLoS One</i>. Public Library of Science, 2016. <a href=\"https://doi.org/10.1371/journal.pone.0163867\">https://doi.org/10.1371/journal.pone.0163867</a>.","apa":"Hilbe, C., Hagel, K., &#38; Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0163867\">https://doi.org/10.1371/journal.pone.0163867</a>"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"pubrep_id":"716","day":"04","status":"public","isi":1,"file_date_updated":"2020-07-14T12:44:44Z","oa":1,"date_published":"2016-10-04T00:00:00Z","language":[{"iso":"eng"}],"month":"10","date_updated":"2025-09-22T08:27:01Z","department":[{"_id":"KrCh"}],"publisher":"Public Library of Science","oa_version":"Published Version","intvolume":"        11","acknowledgement":"CH was funded by the Schrödinger program of the Austrian Science Fund (FWF) J3475. ","type":"journal_article","publist_id":"5948","scopus_import":"1","_id":"1322"},{"_id":"1324","scopus_import":"1","publist_id":"5946","type":"conference","oa_version":"None","intvolume":"      2016","department":[{"_id":"KrCh"}],"publisher":"AAAI Press","date_updated":"2025-05-19T11:03:49Z","language":[{"iso":"eng"}],"month":"01","date_published":"2016-01-01T00:00:00Z","oa":1,"day":"01","status":"public","ec_funded":1,"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"citation":{"ama":"Chatterjee K, Chmelik M. Indefinite-horizon reachability in Goal-DEC-POMDPs. In: <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>. Vol 2016. AAAI Press; 2016:88-96. doi:<a href=\"https://doi.org/10.1609/icaps.v26i1.13737\">10.1609/icaps.v26i1.13737</a>","ista":"Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016, 88–96.","short":"K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.","ieee":"K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>, London, United Kingdom, 2016, vol. 2016, pp. 88–96.","mla":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>, vol. 2016, AAAI Press, 2016, pp. 88–96, doi:<a href=\"https://doi.org/10.1609/icaps.v26i1.13737\">10.1609/icaps.v26i1.13737</a>.","chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i>, 2016:88–96. AAAI Press, 2016. <a href=\"https://doi.org/10.1609/icaps.v26i1.13737\">https://doi.org/10.1609/icaps.v26i1.13737</a>.","apa":"Chatterjee, K., &#38; Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In <i>Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling</i> (Vol. 2016, pp. 88–96). London, United Kingdom: AAAI Press. <a href=\"https://doi.org/10.1609/icaps.v26i1.13737\">https://doi.org/10.1609/icaps.v26i1.13737</a>"},"volume":2016,"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Indefinite-horizon reachability in Goal-DEC-POMDPs","abstract":[{"text":"DEC-POMDPs extend POMDPs to a multi-agent setting, where several agents operate in an uncertain environment independently to achieve a joint objective. DEC-POMDPs have been studied with finite-horizon and infinite-horizon discounted-sum objectives, and there exist solvers both for exact and approximate solutions. In this work we consider Goal-DEC-POMDPs, where given a set of target states, the objective is to ensure that the target set is reached with minimal cost. We consider the indefinite-horizon (infinite-horizon with either discounted-sum, or undiscounted-sum, where absorbing goal states have zero-cost) problem. We present a new and novel method to solve the problem that extends methods for finite-horizon DEC-POMDPs and the RTDP-Bel approach for POMDPs. We present experimental results on several examples, and show that our approach presents promising results. Copyright ","lang":"eng"}],"publication_status":"published","page":"88 - 96","article_processing_charge":"No","publication":"Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling","doi":"10.1609/icaps.v26i1.13737","year":"2016","date_created":"2018-12-11T11:51:22Z","conference":{"location":"London, United Kingdom","end_date":"2016-06-17","name":"ICAPS: International Conference on Automated Planning and Scheduling","start_date":"2016-06-12"},"main_file_link":[{"url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/12999","open_access":"1"}],"quality_controlled":"1","corr_author":"1"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"day":"01","status":"public","pubrep_id":"665","alternative_title":["LIPIcs"],"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"citation":{"chicago":"Brázdil, Tomáš, Vojtěch Forejt, Antonín Kučera, and Petr Novotný. “Stability in Graphs and Games,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.10</a>.","apa":"Brázdil, T., Forejt, V., Kučera, A., &#38; Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.10</a>","mla":"Brázdil, Tomáš, et al. <i>Stability in Graphs and Games</i>. Vol. 59, 10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">10.4230/LIPIcs.CONCUR.2016.10</a>.","ieee":"T. Brázdil, V. Forejt, A. Kučera, and P. Novotný, “Stability in graphs and games,” presented at the CONCUR: Concurrency Theory, Quebec City, Canada, 2016, vol. 59.","short":"T. Brázdil, V. Forejt, A. Kučera, P. Novotný, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ista":"Brázdil T, Forejt V, Kučera A, Novotný P. 2016. Stability in graphs and games. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 10.","ama":"Brázdil T, Forejt V, Kučera A, Novotný P. Stability in graphs and games. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.10\">10.4230/LIPIcs.CONCUR.2016.10</a>"},"acknowledgement":"The work has been supported by the Czech Science Foundation, grant No. 15-17564S, by EPSRC grant\r\nEP/M023656/1, and by the People Programme (Marie Curie Actions) of the European Union’s Seventh\r\nFramework Programme (FP7/2007-2013) under REA grant agreement no [291734]","type":"conference","oa_version":"Published Version","intvolume":"        59","scopus_import":1,"_id":"1325","publist_id":"5944","file_date_updated":"2020-07-14T12:44:44Z","oa":1,"date_updated":"2024-10-09T20:57:03Z","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2016-08-01T00:00:00Z","month":"08","language":[{"iso":"eng"}],"article_number":"10","date_created":"2018-12-11T11:51:23Z","year":"2016","doi":"10.4230/LIPIcs.CONCUR.2016.10","file":[{"date_created":"2018-12-12T10:16:40Z","content_type":"application/pdf","file_name":"IST-2016-665-v1+1_Forejt_et_al__Stability_in_graphs_and_games.pdf","creator":"system","file_id":"5229","checksum":"3c2dc6ab0358f8aa8f7aa7d6c1293159","relation":"main_file","access_level":"open_access","file_size":553648,"date_updated":"2020-07-14T12:44:44Z"}],"quality_controlled":"1","corr_author":"1","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2016-08-23","end_date":"2016-08-26","location":"Quebec City, Canada"},"ddc":["004"],"has_accepted_license":"1","volume":59,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"first_name":"Vojtěch","last_name":"Forejt","full_name":"Forejt, Vojtěch"},{"last_name":"Kučera","first_name":"Antonín","full_name":"Kučera, Antonín"},{"first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of mean-payoff does not reflect possible fluctuations from the mean-payoff along a run, we propose definitions and algorithms for capturing the stability of the system, and give algorithms for deciding if a given mean payoff and stability objective can be ensured in the system."}],"title":"Stability in graphs and games"},{"day":"22","status":"public","alternative_title":["LNCS"],"ec_funded":1,"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"citation":{"chicago":"Brázdil, Tomáš, Antonín Kučera, and Petr Novotný. “Optimizing the Expected Mean Payoff in Energy Markov Decision Processes,” 9938:32–49. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">https://doi.org/10.1007/978-3-319-46520-3_3</a>.","apa":"Brázdil, T., Kučera, A., &#38; Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer. <a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">https://doi.org/10.1007/978-3-319-46520-3_3</a>","mla":"Brázdil, Tomáš, et al. <i>Optimizing the Expected Mean Payoff in Energy Markov Decision Processes</i>. Vol. 9938, Springer, 2016, pp. 32–49, doi:<a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">10.1007/978-3-319-46520-3_3</a>.","ieee":"T. Brázdil, A. Kučera, and P. Novotný, “Optimizing the expected mean payoff in Energy Markov Decision Processes,” presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan, 2016, vol. 9938, pp. 32–49.","short":"T. Brázdil, A. Kučera, P. Novotný, in:, Springer, 2016, pp. 32–49.","ama":"Brázdil T, Kučera A, Novotný P. Optimizing the expected mean payoff in Energy Markov Decision Processes. In: Vol 9938. Springer; 2016:32-49. doi:<a href=\"https://doi.org/10.1007/978-3-319-46520-3_3\">10.1007/978-3-319-46520-3_3</a>","ista":"Brázdil T, Kučera A, Novotný P. 2016. Optimizing the expected mean payoff in Energy Markov Decision Processes. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 9938, 32–49."},"scopus_import":"1","_id":"1326","publist_id":"5943","type":"conference","acknowledgement":"The research was funded by the Czech Science Foundation Grant No. P202/12/G061 and by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no [291734].","intvolume":"      9938","oa_version":"Preprint","date_updated":"2025-09-22T08:25:26Z","arxiv":1,"department":[{"_id":"KrCh"}],"publisher":"Springer","date_published":"2016-09-22T00:00:00Z","month":"09","language":[{"iso":"eng"}],"oa":1,"isi":1,"doi":"10.1007/978-3-319-46520-3_3","date_created":"2018-12-11T11:51:23Z","year":"2016","conference":{"start_date":"2016-10-17","name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2016-10-20","location":"Chiba, Japan"},"main_file_link":[{"url":"https://arxiv.org/abs/1607.00678","open_access":"1"}],"quality_controlled":"1","corr_author":"1","volume":9938,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Tomáš","last_name":"Brázdil","full_name":"Brázdil, Tomáš"},{"last_name":"Kučera","first_name":"Antonín","full_name":"Kučera, Antonín"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr"}],"title":"Optimizing the expected mean payoff in Energy Markov Decision Processes","external_id":{"arxiv":["1607.00678"],"isi":["000389808100003"]},"publication_status":"published","abstract":[{"lang":"eng","text":"Energy Markov Decision Processes (EMDPs) are finite-state Markov decision processes where each transition is assigned an integer counter update and a rational payoff. An EMDP configuration is a pair s(n), where s is a control state and n is the current counter value. The configurations are changed by performing transitions in the standard way. We consider the problem of computing a safe strategy (i.e., a strategy that keeps the counter non-negative) which maximizes the expected mean payoff. "}],"article_processing_charge":"No","page":"32 - 49"},{"publist_id":"5942","scopus_import":"1","_id":"1327","oa_version":"Preprint","type":"conference","date_published":"2016-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"date_updated":"2025-06-04T10:26:23Z","publisher":"ACM","department":[{"_id":"KrCh"}],"arxiv":1,"oa":1,"status":"public","day":"01","ec_funded":1,"citation":{"mla":"Brázdil, Tomáš, et al. “Stochastic Shortest Path with Energy Constraints in POMDPs.” <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, ACM, 2016, pp. 1465–66.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, 1465–66. ACM, 2016.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., &#38; Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i> (pp. 1465–1466). Singapore: ACM.","ama":"Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. Stochastic shortest path with energy constraints in POMDPs. In: <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>. ACM; 2016:1465-1466.","ista":"Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotný P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents &#38; Multiagent Systems, 1465–1466.","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotný, “Stochastic shortest path with energy constraints in POMDPs,” in <i>Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems</i>, Singapore, 2016, pp. 1465–1466.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotný, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466."},"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"full_name":"Gupta, Anchit","first_name":"Anchit","last_name":"Gupta"},{"last_name":"Novotny","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Stochastic shortest path with energy constraints in POMDPs","article_processing_charge":"No","page":"1465 - 1466","publication_status":"published","external_id":{"arxiv":["1602.07565"]},"abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard constraint. The energy levels may increase and decrease with transitions, and the hard constraint requires that the energy level must remain positive in all steps till the target is reached. First, we present a novel algorithm for solving POMDPs with energy levels, developing on existing POMDP solvers and using RTDP as its main method. Our second contribution is related to policy representation. For larger POMDP instances the policies computed by existing solvers are too large to be understandable. We present an automated procedure based on machine learning techniques that automatically extracts important decisions of the policy allowing us to compute succinct human readable policies. Finally, we show experimentally that our algorithm performs well and computes succinct policies on a number of POMDP instances from the literature that were naturally enhanced with energy levels. ","lang":"eng"}],"publication":"Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems","date_created":"2018-12-11T11:51:23Z","year":"2016","main_file_link":[{"url":"https://arxiv.org/abs/1602.07565","open_access":"1"}],"conference":{"start_date":"2016-05-09","name":"AAMAS: Autonomous Agents & Multiagent Systems","location":"Singapore","end_date":"2016-05-13"},"quality_controlled":"1"},{"date_updated":"2025-09-22T08:21:34Z","publisher":"Nature Publishing Group","department":[{"_id":"KrCh"}],"date_published":"2016-03-07T00:00:00Z","month":"03","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:44:44Z","oa":1,"isi":1,"scopus_import":"1","_id":"1333","publist_id":"5935","acknowledgement":"We thank the students for participation; H.-J. Krambeck for writing the software for the game; H. Arndt, T. Bakker, L. Becks, H. Brendelberger, S. Dobler and T. Reusch for support; and the Max Planck Society for the Advancement of Science for funding.","type":"journal_article","intvolume":"         7","oa_version":"Published Version","citation":{"ieee":"M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, and J. Marotzke, “Humans choose representatives who enforce cooperation in social dilemmas through extortion,” <i>Nature Communications</i>, vol. 7. Nature Publishing Group, 2016.","short":"M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, J. Marotzke, Nature Communications 7 (2016).","ama":"Milinski M, Hilbe C, Semmann D, Sommerfeld R, Marotzke J. Humans choose representatives who enforce cooperation in social dilemmas through extortion. <i>Nature Communications</i>. 2016;7. doi:<a href=\"https://doi.org/10.1038/ncomms10915\">10.1038/ncomms10915</a>","ista":"Milinski M, Hilbe C, Semmann D, Sommerfeld R, Marotzke J. 2016. Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. 7, 10915.","apa":"Milinski, M., Hilbe, C., Semmann, D., Sommerfeld, R., &#38; Marotzke, J. (2016). Humans choose representatives who enforce cooperation in social dilemmas through extortion. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms10915\">https://doi.org/10.1038/ncomms10915</a>","chicago":"Milinski, Manfred, Christian Hilbe, Dirk Semmann, Ralf Sommerfeld, and Jochem Marotzke. “Humans Choose Representatives Who Enforce Cooperation in Social Dilemmas through Extortion.” <i>Nature Communications</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/ncomms10915\">https://doi.org/10.1038/ncomms10915</a>.","mla":"Milinski, Manfred, et al. “Humans Choose Representatives Who Enforce Cooperation in Social Dilemmas through Extortion.” <i>Nature Communications</i>, vol. 7, 10915, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/ncomms10915\">10.1038/ncomms10915</a>."},"status":"public","day":"07","pubrep_id":"661","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"Humans choose representatives who enforce cooperation in social dilemmas through extortion","publication_status":"published","external_id":{"isi":["000371720200001"]},"abstract":[{"text":"Social dilemmas force players to balance between personal and collective gain. In many dilemmas, such as elected governments negotiating climate-change mitigation measures, the decisions are made not by individual players but by their representatives. However, the behaviour of representatives in social dilemmas has not been investigated experimentally. Here inspired by the negotiations for greenhouse-gas emissions reductions, we experimentally study a collective-risk social dilemma that involves representatives deciding on behalf of their fellow group members. Representatives can be re-elected or voted out after each consecutive collective-risk game. Selfish players are preferentially elected and are hence found most frequently in the &quot;representatives&quot; treatment. Across all treatments, we identify the selfish players as extortioners. As predicted by our mathematical model, their steadfast strategies enforce cooperation from fair players who finally compensate almost completely the deficit caused by the extortionate co-players. Everybody gains, but the extortionate representatives and their groups gain the most.","lang":"eng"}],"article_processing_charge":"No","volume":7,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"last_name":"Milinski","first_name":"Manfred","full_name":"Milinski, Manfred"},{"first_name":"Christian","last_name":"Hilbe","full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X"},{"first_name":"Dirk","last_name":"Semmann","full_name":"Semmann, Dirk"},{"first_name":"Ralf","last_name":"Sommerfeld","full_name":"Sommerfeld, Ralf"},{"full_name":"Marotzke, Jochem","first_name":"Jochem","last_name":"Marotzke"}],"ddc":["519","530","599"],"has_accepted_license":"1","file":[{"access_level":"open_access","relation":"main_file","checksum":"9ea0d7ce59a555a1cb8353d5559407cb","file_size":1432577,"date_updated":"2020-07-14T12:44:44Z","file_id":"4834","creator":"system","date_created":"2018-12-12T10:10:44Z","content_type":"application/pdf","file_name":"IST-2016-661-v1+1_ncomms10915.pdf"}],"quality_controlled":"1","corr_author":"1","publication":"Nature Communications","doi":"10.1038/ncomms10915","article_number":"10915","date_created":"2018-12-11T11:51:25Z","year":"2016"},{"date_published":"2016-08-31T00:00:00Z","month":"08","language":[{"iso":"eng"}],"date_updated":"2025-09-22T08:19:49Z","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"arxiv":1,"isi":1,"oa":1,"publist_id":"5932","scopus_import":"1","_id":"1335","oa_version":"Preprint","intvolume":"      9837","type":"conference","citation":{"short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative monitor automata,” presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom, 2016, vol. 9837, pp. 23–38.","ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative monitor automata. SAS: Static Analysis Symposium, LNCS, vol. 9837, 23–38.","ama":"Chatterjee K, Henzinger TA, Otop J. Quantitative monitor automata. In: Vol 9837. Springer; 2016:23-38. doi:<a href=\"https://doi.org/10.1007/978-3-662-53413-7_2\">10.1007/978-3-662-53413-7_2</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Monitor Automata,” 9837:23–38. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53413-7_2\">https://doi.org/10.1007/978-3-662-53413-7_2</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2016). Quantitative monitor automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-53413-7_2\">https://doi.org/10.1007/978-3-662-53413-7_2</a>","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Monitor Automata</i>. Vol. 9837, Springer, 2016, pp. 23–38, doi:<a href=\"https://doi.org/10.1007/978-3-662-53413-7_2\">10.1007/978-3-662-53413-7_2</a>."},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"alternative_title":["LNCS"],"day":"31","status":"public","ec_funded":1,"title":"Quantitative monitor automata","article_processing_charge":"No","page":"23 - 38","publication_status":"published","external_id":{"arxiv":["1604.06764"],"isi":["000388924600002"]},"abstract":[{"text":"In this paper we review various automata-theoretic formalisms for expressing quantitative properties. We start with finite-state Boolean automata that express the traditional regular properties. We then consider weighted ω-automata that can measure the average density of events, which finite-state Boolean automata cannot. However, even weighted ω-automata cannot express basic performance properties like average response time. We finally consider two formalisms of weighted ω-automata with monitors, where the monitors are either (a) counters or (b) weighted automata themselves. We present a translation result to establish that these two formalisms are equivalent. Weighted ω-automata with monitors generalize weighted ω-automata, and can express average response time property. They present a natural, robust, and expressive framework for quantitative specifications, with important decidable properties.","lang":"eng"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","volume":9837,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.06764"}],"conference":{"end_date":"2016-09-10","location":"Edinburgh, United Kingdom","name":"SAS: Static Analysis Symposium","start_date":"2016-09-08"},"corr_author":"1","quality_controlled":"1","doi":"10.1007/978-3-662-53413-7_2","date_created":"2018-12-11T11:51:26Z","year":"2016"},{"language":[{"iso":"eng"}],"month":"09","date_published":"2016-09-01T00:00:00Z","department":[{"_id":"KrCh"}],"arxiv":1,"publisher":"Springer","date_updated":"2025-09-22T08:18:27Z","isi":1,"oa":1,"publist_id":"5927","_id":"1340","scopus_import":"1","intvolume":"      9928","oa_version":"Preprint","type":"conference","citation":{"mla":"Hansen, Kristoffer, et al. <i>The Big Match in Small Space</i>. Vol. 9928, Springer, 2016, pp. 64–76, doi:<a href=\"https://doi.org/10.1007/978-3-662-53354-3_6\">10.1007/978-3-662-53354-3_6</a>.","apa":"Hansen, K., Ibsen-Jensen, R., &#38; Koucký, M. (2016). The big match in small space (Vol. 9928, pp. 64–76). Presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-662-53354-3_6\">https://doi.org/10.1007/978-3-662-53354-3_6</a>","chicago":"Hansen, Kristoffer, Rasmus Ibsen-Jensen, and Michal Koucký. “The Big Match in Small Space,” 9928:64–76. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53354-3_6\">https://doi.org/10.1007/978-3-662-53354-3_6</a>.","ista":"Hansen K, Ibsen-Jensen R, Koucký M. 2016. The big match in small space. SAGT: Symposium on Algorithmic Game Theory, LNCS, vol. 9928, 64–76.","ama":"Hansen K, Ibsen-Jensen R, Koucký M. The big match in small space. In: Vol 9928. Springer; 2016:64-76. doi:<a href=\"https://doi.org/10.1007/978-3-662-53354-3_6\">10.1007/978-3-662-53354-3_6</a>","short":"K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.","ieee":"K. Hansen, R. Ibsen-Jensen, and M. Koucký, “The big match in small space,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 64–76."},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"alternative_title":["LNCS"],"status":"public","day":"01","ec_funded":1,"title":"The big match in small space","page":"64 - 76","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We study repeated games with absorbing states, a type of two-player, zero-sum concurrent mean-payoff games with the prototypical example being the Big Match of Gillete (1957). These games may not allow optimal strategies but they always have ε-optimal strategies. In this paper we design ε-optimal strategies for Player 1 in these games that use only O(log log T) space. Furthermore, we construct strategies for Player 1 that use space s(T), for an arbitrary small unbounded non-decreasing function s, and which guarantee an ε-optimal value for Player 1 in the limit superior sense. The previously known strategies use space Ω(log T) and it was known that no strategy can use constant space if it is ε-optimal even in the limit superior sense. We also give a complementary lower bound. Furthermore, we also show that no Markov strategy, even extended with finite memory, can ensure value greater than 0 in the Big Match, answering a question posed by Neyman [11]."}],"publication_status":"published","external_id":{"arxiv":["1604.07634"],"isi":["000389020400006"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Hansen, Kristoffer","last_name":"Hansen","first_name":"Kristoffer"},{"orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"last_name":"Koucký","first_name":"Michal","full_name":"Koucký, Michal"}],"volume":9928,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.07634"}],"conference":{"name":"SAGT: Symposium on Algorithmic Game Theory","start_date":"2016-09-19","location":"Liverpool, United Kingdom","end_date":"2016-09-21"},"quality_controlled":"1","doi":"10.1007/978-3-662-53354-3_6","year":"2016","date_created":"2018-12-11T11:51:28Z"},{"citation":{"short":"V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016).","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the complexity of the orbit problem,” <i>Journal of the ACM</i>, vol. 63, no. 3. ACM, 2016.","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the complexity of the orbit problem. Journal of the ACM. 63(3), 23.","ama":"Chonev VK, Ouaknine J, Worrell J. On the complexity of the orbit problem. <i>Journal of the ACM</i>. 2016;63(3). doi:<a href=\"https://doi.org/10.1145/2857050\">10.1145/2857050</a>","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Complexity of the Orbit Problem.” <i>Journal of the ACM</i>. ACM, 2016. <a href=\"https://doi.org/10.1145/2857050\">https://doi.org/10.1145/2857050</a>.","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On the complexity of the orbit problem. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2857050\">https://doi.org/10.1145/2857050</a>","mla":"Chonev, Ventsislav K., et al. “On the Complexity of the Orbit Problem.” <i>Journal of the ACM</i>, vol. 63, no. 3, 23, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2857050\">10.1145/2857050</a>."},"day":"01","status":"public","oa":1,"isi":1,"publisher":"ACM","arxiv":1,"department":[{"_id":"KrCh"}],"date_updated":"2025-09-22T07:33:47Z","language":[{"iso":"eng"}],"month":"06","date_published":"2016-06-01T00:00:00Z","type":"journal_article","oa_version":"Preprint","intvolume":"        63","_id":"1380","scopus_import":"1","publist_id":"5831","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1303.2981","open_access":"1"}],"article_number":"23","year":"2016","date_created":"2018-12-11T11:51:41Z","publication":"Journal of the ACM","issue":"3","doi":"10.1145/2857050","abstract":[{"lang":"eng","text":"We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem - determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when V has dimension one, this problem is solvable in polynomial time, and when V has dimension two or three, the problem is in NPRP."}],"external_id":{"arxiv":["1303.2981"],"isi":["000382753300004"]},"publication_status":"published","article_processing_charge":"No","title":"On the complexity of the orbit problem","volume":63,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Ventsislav K","last_name":"Chonev","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","full_name":"Chonev, Ventsislav K"},{"full_name":"Ouaknine, Joël","last_name":"Ouaknine","first_name":"Joël"},{"full_name":"Worrell, James","last_name":"Worrell","first_name":"James"}]},{"doi":"10.1145/2933575.2934548","publication":"LICS '16","date_created":"2018-12-11T11:51:44Z","year":"2016","main_file_link":[{"url":"https://arxiv.org/abs/1507.03632","open_access":"1"}],"conference":{"name":"LICS: Logic in Computer Science","start_date":"2018-07-05","location":"New York, NY, USA","end_date":"2018-07-08"},"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","full_name":"Chonev, Ventsislav K","first_name":"Ventsislav K","last_name":"Chonev"},{"last_name":"Ouaknine","first_name":"Joël","full_name":"Ouaknine, Joël"},{"full_name":"Worrell, James","first_name":"James","last_name":"Worrell"}],"title":"On recurrent reachability for continuous linear dynamical systems","article_processing_charge":"No","page":"515 - 524","external_id":{"arxiv":["1507.03632"],"isi":["000387609200052"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The continuous evolution of a wide variety of systems, including continous-time Markov chains and linear hybrid automata, can be\r\ndescribed in terms of linear differential equations. In this paper we study the decision problem of whether the solution x(t) of a system of linear differential equations dx/dt = Ax reaches a target halfspace infinitely often. This recurrent reachability problem can\r\nequivalently be formulated as the following Infinite Zeros Problem: does a real-valued function f:R≥0 --&gt; R satisfying a given linear\r\ndifferential equation have infinitely many zeros? Our main decidability result is that if the differential equation has order at most 7, then the Infinite Zeros Problem is decidable. On the other hand, we show that a decision procedure for the Infinite Zeros Problem at order 9 (and above) would entail a major breakthrough in Diophantine Approximation, specifically an algorithm for computing the Lagrange constants of arbitrary real algebraic numbers to arbitrary precision."}],"status":"public","day":"05","ec_funded":1,"citation":{"apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On recurrent reachability for continuous linear dynamical systems. In <i>LICS ’16</i> (pp. 515–524). New York, NY, USA: IEEE. <a href=\"https://doi.org/10.1145/2933575.2934548\">https://doi.org/10.1145/2933575.2934548</a>","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” In <i>LICS ’16</i>, 515–24. IEEE, 2016. <a href=\"https://doi.org/10.1145/2933575.2934548\">https://doi.org/10.1145/2933575.2934548</a>.","mla":"Chonev, Ventsislav K., et al. “On Recurrent Reachability for Continuous Linear Dynamical Systems.” <i>LICS ’16</i>, IEEE, 2016, pp. 515–24, doi:<a href=\"https://doi.org/10.1145/2933575.2934548\">10.1145/2933575.2934548</a>.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On recurrent reachability for continuous linear dynamical systems,” in <i>LICS ’16</i>, New York, NY, USA, 2016, pp. 515–524.","ama":"Chonev VK, Ouaknine J, Worrell J. On recurrent reachability for continuous linear dynamical systems. In: <i>LICS ’16</i>. IEEE; 2016:515-524. doi:<a href=\"https://doi.org/10.1145/2933575.2934548\">10.1145/2933575.2934548</a>","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On recurrent reachability for continuous linear dynamical systems. LICS ’16. LICS: Logic in Computer Science, 515–524."},"project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"publist_id":"5820","scopus_import":"1","_id":"1389","oa_version":"Preprint","type":"conference","date_published":"2016-07-05T00:00:00Z","language":[{"iso":"eng"}],"month":"07","date_updated":"2025-09-22T07:31:08Z","publisher":"IEEE","department":[{"_id":"KrCh"}],"arxiv":1,"isi":1,"oa":1},{"_id":"1423","scopus_import":"1","publist_id":"5784","type":"journal_article","acknowledgement":"C.H. acknowledges generous funding from the Schrödinger scholarship of the Austrian Science Fund (FWF), J3475.","oa_version":"Published Version","intvolume":"         6","publisher":"Nature Publishing Group","department":[{"_id":"KrCh"}],"date_updated":"2025-09-18T14:15:33Z","month":"05","language":[{"iso":"eng"}],"date_published":"2016-05-10T00:00:00Z","oa":1,"file_date_updated":"2020-07-14T12:44:53Z","isi":1,"status":"public","pubrep_id":"590","day":"10","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"citation":{"mla":"Baek, Seung, et al. “Comparing Reactive and Memory-One Strategies of Direct Reciprocity.” <i>Scientific Reports</i>, vol. 6, 25676, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/srep25676\">10.1038/srep25676</a>.","apa":"Baek, S., Jeong, H., Hilbe, C., &#38; Nowak, M. (2016). Comparing reactive and memory-one strategies of direct reciprocity. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep25676\">https://doi.org/10.1038/srep25676</a>","chicago":"Baek, Seung, Hyeongchai Jeong, Christian Hilbe, and Martin Nowak. “Comparing Reactive and Memory-One Strategies of Direct Reciprocity.” <i>Scientific Reports</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/srep25676\">https://doi.org/10.1038/srep25676</a>.","ista":"Baek S, Jeong H, Hilbe C, Nowak M. 2016. Comparing reactive and memory-one strategies of direct reciprocity. Scientific Reports. 6, 25676.","ama":"Baek S, Jeong H, Hilbe C, Nowak M. Comparing reactive and memory-one strategies of direct reciprocity. <i>Scientific Reports</i>. 2016;6. doi:<a href=\"https://doi.org/10.1038/srep25676\">10.1038/srep25676</a>","short":"S. Baek, H. Jeong, C. Hilbe, M. Nowak, Scientific Reports 6 (2016).","ieee":"S. Baek, H. Jeong, C. Hilbe, and M. Nowak, “Comparing reactive and memory-one strategies of direct reciprocity,” <i>Scientific Reports</i>, vol. 6. Nature Publishing Group, 2016."},"volume":6,"author":[{"last_name":"Baek","first_name":"Seung","full_name":"Baek, Seung"},{"full_name":"Jeong, Hyeongchai","last_name":"Jeong","first_name":"Hyeongchai"},{"last_name":"Hilbe","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Comparing reactive and memory-one strategies of direct reciprocity","abstract":[{"text":"Direct reciprocity is a mechanism for the evolution of cooperation based on repeated interactions. When individuals meet repeatedly, they can use conditional strategies to enforce cooperative outcomes that would not be feasible in one-shot social dilemmas. Direct reciprocity requires that individuals keep track of their past interactions and find the right response. However, there are natural bounds on strategic complexity: Humans find it difficult to remember past interactions accurately, especially over long timespans. Given these limitations, it is natural to ask how complex strategies need to be for cooperation to evolve. Here, we study stochastic evolutionary game dynamics in finite populations to systematically compare the evolutionary performance of reactive strategies, which only respond to the co-player's previous move, and memory-one strategies, which take into account the own and the co-player's previous move. In both cases, we compare deterministic strategy and stochastic strategy spaces. For reactive strategies and small costs, we find that stochasticity benefits cooperation, because it allows for generous-tit-for-tat. For memory one strategies and small costs, we find that stochasticity does not increase the propensity for cooperation, because the deterministic rule of win-stay, lose-shift works best. For memory one strategies and large costs, however, stochasticity can augment cooperation.","lang":"eng"}],"external_id":{"isi":["000375448500002"]},"publication_status":"published","article_processing_charge":"No","publication":"Scientific Reports","doi":"10.1038/srep25676","article_number":"25676","year":"2016","date_created":"2018-12-11T11:51:56Z","ddc":["000"],"has_accepted_license":"1","file":[{"date_created":"2018-12-12T10:18:08Z","content_type":"application/pdf","file_name":"IST-2016-590-v1+1_srep25676.pdf","creator":"system","file_id":"5327","checksum":"ee17c482370d2e1b3add393710d3c696","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:44:53Z","file_size":1349915}],"quality_controlled":"1","corr_author":"1"},{"type":"conference","acknowledgement":"Supported by the Natural Science Foundation of China (NSFC) under Grant No. 61532019 ","oa_version":"Preprint","scopus_import":1,"_id":"1438","publist_id":"5760","oa":1,"date_updated":"2025-04-15T08:12:22Z","arxiv":1,"publisher":"ACM","department":[{"_id":"KrCh"}],"date_published":"2016-01-11T00:00:00Z","language":[{"iso":"eng"}],"month":"01","ec_funded":1,"day":"11","status":"public","alternative_title":["POPL"],"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs</i>. Vol. 20–22, ACM, 2016, pp. 327–42, doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>.","apa":"Chatterjee, K., Fu, H., Novotný, P., &#38; Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Vol 20-22. ACM; 2016:327-342. doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342."},"volume":"20-22","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","full_name":"Fu, Hongfei"},{"first_name":"Petr","last_name":"Novotny","full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hasheminezhad","first_name":"Rouzbeh","full_name":"Hasheminezhad, Rouzbeh"}],"related_material":{"record":[{"relation":"later_version","id":"5993","status":"public"}]},"publication_status":"published","external_id":{"arxiv":["1510.08517"]},"abstract":[{"text":"In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: (a) qualitative ones that ask (i) whether the program terminates with probability 1 (almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); (b) quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps decreases exponentially (concentration problem). To solve these questions, we utilize the notion of ranking supermartingales which is a powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmic synthesis of linear ranking-supermartingales over affine probabilistic programs (APP's) with both angelic and demonic non-determinism. An important subclass of APP's is LRAPP which is defined as the class of all APP's over which a linear ranking-supermartingale exists. Our main contributions are as follows. Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism. Secondly, we show that the concentration problem over LRAPP can be solved in the same complexity as for the membership problem of LRAPP. Finally, we show that the expectation problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's without probability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate the effectiveness of our approach to answer the qualitative and quantitative questions over APP's with at most demonic non-determinism.","lang":"eng"}],"page":"327 - 342","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","date_created":"2018-12-11T11:52:01Z","year":"2016","doi":"10.1145/2837614.2837639","quality_controlled":"1","conference":{"start_date":"2016-01-20","name":"POPL: Principles of Programming Languages","end_date":"2016-01-22","location":"St. Petersburg, FL, USA"},"main_file_link":[{"url":"http://arxiv.org/abs/1510.08517","open_access":"1"}]}]