[{"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"}],"issue":"02","_id":"9197","scopus_import":"1","title":"All-pay bidding games on graphs","intvolume":"        34","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2021-02-25T09:05:18Z","article_processing_charge":"No","page":"1798-1805","quality_controlled":"1","article_type":"original","publisher":"Association for the Advancement of Artificial Intelligence","external_id":{"arxiv":["1911.08360"]},"date_updated":"2023-09-05T12:40:00Z","year":"2020","citation":{"short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:<a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">10.1609/aaai.v34i02.5546</a>.","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","apa":"Avni, G., Ibsen-Jensen, R., &#38; Tkadlec, J. (2020). All-pay bidding games on graphs. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. New York, NY, United States: Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">https://doi.org/10.1609/aaai.v34i02.5546</a>","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. 2020;34(02):1798-1805. doi:<a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">10.1609/aaai.v34i02.5546</a>","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2020. <a href=\"https://doi.org/10.1609/aaai.v34i02.5546\">https://doi.org/10.1609/aaai.v34i02.5546</a>."},"abstract":[{"text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve.","lang":"eng"}],"doi":"10.1609/aaai.v34i02.5546","arxiv":1,"day":"03","volume":34,"acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","month":"04","oa_version":"Preprint","project":[{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","call_identifier":"FWF","_id":"264B3912-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"conference":{"location":"New York, NY, United States","end_date":"2020-02-12","start_date":"2020-02-07","name":"AAAI: Conference on Artificial Intelligence"},"date_published":"2020-04-03T00:00:00Z","type":"journal_article","publication_identifier":{"isbn":["9781577358350"],"eissn":["2374-3468"],"issn":["2159-5399"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public"},{"month":"10","title":"Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners","oa_version":"Published Version","department":[{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2021-08-06T13:09:57Z","author":[{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"_id":"9814","publisher":"Royal Society","abstract":[{"lang":"eng","text":"Data and mathematica notebooks for plotting figures from Language learning with communication between learners"}],"oa":1,"doi":"10.6084/m9.figshare.5973013.v1","day":"15","date_published":"2020-10-15T00:00:00Z","type":"research_data_reference","date_updated":"2023-10-18T06:36:00Z","year":"2020","citation":{"mla":"Ibsen-Jensen, Rasmus, et al. <i>Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners</i>. Royal Society, 2020, doi:<a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>.","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2020. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners, Royal Society, <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>.","apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., &#38; Nowak, M. (2020). Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. Royal Society. <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">https://doi.org/10.6084/m9.figshare.5973013.v1</a>","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners. 2020. doi:<a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">10.6084/m9.figshare.5973013.v1</a>","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.” Royal Society, 2020. <a href=\"https://doi.org/10.6084/m9.figshare.5973013.v1\">https://doi.org/10.6084/m9.figshare.5973013.v1</a>."},"status":"public","related_material":{"record":[{"status":"public","relation":"used_in_publication","id":"198"}]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.5973013.v1"}]},{"oa_version":"Preprint","publication_status":"submitted","department":[{"_id":"HeEd"},{"_id":"UlWa"},{"_id":"KrCh"}],"date_created":"2020-06-08T12:25:25Z","article_processing_charge":"No","month":"03","title":"Token swapping on trees","article_number":"1903.06981","publication":"arXiv","_id":"7950","author":[{"last_name":"Biniaz","first_name":"Ahmad","full_name":"Biniaz, Ahmad"},{"full_name":"Jain, Kshitij","last_name":"Jain","first_name":"Kshitij"},{"full_name":"Lubiw, Anna","first_name":"Anna","last_name":"Lubiw"},{"last_name":"Masárová","first_name":"Zuzana","full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Miltzow, Tillmann","first_name":"Tillmann","last_name":"Miltzow"},{"last_name":"Mondal","first_name":"Debajyoti","full_name":"Mondal, Debajyoti"},{"last_name":"Naredla","first_name":"Anurag Murty","full_name":"Naredla, Anurag Murty"},{"last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexi","last_name":"Turcotte","full_name":"Turcotte, Alexi"}],"language":[{"iso":"eng"}],"arxiv":1,"day":"16","abstract":[{"lang":"eng","text":"The input to the token swapping problem is a graph with vertices v1, v2, . . . , vn, and n tokens with labels 1,2, . . . , n, one on each vertex.  The goal is to get token i to vertex vi for all i= 1, . . . , n using a minimum number of swaps, where a swap exchanges the tokens on the endpoints of an edge.Token swapping on a tree, also known as “sorting with a transposition tree,” is not known to be in P nor NP-complete.  We present some partial results:\r\n1.  An optimum swap sequence may need to perform a swap on a leaf vertex that has the correct token (a “happy leaf”), disproving a conjecture of Vaughan.\r\n2.  Any algorithm that fixes happy leaves—as all known approximation algorithms for the problem do—has approximation factor at least 4/3.  Furthermore, the two best-known 2-approximation algorithms have approximation factor exactly 2.\r\n3.  A generalized problem—weighted coloured token swapping—is NP-complete on trees, but solvable in polynomial time on paths and stars.  In this version, tokens and  vertices  have  colours,  and  colours  have  weights.   The  goal  is  to  get  every token to a vertex of the same colour, and the cost of a swap is the sum of the weights of the two tokens involved."}],"oa":1,"date_updated":"2024-01-04T12:42:08Z","year":"2019","citation":{"ieee":"A. Biniaz <i>et al.</i>, “Token swapping on trees,” <i>arXiv</i>. .","chicago":"Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” <i>ArXiv</i>, n.d.","ama":"Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. <i>arXiv</i>.","apa":"Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. <i>arXiv</i>.","ista":"Biniaz A, Jain K, Lubiw A, Masárová Z, Miltzow T, Mondal D, Naredla AM, Tkadlec J, Turcotte A. Token swapping on trees. arXiv, 1903.06981.","mla":"Biniaz, Ahmad, et al. “Token Swapping on Trees.” <i>ArXiv</i>, 1903.06981.","short":"A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.)."},"date_published":"2019-03-16T00:00:00Z","type":"preprint","external_id":{"arxiv":["1903.06981"]},"main_file_link":[{"url":"https://arxiv.org/abs/1903.06981","open_access":"1"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","id":"7944","status":"public"},{"relation":"later_version","id":"12833","status":"public"}]}},{"has_accepted_license":"1","publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"}],"oa_version":"Published Version","article_number":"129","month":"10","language":[{"iso":"eng"}],"conference":{"name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","start_date":"2019-10-23","location":"Athens, Greece","end_date":"2019-10-25"},"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"type":"conference","date_published":"2019-10-01T00:00:00Z","oa":1,"file":[{"date_created":"2019-08-12T15:40:57Z","file_size":1024643,"checksum":"3482d8ace6fb4991eb7810e3b70f1b9f","date_updated":"2020-07-14T12:47:40Z","file_name":"oopsla-2019.pdf","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"6807","creator":"akafshda"},{"checksum":"4e5a6fb2b59a75222a4e8335a5a60eac","file_size":538579,"date_created":"2020-05-12T15:15:14Z","content_type":"application/pdf","file_name":"2019_ACM_Huang.pdf","date_updated":"2020-07-14T12:47:40Z","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"7821"}],"status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","license":"https://creativecommons.org/licenses/by-nc/4.0/","_id":"6780","author":[{"full_name":"Huang, Mingzhang","last_name":"Huang","first_name":"Mingzhang"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"}],"department":[{"_id":"KrCh"}],"date_created":"2019-08-09T09:54:20Z","article_processing_charge":"No","publication_status":"published","intvolume":"         3","title":"Modular verification for almost-sure termination of probabilistic programs","quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:47:40Z","publisher":"ACM","year":"2019","citation":{"ista":"Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.","mla":"Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, vol. 3, 129, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3360555\">10.1145/3360555</a>.","short":"M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, 2019.","ieee":"M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, Athens, Greece, 2019, vol. 3.","chicago":"Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, Vol. 3. ACM, 2019. <a href=\"https://doi.org/10.1145/3360555\">https://doi.org/10.1145/3360555</a>.","ama":"Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>. Vol 3. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3360555\">10.1145/3360555</a>","apa":"Huang, M., Fu, H., Chatterjee, K., &#38; Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i> (Vol. 3). Athens, Greece: ACM. <a href=\"https://doi.org/10.1145/3360555\">https://doi.org/10.1145/3360555</a>"},"date_updated":"2025-06-02T08:53:47Z","external_id":{"arxiv":["1901.06087"]},"day":"01","arxiv":1,"doi":"10.1145/3360555","abstract":[{"lang":"eng","text":"In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a\r\ngiven probabilistic program terminates with probability 1. Scalable approaches for program analysis often\r\nrely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure\r\ntermination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic programs.\r\nBesides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a\r\nsound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel\r\nnotion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat are linear and show that they can be synthesized in polynomial time. Finally, we present experimental\r\nresults on a variety of benchmarks and several natural examples that model various types of nested while\r\nloops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination property"}],"volume":3,"ddc":["000"]},{"ddc":["000"],"volume":572,"isi":1,"external_id":{"isi":["000482219600045"]},"date_updated":"2023-08-29T07:42:54Z","year":"2019","citation":{"mla":"Hauser, Oliver P., et al. “Social Dilemmas among Unequals.” <i>Nature</i>, vol. 572, no. 7770, Springer Nature, 2019, pp. 524–27, doi:<a href=\"https://doi.org/10.1038/s41586-019-1488-5\">10.1038/s41586-019-1488-5</a>.","short":"O.P. Hauser, C. Hilbe, K. Chatterjee, M.A. Nowak, Nature 572 (2019) 524–527.","ista":"Hauser OP, Hilbe C, Chatterjee K, Nowak MA. 2019. Social dilemmas among unequals. Nature. 572(7770), 524–527.","apa":"Hauser, O. P., Hilbe, C., Chatterjee, K., &#38; Nowak, M. A. (2019). Social dilemmas among unequals. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-019-1488-5\">https://doi.org/10.1038/s41586-019-1488-5</a>","ama":"Hauser OP, Hilbe C, Chatterjee K, Nowak MA. Social dilemmas among unequals. <i>Nature</i>. 2019;572(7770):524-527. doi:<a href=\"https://doi.org/10.1038/s41586-019-1488-5\">10.1038/s41586-019-1488-5</a>","ieee":"O. P. Hauser, C. Hilbe, K. Chatterjee, and M. A. Nowak, “Social dilemmas among unequals,” <i>Nature</i>, vol. 572, no. 7770. Springer Nature, pp. 524–527, 2019.","chicago":"Hauser, Oliver P., Christian Hilbe, Krishnendu Chatterjee, and Martin A. Nowak. “Social Dilemmas among Unequals.” <i>Nature</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s41586-019-1488-5\">https://doi.org/10.1038/s41586-019-1488-5</a>."},"abstract":[{"lang":"eng","text":"Direct reciprocity is a powerful mechanism for the evolution of cooperation on the basis of repeated interactions1,2,3,4. It requires that interacting individuals are sufficiently equal, such that everyone faces similar consequences when they cooperate or defect. Yet inequality is ubiquitous among humans5,6 and is generally considered to undermine cooperation and welfare7,8,9,10. Most previous models of reciprocity do not include inequality11,12,13,14,15. These models assume that individuals are the same in all relevant aspects. Here we introduce a general framework to study direct reciprocity among unequal individuals. Our model allows for multiple sources of inequality. Subjects can differ in their endowments, their productivities and in how much they benefit from public goods. We find that extreme inequality prevents cooperation. But if subjects differ in productivity, some endowment inequality can be necessary for cooperation to prevail. Our mathematical predictions are supported by a behavioural experiment in which we vary the endowments and productivities of the subjects. We observe that overall welfare is maximized when the two sources of heterogeneity are aligned, such that more productive individuals receive higher endowments. By contrast, when endowments and productivities are misaligned, cooperation quickly breaks down. Our findings have implications for policy-makers concerned with equity, efficiency and the provisioning of public goods."}],"doi":"10.1038/s41586-019-1488-5","day":"22","file_date_updated":"2020-07-14T12:47:42Z","page":"524-527","ec_funded":1,"quality_controlled":"1","article_type":"letter_note","publisher":"Springer Nature","author":[{"first_name":"Oliver P.","last_name":"Hauser","full_name":"Hauser, Oliver P."},{"first_name":"Christian","last_name":"Hilbe","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","first_name":"Martin A.","full_name":"Nowak, Martin A."}],"issue":"7770","_id":"6836","scopus_import":"1","title":"Social dilemmas among unequals","intvolume":"       572","publication_status":"published","article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2019-09-01T22:00:56Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"link":[{"url":"https://ist.ac.at/en/news/too-much-inequality-impedes-support-for-public-goods-according-to-research-published-in-nature/","relation":"press_release","description":"News on IST Homepage"}]},"status":"public","file":[{"file_id":"7828","creator":"dernst","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:42Z","file_name":"2019_Nature_Hauser.pdf","content_type":"application/pdf","date_created":"2020-05-14T10:00:32Z","checksum":"a6e0e3168bf62de624e7772cdfaeb26f","file_size":18577756}],"date_published":"2019-08-22T00:00:00Z","type":"journal_article","oa":1,"publication_identifier":{"issn":["00280836"],"eissn":["14764687"]},"language":[{"iso":"eng"}],"publication":"Nature","has_accepted_license":"1","month":"08","oa_version":"Submitted Version","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}]},{"arxiv":1,"doi":"10.4230/LIPICS.MFCS.2019.11","day":"01","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the \"bank\" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. "}],"date_updated":"2023-08-07T14:08:34Z","citation":{"short":"G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Avni, Guy, et al. <i>Bidding Mechanisms in Graph Games</i>. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.11\">10.4230/LIPICS.MFCS.2019.11</a>.","ista":"Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.","apa":"Avni, G., Henzinger, T. A., &#38; Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.11\">https://doi.org/10.4230/LIPICS.MFCS.2019.11</a>","ama":"Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.11\">10.4230/LIPICS.MFCS.2019.11</a>","chicago":"Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2019.11\">https://doi.org/10.4230/LIPICS.MFCS.2019.11</a>.","ieee":"G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138."},"year":"2019","external_id":{"arxiv":["1905.03835"]},"volume":138,"ddc":["004"],"publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_created":"2019-09-18T08:04:26Z","alternative_title":["LIPIcs"],"title":"Bidding mechanisms in graph games","intvolume":"       138","_id":"6884","scopus_import":1,"author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","last_name":"Zikelic","first_name":"Dorde","full_name":"Zikelic, Dorde"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:47:42Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2019-08-01T00:00:00Z","type":"conference","file":[{"creator":"kschuh","file_id":"6913","relation":"main_file","access_level":"open_access","file_name":"2019_LIPIcs_Avni.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:42Z","checksum":"6346e116a4f4ed1414174d96d2c4fbd7","file_size":554457,"date_created":"2019-09-27T11:45:15Z"}],"related_material":{"record":[{"relation":"later_version","id":"9239","status":"public"}]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","oa_version":"Published Version","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"},{"name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"}],"month":"08","article_number":"11","has_accepted_license":"1","conference":{"location":"Aachen, Germany","end_date":"2019-08-30","name":"MFCS: nternational Symposium on Mathematical Foundations of Computer Science","start_date":"2019-08-26"},"language":[{"iso":"eng"}]},{"publication_status":"published","date_created":"2019-09-18T08:06:14Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"alternative_title":["LIPIcs"],"title":"Long-run average behavior of vector addition systems with states","intvolume":"       140","_id":"6885","scopus_import":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:43Z","doi":"10.4230/LIPICS.CONCUR.2019.27","day":"01","abstract":[{"lang":"eng","text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. "}],"date_updated":"2021-01-12T08:09:27Z","year":"2019","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.","mla":"Chatterjee, Krishnendu, et al. <i>Long-Run Average Behavior of Vector Addition Systems with States</i>. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.27\">10.4230/LIPICS.CONCUR.2019.27</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.27\">https://doi.org/10.4230/LIPICS.CONCUR.2019.27</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.27\">https://doi.org/10.4230/LIPICS.CONCUR.2019.27</a>","ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.27\">10.4230/LIPICS.CONCUR.2019.27</a>"},"volume":140,"ddc":["000"],"oa_version":"Published Version","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"month":"08","article_number":"27","has_accepted_license":"1","conference":{"start_date":"2019-08-27","name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","location":"Amsterdam, Netherlands"},"language":[{"iso":"eng"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2019-08-01T00:00:00Z","type":"conference","file":[{"file_name":"2019_LIPIcs_Chatterjee.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:43Z","checksum":"4985e26e1572d1575d64d38acabd71d6","file_size":538120,"date_created":"2019-09-27T12:09:35Z","creator":"kschuh","file_id":"6914","relation":"main_file","access_level":"open_access"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public"},{"day":"01","doi":"10.4230/LIPICS.CONCUR.2019.7","abstract":[{"text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. ","lang":"eng"}],"year":"2019","citation":{"ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.","mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” <i>Leibniz International Proceedings in Informatics</i>, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.7\">10.4230/LIPICS.CONCUR.2019.7</a>.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in <i>Leibniz International Proceedings in Informatics</i>, Amsterdam, Netherlands, 2019, vol. 140.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.7\">https://doi.org/10.4230/LIPICS.CONCUR.2019.7</a>.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.7\">10.4230/LIPICS.CONCUR.2019.7</a>","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., &#38; Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.7\">https://doi.org/10.4230/LIPICS.CONCUR.2019.7</a>"},"date_updated":"2022-08-12T10:54:34Z","volume":140,"ddc":["000"],"date_created":"2019-09-18T08:07:58Z","article_processing_charge":"No","department":[{"_id":"KrCh"}],"publication_status":"published","intvolume":"       140","alternative_title":["LIPIcs"],"title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","scopus_import":"1","_id":"6887","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dvorák","first_name":"Wolfgang","full_name":"Dvorák, Wolfgang"},{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:47:43Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","date_published":"2019-08-01T00:00:00Z","file":[{"creator":"kschuh","file_id":"6922","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2019_LIPIcs_Chatterjee.pdf","date_updated":"2020-07-14T12:47:43Z","file_size":730112,"checksum":"e1f0e4061212454574f34a1368d018ec","date_created":"2019-10-01T08:20:30Z"}],"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","article_number":"7","month":"08","has_accepted_license":"1","publication":"Leibniz International Proceedings in Informatics","conference":{"name":"CONCUR: International Conference on Concurrency Theory","start_date":"2019-08-27","location":"Amsterdam, Netherlands","end_date":"2019-08-30"},"language":[{"iso":"eng"}]},{"date_updated":"2021-01-12T08:09:28Z","citation":{"mla":"Chatterjee, Krishnendu, and Nir Piterman. <i>Combinations of Qualitative Winning for Stochastic Parity Games</i>. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">10.4230/LIPICS.CONCUR.2019.6</a>.","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","apa":"Chatterjee, K., &#38; Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">https://doi.org/10.4230/LIPICS.CONCUR.2019.6</a>","ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">10.4230/LIPICS.CONCUR.2019.6</a>","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. <a href=\"https://doi.org/10.4230/LIPICS.CONCUR.2019.6\">https://doi.org/10.4230/LIPICS.CONCUR.2019.6</a>.","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140."},"year":"2019","doi":"10.4230/LIPICS.CONCUR.2019.6","day":"01","abstract":[{"text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. ","lang":"eng"}],"volume":140,"ddc":["000"],"_id":"6889","scopus_import":1,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nir","last_name":"Piterman","full_name":"Piterman, Nir"}],"publication_status":"published","department":[{"_id":"KrCh"}],"date_created":"2019-09-18T08:11:43Z","alternative_title":["LIPIcs"],"title":"Combinations of Qualitative Winning for Stochastic Parity Games","intvolume":"       140","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:43Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2019-08-01T00:00:00Z","type":"conference","oa":1,"file":[{"relation":"main_file","access_level":"open_access","file_id":"6923","creator":"kschuh","date_created":"2019-10-01T08:49:45Z","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","file_size":509163,"date_updated":"2020-07-14T12:47:43Z","content_type":"application/pdf","file_name":"2019_LIPIcs_Chatterjee.pdf"}],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","oa_version":"Published Version","project":[{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"month":"08","article_number":"6","language":[{"iso":"eng"}],"conference":{"start_date":"2019-08-27","name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","location":"Amsterdam, Netherlands"}},{"type":"conference","date_published":"2019-09-04T00:00:00Z","publication_identifier":{"isbn":["9783030302801"],"issn":["0302-9743"],"eisbn":["9783030302818"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1906.08178","open_access":"1"}],"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication":"16th International Conference on Quantitative Evaluation of Systems","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"oa_version":"Preprint","month":"09","language":[{"iso":"eng"}],"conference":{"location":"Glasgow, United Kingdom","end_date":"2019-09-12","name":"QEST: Quantitative Evaluation of Systems","start_date":"2019-09-10"},"citation":{"apa":"Ashok, P., Brázdil, T., Chatterjee, K., Křetínský, J., Lampert, C., &#38; Toman, V. (2019). Strategy representation by decision trees with linear classifiers. In <i>16th International Conference on Quantitative Evaluation of Systems</i> (Vol. 11785, pp. 109–128). Glasgow, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-30281-8_7\">https://doi.org/10.1007/978-3-030-30281-8_7</a>","ama":"Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. Strategy representation by decision trees with linear classifiers. In: <i>16th International Conference on Quantitative Evaluation of Systems</i>. Vol 11785. Springer Nature; 2019:109-128. doi:<a href=\"https://doi.org/10.1007/978-3-030-30281-8_7\">10.1007/978-3-030-30281-8_7</a>","chicago":"Ashok, Pranav, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear Classifiers.” In <i>16th International Conference on Quantitative Evaluation of Systems</i>, 11785:109–28. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-30281-8_7\">https://doi.org/10.1007/978-3-030-30281-8_7</a>.","ieee":"P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, and V. Toman, “Strategy representation by decision trees with linear classifiers,” in <i>16th International Conference on Quantitative Evaluation of Systems</i>, Glasgow, United Kingdom, 2019, vol. 11785, pp. 109–128.","short":"P. Ashok, T. Brázdil, K. Chatterjee, J. Křetínský, C. Lampert, V. Toman, in:, 16th International Conference on Quantitative Evaluation of Systems, Springer Nature, 2019, pp. 109–128.","mla":"Ashok, Pranav, et al. “Strategy Representation by Decision Trees with Linear Classifiers.” <i>16th International Conference on Quantitative Evaluation of Systems</i>, vol. 11785, Springer Nature, 2019, pp. 109–28, doi:<a href=\"https://doi.org/10.1007/978-3-030-30281-8_7\">10.1007/978-3-030-30281-8_7</a>.","ista":"Ashok P, Brázdil T, Chatterjee K, Křetínský J, Lampert C, Toman V. 2019. Strategy representation by decision trees with linear classifiers. 16th International Conference on Quantitative Evaluation of Systems. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11785, 109–128."},"year":"2019","date_updated":"2025-06-02T08:53:47Z","external_id":{"isi":["000679281300007"],"arxiv":["1906.08178"]},"isi":1,"day":"04","arxiv":1,"doi":"10.1007/978-3-030-30281-8_7","abstract":[{"text":"Graph games and Markov decision processes (MDPs) are standard models in reactive synthesis and verification of probabilistic systems with nondeterminism. The class of   𝜔 -regular winning conditions; e.g., safety, reachability, liveness, parity conditions; provides a robust and expressive specification formalism for properties that arise in analysis of reactive systems. The resolutions of nondeterminism in games and MDPs are represented as strategies, and we consider succinct representation of such strategies. The decision-tree data structure from machine learning retains the flavor of decisions of strategies and allows entropy-based minimization to obtain succinct trees. However, in contrast to traditional machine-learning problems where small errors are allowed, for winning strategies in graph games and MDPs no error is allowed, and the decision tree must represent the entire strategy. In this work we propose decision trees with linear classifiers for representation of strategies in graph games and MDPs. We have implemented strategy representation using this data structure and we present experimental results for problems on graph games and MDPs, which show that this new data structure presents a much more efficient strategy representation as compared to standard decision trees.","lang":"eng"}],"volume":11785,"scopus_import":"1","_id":"6942","author":[{"last_name":"Ashok","first_name":"Pranav","full_name":"Ashok, Pranav"},{"full_name":"Brázdil, Tomáš","first_name":"Tomáš","last_name":"Brázdil"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Křetínský","first_name":"Jan","full_name":"Křetínský, Jan"},{"first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9036-063X","full_name":"Toman, Viktor","first_name":"Viktor","last_name":"Toman"}],"date_created":"2019-10-14T06:57:49Z","department":[{"_id":"KrCh"},{"_id":"ChLa"}],"article_processing_charge":"No","publication_status":"published","intvolume":"     11785","alternative_title":["LNCS"],"title":"Strategy representation by decision trees with linear classifiers","quality_controlled":"1","page":"109-128","publisher":"Springer Nature"},{"article_type":"original","publisher":"ACM","ec_funded":1,"quality_controlled":"1","title":"Non-polynomial worst-case analysis of recursive programs","intvolume":"        41","publication_status":"published","article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2019-11-13T08:33:43Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fu, Hongfei","first_name":"Hongfei","last_name":"Fu"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"}],"issue":"4","_id":"7014","scopus_import":"1","volume":41,"abstract":[{"text":"We study the problem of developing efficient approaches for proving\r\nworst-case bounds of non-deterministic recursive programs. Ranking functions\r\nare sound and complete for proving termination and worst-case bounds of\r\nnonrecursive programs. First, we apply ranking functions to recursion,\r\nresulting in measure functions. We show that measure functions provide a sound\r\nand complete approach to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second contribution is the synthesis of measure functions in\r\nnonpolynomial forms. We show that non-polynomial measure functions with\r\nlogarithm and exponentiation can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$ is not an integer. We present\r\nexperimental results to demonstrate that our approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii) Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that $r$ is not an integer and\r\nclose to the best-known bounds for the respective algorithms.","lang":"eng"}],"arxiv":1,"doi":"10.1145/3339984","day":"01","isi":1,"external_id":{"isi":["000564108400001"],"arxiv":["1705.00317"]},"date_updated":"2025-06-02T08:53:47Z","citation":{"short":"K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019).","mla":"Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4, 20, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3339984\">10.1145/3339984</a>.","ista":"Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.","apa":"Chatterjee, K., Fu, H., &#38; Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/3339984\">https://doi.org/10.1145/3339984</a>","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. <i>ACM Transactions on Programming Languages and Systems</i>. 2019;41(4). doi:<a href=\"https://doi.org/10.1145/3339984\">10.1145/3339984</a>","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3339984\">https://doi.org/10.1145/3339984</a>.","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4. ACM, 2019."},"year":"2019","language":[{"iso":"eng"}],"month":"10","article_number":"20","oa_version":"Preprint","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"publication":"ACM Transactions on Programming Languages and Systems","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","related_material":{"record":[{"id":"639","relation":"earlier_version","status":"public"},{"status":"public","relation":"dissertation_contains","id":"8934"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1705.00317","open_access":"1"}],"oa":1,"date_published":"2019-10-01T00:00:00Z","type":"journal_article"},{"article_type":"original","publisher":"ACM","file_date_updated":"2020-10-08T12:58:10Z","ec_funded":1,"quality_controlled":"1","intvolume":"        41","title":"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth","article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2019-12-09T08:33:33Z","publication_status":"published","issue":"4","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"},{"full_name":"Goyal, Prateesh","last_name":"Goyal","first_name":"Prateesh"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"},{"last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","_id":"7158","ddc":["000"],"volume":41,"abstract":[{"lang":"eng","text":"Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth.\r\n\r\nOur main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches.\r\n"}],"day":"01","doi":"10.1145/3363525","external_id":{"isi":["000564108400004"]},"isi":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4, 23, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>.","short":"K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).","ista":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.","ama":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. 2019;41(4). doi:<a href=\"https://doi.org/10.1145/3363525\">10.1145/3363525</a>","apa":"Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. <i>ACM Transactions on Programming Languages and Systems</i>. ACM. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>","ieee":"K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” <i>ACM Transactions on Programming Languages and Systems</i>, vol. 41, no. 4. ACM, 2019.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” <i>ACM Transactions on Programming Languages and Systems</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3363525\">https://doi.org/10.1145/3363525</a>."},"year":"2019","date_updated":"2024-03-25T23:30:19Z","language":[{"iso":"eng"}],"article_number":"23","month":"11","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","has_accepted_license":"1","publication":"ACM Transactions on Programming Languages and Systems","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"file":[{"success":1,"access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"8632","file_size":667357,"checksum":"291cc86a07bd010d4815e177dac57b70","date_created":"2020-10-08T12:58:10Z","file_name":"2019_ACMTransactions_Chatterjee.pdf","content_type":"application/pdf","date_updated":"2020-10-08T12:58:10Z"}],"oa":1,"publication_identifier":{"issn":["0164-0925"]},"type":"journal_article","date_published":"2019-11-01T00:00:00Z"},{"date_published":"2019-10-21T00:00:00Z","type":"conference","oa":1,"publication_identifier":{"isbn":["9783030317836"],"eissn":["16113349"],"issn":["03029743"]},"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"url":"https://arxiv.org/abs/1907.11010","open_access":"1"}],"publication":"International Symposium on Automated Technology for Verification and Analysis","month":"10","oa_version":"Preprint","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2019-10-31","location":"Taipei, Taiwan","start_date":"2019-10-28","name":"ATVA: Automated TEchnology for Verification and Analysis"},"isi":1,"external_id":{"isi":["000723515700027"],"arxiv":["1907.11010"]},"date_updated":"2023-09-06T12:40:58Z","citation":{"apa":"Brázdil, T., Chatterjee, K., Kucera, A., Novotný, P., &#38; Velan, D. (2019). Deciding fast termination for probabilistic VASS with nondeterminism. In <i>International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 11781, pp. 462–478). Taipei, Taiwan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-31784-3_27\">https://doi.org/10.1007/978-3-030-31784-3_27</a>","ama":"Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. Deciding fast termination for probabilistic VASS with nondeterminism. In: <i>International Symposium on Automated Technology for Verification and Analysis</i>. Vol 11781. Springer Nature; 2019:462-478. doi:<a href=\"https://doi.org/10.1007/978-3-030-31784-3_27\">10.1007/978-3-030-31784-3_27</a>","chicago":"Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” In <i>International Symposium on Automated Technology for Verification and Analysis</i>, 11781:462–78. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31784-3_27\">https://doi.org/10.1007/978-3-030-31784-3_27</a>.","ieee":"T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, and D. Velan, “Deciding fast termination for probabilistic VASS with nondeterminism,” in <i>International Symposium on Automated Technology for Verification and Analysis</i>, Taipei, Taiwan, 2019, vol. 11781, pp. 462–478.","mla":"Brázdil, Tomás, et al. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.” <i>International Symposium on Automated Technology for Verification and Analysis</i>, vol. 11781, Springer Nature, 2019, pp. 462–78, doi:<a href=\"https://doi.org/10.1007/978-3-030-31784-3_27\">10.1007/978-3-030-31784-3_27</a>.","short":"T. Brázdil, K. Chatterjee, A. Kucera, P. Novotný, D. Velan, in:, International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2019, pp. 462–478.","ista":"Brázdil T, Chatterjee K, Kucera A, Novotný P, Velan D. 2019. Deciding fast termination for probabilistic VASS with nondeterminism. International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated TEchnology for Verification and Analysis, LNCS, vol. 11781, 462–478."},"year":"2019","abstract":[{"text":"A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented during each state transition, blocking any behaviour that would cause a counter to decrease below zero. The pVASS can be used as abstractions of probabilistic programs with many decidable properties. The use of pVASS as abstractions requires the presence of nondeterminism in the model. In this paper, we develop techniques for checking fast termination of pVASS with nondeterminism. That is, for every initial configuration of size n, we consider the worst expected number of transitions needed to reach a configuration with some counter negative (the expected termination time). We show that the problem whether the asymptotic expected termination time is linear is decidable in polynomial time for a certain natural class of pVASS with nondeterminism. Furthermore, we show the following dichotomy: if the asymptotic expected termination time is not linear, then it is at least quadratic, i.e., in Ω(n2).","lang":"eng"}],"arxiv":1,"doi":"10.1007/978-3-030-31784-3_27","day":"21","volume":11781,"author":[{"first_name":"Tomás","last_name":"Brázdil","full_name":"Brázdil, Tomás"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Kucera, Antonín","last_name":"Kucera","first_name":"Antonín"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr"},{"full_name":"Velan, Dominik","last_name":"Velan","first_name":"Dominik"}],"_id":"7183","scopus_import":"1","title":"Deciding fast termination for probabilistic VASS with nondeterminism","alternative_title":["LNCS"],"intvolume":"     11781","publication_status":"published","date_created":"2019-12-15T23:00:44Z","department":[{"_id":"KrCh"}],"article_processing_charge":"No","page":"462-478","quality_controlled":"1","publisher":"Springer Nature"},{"file":[{"date_updated":"2020-07-14T12:47:53Z","content_type":"application/pdf","file_name":"2019_CommBio_Tkadlec.pdf","date_created":"2019-12-23T13:39:30Z","file_size":1670274,"checksum":"d1a69bfe73767e4246f0a38e4e1554dd","file_id":"7211","creator":"dernst","relation":"main_file","access_level":"open_access"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"7196","status":"public"}]},"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_identifier":{"issn":["2399-3642"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"journal_article","date_published":"2019-04-23T00:00:00Z","language":[{"iso":"eng"}],"project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Published Version","article_number":"138","month":"04","has_accepted_license":"1","publication":"Communications Biology","volume":2,"ddc":["000"],"day":"23","doi":"10.1038/s42003-019-0373-y","abstract":[{"lang":"eng","text":"The rate of biological evolution depends on the fixation probability and on the fixation time of new mutants. Intensive research has focused on identifying population structures that augment the fixation probability of advantageous mutants. But these amplifiers of natural selection typically increase fixation time. Here we study population structures that achieve a tradeoff between fixation probability and time. First, we show that no amplifiers can have an asymptotically lower absorption time than the well-mixed population. Then we design population structures that substantially augment the fixation probability with just a minor increase in fixation time. Finally, we show that those structures enable higher effective rate of evolution than the well-mixed population provided that the rate of generating advantageous mutants is relatively low. Our work sheds light on how population structure affects the rate of evolution. Moreover, our structures could be useful for lab-based, medical, or industrial applications of evolutionary optimization."}],"year":"2019","citation":{"mla":"Tkadlec, Josef, et al. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” <i>Communications Biology</i>, vol. 2, 138, Springer Nature, 2019, doi:<a href=\"https://doi.org/10.1038/s42003-019-0373-y\">10.1038/s42003-019-0373-y</a>.","short":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Communications Biology 2 (2019).","ista":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2019. Population structure determines the tradeoff between fixation probability and fixation time. Communications Biology. 2, 138.","ama":"Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Population structure determines the tradeoff between fixation probability and fixation time. <i>Communications Biology</i>. 2019;2. doi:<a href=\"https://doi.org/10.1038/s42003-019-0373-y\">10.1038/s42003-019-0373-y</a>","apa":"Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &#38; Nowak, M. A. (2019). Population structure determines the tradeoff between fixation probability and fixation time. <i>Communications Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42003-019-0373-y\">https://doi.org/10.1038/s42003-019-0373-y</a>","chicago":"Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.” <i>Communications Biology</i>. Springer Nature, 2019. <a href=\"https://doi.org/10.1038/s42003-019-0373-y\">https://doi.org/10.1038/s42003-019-0373-y</a>.","ieee":"J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Population structure determines the tradeoff between fixation probability and fixation time,” <i>Communications Biology</i>, vol. 2. Springer Nature, 2019."},"date_updated":"2023-09-07T13:19:22Z","external_id":{"pmid":["31044163"],"isi":["000465425700006"]},"isi":1,"publisher":"Springer Nature","article_type":"original","quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:47:53Z","date_created":"2019-12-23T13:36:50Z","article_processing_charge":"No","department":[{"_id":"KrCh"}],"publication_status":"published","intvolume":"         2","title":"Population structure determines the tradeoff between fixation probability and fixation time","scopus_import":"1","_id":"7210","pmid":1,"author":[{"orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nowak","first_name":"Martin A.","full_name":"Nowak, Martin A."}]},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1802.03642"}],"status":"public","related_material":{"record":[{"status":"public","id":"11402","relation":"later_version"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"conference","date_published":"2019-06-01T00:00:00Z","publication_identifier":{"isbn":["9781728136080"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2019-06-27","location":"Vancouver, BC, Canada","start_date":"2019-06-24","name":"LICS: Symposium on Logic in Computer Science"},"publication":"34th Annual ACM/IEEE Symposium on Logic in Computer Science","oa_version":"Preprint","month":"06","citation":{"apa":"Chatterjee, K., &#38; Doyen, L. (2019). Graph planning with expected finite horizon. In <i>34th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 1–13). Vancouver, BC, Canada: IEEE. <a href=\"https://doi.org/10.1109/lics.2019.8785706\">https://doi.org/10.1109/lics.2019.8785706</a>","ama":"Chatterjee K, Doyen L. Graph planning with expected finite horizon. In: <i>34th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2019:1-13. doi:<a href=\"https://doi.org/10.1109/lics.2019.8785706\">10.1109/lics.2019.8785706</a>","ieee":"K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” in <i>34th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Vancouver, BC, Canada, 2019, pp. 1–13.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” In <i>34th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 1–13. IEEE, 2019. <a href=\"https://doi.org/10.1109/lics.2019.8785706\">https://doi.org/10.1109/lics.2019.8785706</a>.","short":"K. Chatterjee, L. Doyen, in:, 34th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2019, pp. 1–13.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” <i>34th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, IEEE, 2019, pp. 1–13, doi:<a href=\"https://doi.org/10.1109/lics.2019.8785706\">10.1109/lics.2019.8785706</a>.","ista":"Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon. 34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 1–13."},"year":"2019","date_updated":"2025-07-14T09:09:54Z","external_id":{"isi":["000805002800001"],"arxiv":["1802.03642"]},"isi":1,"day":"01","doi":"10.1109/lics.2019.8785706","arxiv":1,"abstract":[{"text":"Graph planning gives rise to fundamental algorithmic questions such as shortest path, traveling salesman problem, etc. A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary, to represent the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time. Consequently, our polynomial-time algorithm for adversarial stopping time also computes an optimal plan among all possible plans.","lang":"eng"}],"quality_controlled":"1","page":"1-13","publisher":"IEEE","scopus_import":"1","_id":"7402","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"department":[{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2020-01-29T16:18:33Z","publication_status":"published","title":"Graph planning with expected finite horizon"},{"abstract":[{"text":"We study the termination problem for nondeterministic probabilistic programs. We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded. First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic programs. For nondeterministic probabilistic programs a previous result claimed that RSMs are not complete for bounded termination, whereas our result corrects the previous flaw and establishes completeness with a rigorous proof. Second, we present the first sound approach to establish lower bounds on expected termination time through RSMs.","lang":"eng"}],"day":"11","doi":"10.1007/978-3-030-11245-5_22","arxiv":1,"external_id":{"arxiv":["1701.02944"],"isi":["000931943000022"]},"isi":1,"citation":{"ista":"Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490.","mla":"Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i>, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:<a href=\"https://doi.org/10.1007/978-3-030-11245-5_22\">10.1007/978-3-030-11245-5_22</a>.","short":"H. Fu, K. Chatterjee, in:, International Conference on Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 468–490.","ieee":"H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” in <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i>, Cascais, Portugal, 2019, vol. 11388, pp. 468–490.","chicago":"Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” In <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i>, 11388:468–90. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-11245-5_22\">https://doi.org/10.1007/978-3-030-11245-5_22</a>.","apa":"Fu, H., &#38; Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i> (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-11245-5_22\">https://doi.org/10.1007/978-3-030-11245-5_22</a>","ama":"Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs. In: <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i>. Vol 11388. Springer Nature; 2019:468-490. doi:<a href=\"https://doi.org/10.1007/978-3-030-11245-5_22\">10.1007/978-3-030-11245-5_22</a>"},"year":"2019","date_updated":"2025-06-02T08:53:41Z","volume":11388,"intvolume":"     11388","alternative_title":["LNCS"],"title":"Termination of nondeterministic probabilistic programs","date_created":"2019-02-10T22:59:17Z","department":[{"_id":"KrCh"}],"article_processing_charge":"No","publication_status":"published","author":[{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","_id":"5948","publisher":"Springer Nature","quality_controlled":"1","page":"468-490","type":"conference","date_published":"2019-01-11T00:00:00Z","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","main_file_link":[{"url":"https://arxiv.org/abs/1701.02944"}],"month":"01","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"oa_version":"Preprint","publication":"International Conference on Verification, Model Checking, and Abstract Interpretation","conference":{"name":"VMCAI: Verification, Model Checking, and Abstract Interpretation","start_date":"2019-01-13","location":"Cascais, Portugal","end_date":"2019-01-15"},"language":[{"iso":"eng"}]},{"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1902.07986","open_access":"1"}],"oa":1,"type":"conference","date_published":"2019-05-01T00:00:00Z","conference":{"start_date":"2019-05-14","name":"IEEE International Conference on Blockchain and Cryptocurrency","end_date":"2019-05-17","location":"Seoul, Korea"},"language":[{"iso":"eng"}],"article_number":"8751326","month":"05","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"oa_version":"Preprint","publication":"IEEE International Conference on Blockchain and Cryptocurrency","abstract":[{"lang":"eng","text":"In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs."}],"day":"01","doi":"10.1109/BLOC.2019.8751326","arxiv":1,"external_id":{"arxiv":["1902.07986"]},"citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">https://doi.org/10.1109/BLOC.2019.8751326</a>.","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in <i>IEEE International Conference on Blockchain and Cryptocurrency</i>, Seoul, Korea, 2019.","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">10.1109/BLOC.2019.8751326</a>","apa":"Chatterjee, K., Goharshady, A. K., &#38; Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In <i>IEEE International Conference on Blockchain and Cryptocurrency</i>. Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">https://doi.org/10.1109/BLOC.2019.8751326</a>","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.","mla":"Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” <i>IEEE International Conference on Blockchain and Cryptocurrency</i>, 8751326, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/BLOC.2019.8751326\">10.1109/BLOC.2019.8751326</a>.","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019."},"year":"2019","date_updated":"2024-03-25T23:30:18Z","publisher":"IEEE","quality_controlled":"1","ec_funded":1,"title":"Probabilistic smart contracts: Secure randomness on the blockchain","department":[{"_id":"KrCh"}],"date_created":"2019-02-26T09:03:15Z","publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pourdamghani, Arash","first_name":"Arash","last_name":"Pourdamghani"}],"scopus_import":1,"_id":"6056"},{"has_accepted_license":"1","publication":"PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","month":"06","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","keyword":["Program Cost Analysis","Program Termination","Probabilistic Programs","Martingales"],"language":[{"iso":"eng"}],"conference":{"location":"Phoenix, AZ, United States","end_date":"2019-06-26","name":"PLDI: Conference on Programming Language Design and Implementation","start_date":"2019-06-22"},"type":"conference","date_published":"2019-06-08T00:00:00Z","oa":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5457"},{"status":"public","relation":"dissertation_contains","id":"8934"}]},"file":[{"creator":"akafshda","file_id":"6176","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"paper.pdf","date_updated":"2020-07-14T12:47:20Z","file_size":4051066,"checksum":"703a5e9b8c8587f2a44085ffd9a4db64","date_created":"2019-03-25T10:11:22Z"}],"author":[{"full_name":"Wang, Peixin","first_name":"Peixin","last_name":"Wang"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Amir Kafshdar","last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Xudong","last_name":"Qin","full_name":"Qin, Xudong"},{"last_name":"Shi","first_name":"Wenjun","full_name":"Shi, Wenjun"}],"scopus_import":"1","_id":"6175","title":"Cost analysis of nondeterministic probabilistic programs","department":[{"_id":"KrCh"}],"date_created":"2019-03-25T10:13:25Z","article_processing_charge":"No","publication_status":"published","file_date_updated":"2020-07-14T12:47:20Z","ec_funded":1,"quality_controlled":"1","page":"204-220","publisher":"Association for Computing Machinery","external_id":{"arxiv":["1902.04659"],"isi":["000523190300014"]},"isi":1,"year":"2019","citation":{"apa":"Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., &#38; Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>","ama":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2019:204-220. doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>","chicago":"Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 204–20. Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3314221.3314581\">https://doi.org/10.1145/3314221.3314581</a>.","ieee":"P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Phoenix, AZ, United States, 2019, pp. 204–220.","short":"P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220.","mla":"Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” <i>PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2019, pp. 204–20, doi:<a href=\"https://doi.org/10.1145/3314221.3314581\">10.1145/3314221.3314581</a>.","ista":"Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220."},"date_updated":"2025-06-02T08:53:45Z","abstract":[{"lang":"eng","text":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds."}],"day":"08","arxiv":1,"doi":"10.1145/3314221.3314581","ddc":["000"]},{"abstract":[{"text":"In today's cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner's chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.","lang":"eng"}],"doi":"10.1145/3297280.3297319","day":"01","isi":1,"external_id":{"isi":["000474685800049"]},"date_updated":"2025-06-02T08:53:46Z","citation":{"apa":"Chatterjee, K., Goharshady, A. K., &#38; Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i> (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. <a href=\"https://doi.org/10.1145/3297280.3297319\">https://doi.org/10.1145/3297280.3297319</a>","ama":"Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>. Vol Part F147772. ACM; 2019:374-381. doi:<a href=\"https://doi.org/10.1145/3297280.3297319\">10.1145/3297280.3297319</a>","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, Part F147772:374–81. ACM, 2019. <a href=\"https://doi.org/10.1145/3297280.3297319\">https://doi.org/10.1145/3297280.3297319</a>.","mla":"Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” <i>Proceedings of the 34th ACM Symposium on Applied Computing</i>, vol. Part F147772, ACM, 2019, pp. 374–81, doi:<a href=\"https://doi.org/10.1145/3297280.3297319\">10.1145/3297280.3297319</a>.","short":"K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.","ista":"Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381."},"year":"2019","ddc":["004"],"volume":"Part F147772","title":"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving","pubrep_id":"1069","publication_status":"published","department":[{"_id":"KrCh"}],"article_processing_charge":"No","date_created":"2019-05-06T12:11:36Z","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pourdamghani, Arash","last_name":"Pourdamghani","first_name":"Arash"}],"_id":"6378","scopus_import":"1","publisher":"ACM","file_date_updated":"2020-07-14T12:47:29Z","page":"374-381","ec_funded":1,"quality_controlled":"1","oa":1,"publication_identifier":{"isbn":["9781450359337"]},"date_published":"2019-04-01T00:00:00Z","type":"conference","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"status":"public","file":[{"content_type":"application/pdf","file_name":"2019_ACM_Chatterjee.pdf","date_updated":"2020-07-14T12:47:29Z","checksum":"fbfbcd5a0c7a743862bfc3045539a614","file_size":1023934,"date_created":"2019-05-06T12:09:27Z","creator":"dernst","file_id":"6379","relation":"main_file","access_level":"open_access"}],"month":"04","oa_version":"Submitted Version","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"publication":"Proceedings of the 34th ACM Symposium on Applied Computing","has_accepted_license":"1","conference":{"end_date":"2019-04-12","location":"Limassol, Cyprus","start_date":"2019-04-08","name":"ACM Symposium on Applied Computing"},"language":[{"iso":"eng"}]},{"file":[{"file_id":"6381","creator":"dernst","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:47:29Z","content_type":"application/pdf","file_name":"2019_ACM_POPL_Chatterjee.pdf","date_created":"2019-05-06T12:23:11Z","checksum":"c157752f96877b36685ad7063ada4524","file_size":1294962}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"8934","relation":"dissertation_contains","status":"public"}]},"status":"public","publication_identifier":{"issn":["2475-1421"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2019-01-01T00:00:00Z","type":"journal_article","language":[{"iso":"eng"}],"oa_version":"Published Version","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"month":"01","article_number":"53","publication":"Proceedings of the ACM on Programming Languages","has_accepted_license":"1","volume":3,"ddc":["004"],"doi":"10.1145/3290366","day":"01","abstract":[{"text":"There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. ","lang":"eng"}],"date_updated":"2024-03-25T23:30:18Z","year":"2019","citation":{"ama":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. <i>Proceedings of the ACM on Programming Languages</i>. 2019;3(POPL). doi:<a href=\"https://doi.org/10.1145/3290366\">10.1145/3290366</a>","apa":"Chatterjee, K., Goharshady, A. K., Okati, N., &#38; Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. <i>Proceedings of the ACM on Programming Languages</i>. ACM. <a href=\"https://doi.org/10.1145/3290366\">https://doi.org/10.1145/3290366</a>","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” <i>Proceedings of the ACM on Programming Languages</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3290366\">https://doi.org/10.1145/3290366</a>.","ieee":"K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 3, no. POPL. ACM, 2019.","mla":"Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 3, no. POPL, 53, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3290366\">10.1145/3290366</a>.","short":"K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019).","ista":"Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53."},"publisher":"ACM","quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:47:29Z","publication_status":"published","date_created":"2019-05-06T12:18:17Z","department":[{"_id":"KrCh"}],"title":"Efficient parameterized algorithms for data packing","pubrep_id":"1056","intvolume":"         3","_id":"6380","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Okati, Nastaran","first_name":"Nastaran","last_name":"Okati"},{"last_name":"Pavlogiannis","first_name":"Andreas","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"issue":"POPL"}]