[{"article_number":"31","language":[{"iso":"eng"}],"abstract":[{"text":"To achieve fast recovery from link failures, most modern communication networks feature fully\r\ndecentralized fast re-routing mechanisms. These re-routing mechanisms rely on pre-installed static re-routing rules at the nodes (the routers), which depend only on local failure information, namely on the failed links incident to the node. Ideally, a network is perfectly resilient: the re-routing rules ensure that packets are always successfully routed to their destinations as long as the source and the destination are still physically connected in the underlying network after the failures. Unfortunately, there are examples where achieving perfect resilience is not possible. Surprisingly, only very little is known about the algorithmic aspect of when and how perfect resilience can be achieved. We investigate the computational complexity of analyzing such local fast re-routing mechanisms. Our main result is a negative one: we show that even checking whether a given set of static re-routing rules ensures perfect resilience is coNP-complete. Additionally, we investigate other fundamental variations of the problem. In particular, we show that our coNP-completeness proof also applies to scenarios where the re-routing rules have specific patterns (known as skipping in the literature). On the positive side, for scenarios where nodes do not have information about the link from which a packet arrived (the so-called in-port), we present a linear-time algorithm to realize perfect resilience whenever possible (which we show can also be determined in linear time). ","lang":"eng"}],"OA_place":"publisher","doi":"10.4230/LIPIcs.OPODIS.2025.31","conference":{"name":"OPODIS: Conference on Principles of Distributed Systems","start_date":"2025-12-03","end_date":"2025-12-05","location":"Iaşi, Romania"},"date_updated":"2026-03-09T12:36:11Z","_id":"21411","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"author":[{"full_name":"Bentert, Matthias","first_name":"Matthias","last_name":"Bentert"},{"last_name":"Ceylan","first_name":"Esra","full_name":"Ceylan, Esra"},{"first_name":"Valentin","full_name":"Hübner, Valentin","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","orcid":"0009-0001-5009-4987","last_name":"Hübner"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"first_name":"Jiří","full_name":"Srba, Jiří","last_name":"Srba"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","day":"07","fulldoi":"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"volume":361,"date_published":"2026-01-07T00:00:00Z","acknowledgement":"Matthias Bentert: ERC Horizon 2020 research and innovation programme (grant agreement\r\nNo. 819416) and ERC Consolidator grant AdjustNet (agreement No. 864228).\r\nEsra Ceylan: German Research Foundation (DFG) project ReNO, Schwerpunktprogramm:\r\nResilienz in Vernetzten Welten – Beherrschen von Fehlern, Überlast, Angriffen und dem\r\nUnbekannten (SPP 2378).\r\nStefan Schmid: German Research Foundation (DFG) project ReNO, Schwerpunktprogramm:\r\nResilienz in Vernetzten Welten – Beherrschen von Fehlern, Überlast, Angriffen und dem\r\nUnbekannten (SPP 2378).","department":[{"_id":"KrCh"}],"ddc":["000"],"title":"Fast re-routing in networks: On the complexity of perfect resilience","month":"01","date_created":"2026-03-08T23:01:46Z","publication_identifier":{"isbn":["9783959774093"],"eissn":["1868-8969"]},"publication_status":"published","file":[{"file_name":"2026_OPODIS_Bentert.pdf","relation":"main_file","date_created":"2026-03-09T12:33:58Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2026-03-09T12:33:58Z","file_size":1041334,"creator":"dernst","success":1,"file_id":"21419","checksum":"a7af114da7c38d2338b4edb922eb27f1"}],"file_date_updated":"2026-03-09T12:33:58Z","year":"2026","article_processing_charge":"No","publication":"29th International Conference on Principles of Distributed Systems","quality_controlled":"1","scopus_import":"1","alternative_title":["LIPIcs"],"has_accepted_license":"1","intvolume":"       361","OA_type":"gold","status":"public","citation":{"ieee":"M. Bentert, E. Ceylan, V. Hübner, S. Schmid, and J. Srba, “Fast re-routing in networks: On the complexity of perfect resilience,” in <i>29th International Conference on Principles of Distributed Systems</i>, Iaşi, Romania, 2026, vol. 361.","mla":"Bentert, Matthias, et al. “Fast Re-Routing in Networks: On the Complexity of Perfect Resilience.” <i>29th International Conference on Principles of Distributed Systems</i>, vol. 361, 31, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31\">10.4230/LIPIcs.OPODIS.2025.31</a>.","ista":"Bentert M, Ceylan E, Hübner V, Schmid S, Srba J. 2026. Fast re-routing in networks: On the complexity of perfect resilience. 29th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 361, 31.","apa":"Bentert, M., Ceylan, E., Hübner, V., Schmid, S., &#38; Srba, J. (2026). Fast re-routing in networks: On the complexity of perfect resilience. In <i>29th International Conference on Principles of Distributed Systems</i> (Vol. 361). Iaşi, Romania: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2025.31</a>","ama":"Bentert M, Ceylan E, Hübner V, Schmid S, Srba J. Fast re-routing in networks: On the complexity of perfect resilience. In: <i>29th International Conference on Principles of Distributed Systems</i>. Vol 361. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31\">10.4230/LIPIcs.OPODIS.2025.31</a>","chicago":"Bentert, Matthias, Esra Ceylan, Valentin Hübner, Stefan Schmid, and Jiří Srba. “Fast Re-Routing in Networks: On the Complexity of Perfect Resilience.” In <i>29th International Conference on Principles of Distributed Systems</i>, Vol. 361. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2025.31</a>.","short":"M. Bentert, E. Ceylan, V. Hübner, S. Schmid, J. Srba, in:, 29th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026."},"type":"conference"},{"ec_funded":1,"doi":"10.1007/s13235-025-00627-5","abstract":[{"lang":"eng","text":"The public goods game is among the most studied metaphors of cooperation in groups. In this game, individuals can use their endowments to make contributions towards a good that benefits everyone. Each individual, however, is tempted to free-ride on the contributions of others. Herein, we study repeated public goods games among asymmetric players. Previous work has explored to which extent asymmetry allows for full cooperation, such that players contribute their full endowment each round. However, by design that work focusses on equilibria where individuals make the same contribution each round. Instead, here we consider players whose contributions along the equilibrium path can change from one round to the next. We do so for three different models – one without any budget constraints, one with endowment constraints, and one in which individuals can save their current endowment to be used in subsequent rounds. In each case, we explore two key quantities: the welfare and the resource efficiency that can be achieved in equilibrium. Welfare corresponds to the sum of all players’ payoffs. Resource efficiency relates this welfare to the total contributions made by the players. Compared to constant contribution sequences, we find that time-dependent contributions can improve resource efficiency across all three models. Moreover, they can improve the players’ welfare in the model with savings."}],"language":[{"iso":"eng"}],"OA_place":"publisher","author":[{"last_name":"Hübner","orcid":"0009-0001-5009-4987","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","full_name":"Hübner, Valentin","first_name":"Valentin"},{"last_name":"Hilbe","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X"},{"first_name":"Manuel","full_name":"Staab, Manuel","last_name":"Staab"},{"last_name":"Kleshnina","first_name":"Maria","full_name":"Kleshnina, Maria","id":"4E21749C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5518-8317"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"_id":"19074","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-04-07T12:30:56Z","publisher":"Springer Nature","fulldoi":"https://doi.org/10.1007/s13235-025-00627-5","day":"01","oa_version":"Published Version","volume":15,"oa":1,"page":"1617-1645","external_id":{"isi":["001415587800001"]},"month":"11","date_published":"2025-11-01T00:00:00Z","title":"Time-dependent strategies in repeated asymmetric public goods games","ddc":["000"],"acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement #754411 and the French Agence Nationale de la Recherche (under the Investissement d’Avenir programme, ANR-17-EURE-0010), and ARC SRIEAS Grant SR200100005 Securing Antarctica’s Environmental Future (to M.K.). Open access funding provided by Institute of Science and Technology (IST Austria).","department":[{"_id":"KrCh"}],"year":"2025","corr_author":"1","article_type":"original","file_date_updated":"2025-12-30T08:01:35Z","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["2153-0785"],"eissn":["2153-0793"]},"file":[{"creator":"dernst","success":1,"file_id":"20888","checksum":"de0a412cbb7d98bf5e6a551c26acbefa","file_name":"2025_DynGamesAppl_Huebner.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2025-12-30T08:01:35Z","access_level":"open_access","date_created":"2025-12-30T08:01:35Z","file_size":1126178}],"publication_status":"published","related_material":{"record":[{"id":"19903","relation":"dissertation_contains","status":"public"}]},"date_created":"2025-02-23T23:01:57Z","intvolume":"        15","has_accepted_license":"1","OA_type":"hybrid","scopus_import":"1","quality_controlled":"1","project":[{"call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}],"publication":"Dynamic Games and Applications","isi":1,"type":"journal_article","PlanS_conform":"1","status":"public","citation":{"chicago":"Hübner, Valentin, Christian Hilbe, Manuel Staab, Maria Kleshnina, and Krishnendu Chatterjee. “Time-Dependent Strategies in Repeated Asymmetric Public Goods Games.” <i>Dynamic Games and Applications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s13235-025-00627-5\">https://doi.org/10.1007/s13235-025-00627-5</a>.","short":"V. Hübner, C. Hilbe, M. Staab, M. Kleshnina, K. Chatterjee, Dynamic Games and Applications 15 (2025) 1617–1645.","apa":"Hübner, V., Hilbe, C., Staab, M., Kleshnina, M., &#38; Chatterjee, K. (2025). Time-dependent strategies in repeated asymmetric public goods games. <i>Dynamic Games and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s13235-025-00627-5\">https://doi.org/10.1007/s13235-025-00627-5</a>","ama":"Hübner V, Hilbe C, Staab M, Kleshnina M, Chatterjee K. Time-dependent strategies in repeated asymmetric public goods games. <i>Dynamic Games and Applications</i>. 2025;15:1617-1645. doi:<a href=\"https://doi.org/10.1007/s13235-025-00627-5\">10.1007/s13235-025-00627-5</a>","ieee":"V. Hübner, C. Hilbe, M. Staab, M. Kleshnina, and K. Chatterjee, “Time-dependent strategies in repeated asymmetric public goods games,” <i>Dynamic Games and Applications</i>, vol. 15. Springer Nature, pp. 1617–1645, 2025.","ista":"Hübner V, Hilbe C, Staab M, Kleshnina M, Chatterjee K. 2025. Time-dependent strategies in repeated asymmetric public goods games. Dynamic Games and Applications. 15, 1617–1645.","mla":"Hübner, Valentin, et al. “Time-Dependent Strategies in Repeated Asymmetric Public Goods Games.” <i>Dynamic Games and Applications</i>, vol. 15, Springer Nature, 2025, pp. 1617–45, doi:<a href=\"https://doi.org/10.1007/s13235-025-00627-5\">10.1007/s13235-025-00627-5</a>."}},{"month":"05","department":[{"_id":"KrCh"}],"DOAJ_listed":"1","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.).","title":"Stable strategies of direct and indirect reciprocity across all social dilemmas","ddc":["000"],"date_published":"2025-05-01T00:00:00Z","article_processing_charge":"Yes","corr_author":"1","article_type":"original","file_date_updated":"2025-06-23T08:09:50Z","year":"2025","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"19903"}]},"pmid":1,"date_created":"2025-06-15T22:01:30Z","publication_identifier":{"eissn":["2752-6542"]},"publication_status":"published","file":[{"creator":"dernst","success":1,"file_id":"19867","checksum":"efd6648db3fc3ea0cdd7155d667e5f11","relation":"main_file","file_name":"2025_PNASNexus_Huebner.pdf","date_created":"2025-06-23T08:09:50Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2025-06-23T08:09:50Z","file_size":2551195}],"OA_type":"gold","has_accepted_license":"1","intvolume":"         4","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818"}],"quality_controlled":"1","publication":"PNAS Nexus","issue":"5","scopus_import":"1","type":"journal_article","citation":{"ieee":"V. Hübner, L. Schmid, C. Hilbe, and K. Chatterjee, “Stable strategies of direct and indirect reciprocity across all social dilemmas,” <i>PNAS Nexus</i>, vol. 4, no. 5. Oxford University Press, 2025.","mla":"Hübner, Valentin, et al. “Stable Strategies of Direct and Indirect Reciprocity across All Social Dilemmas.” <i>PNAS Nexus</i>, vol. 4, no. 5, pgaf154, Oxford University Press, 2025, doi:<a href=\"https://doi.org/10.1093/pnasnexus/pgaf154\">10.1093/pnasnexus/pgaf154</a>.","ista":"Hübner V, Schmid L, Hilbe C, Chatterjee K. 2025. Stable strategies of direct and indirect reciprocity across all social dilemmas. PNAS Nexus. 4(5), pgaf154.","apa":"Hübner, V., Schmid, L., Hilbe, C., &#38; Chatterjee, K. (2025). Stable strategies of direct and indirect reciprocity across all social dilemmas. <i>PNAS Nexus</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/pnasnexus/pgaf154\">https://doi.org/10.1093/pnasnexus/pgaf154</a>","ama":"Hübner V, Schmid L, Hilbe C, Chatterjee K. Stable strategies of direct and indirect reciprocity across all social dilemmas. <i>PNAS Nexus</i>. 2025;4(5). doi:<a href=\"https://doi.org/10.1093/pnasnexus/pgaf154\">10.1093/pnasnexus/pgaf154</a>","short":"V. Hübner, L. Schmid, C. Hilbe, K. Chatterjee, PNAS Nexus 4 (2025).","chicago":"Hübner, Valentin, Laura Schmid, Christian Hilbe, and Krishnendu Chatterjee. “Stable Strategies of Direct and Indirect Reciprocity across All Social Dilemmas.” <i>PNAS Nexus</i>. Oxford University Press, 2025. <a href=\"https://doi.org/10.1093/pnasnexus/pgaf154\">https://doi.org/10.1093/pnasnexus/pgaf154</a>."},"status":"public","doi":"10.1093/pnasnexus/pgaf154","ec_funded":1,"OA_place":"publisher","article_number":"pgaf154","language":[{"iso":"eng"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","abstract":[{"text":"Social dilemmas are collective-action problems where individual interests are at odds with group interests. Such dilemmas occur frequently at all scales of human interactions. When dealing with collective-action problems, people often act reciprocally. They adjust their behavior to match the previous behavior of the recipient. The literature distinguishes two kinds of reciprocity. According to direct reciprocity, individuals react to their immediate experiences with the recipient. They are more likely to cooperate if the recipient previously cooperated with them. According to indirect reciprocity, individuals react to the recipient’s general behavior, irrespectively of whether or not they benefited directly. In practice, the two kinds of reciprocity are often intertwined; people typically base their decisions on both direct experiences and indirect observations. Yet only recently have researchers begun to explore how the two kinds of reciprocity interact. So far, this research only addresses a single type of social dilemma, the donation game, where the effects of individual behaviors are independent. Instead, here we allow for all pairwise social dilemmas. By applying novel techniques to generalize the theory of zero-determinant strategies, we establish an important proof of principle: In all social dilemmas, socially optimal outcomes can be sustained as an equilibrium, using either direct or indirect reciprocity, or arbitrary mixtures thereof. These results neither require games to be repeated infinitely often, nor that individual opinions are synchronized. In this way, we considerably generalize the scope of models of reciprocity, and we build further bridges between the literatures on direct and indirect reciprocity.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Hübner","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","full_name":"Hübner, Valentin","orcid":"0009-0001-5009-4987","first_name":"Valentin"},{"last_name":"Schmid","first_name":"Laura","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","full_name":"Schmid, Laura"},{"last_name":"Hilbe","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"}],"tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"_id":"19843","date_updated":"2026-04-07T12:30:56Z","publisher":"Oxford University Press","fulldoi":"https://doi.org/10.1093/pnasnexus/pgaf154","oa_version":"Published Version","day":"01","volume":4,"external_id":{"pmid":["40417077"]},"oa":1},{"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"19843"},{"relation":"part_of_dissertation","status":"public","id":"15083"},{"status":"public","relation":"part_of_dissertation","id":"19074"}]},"date_created":"2025-06-25T13:50:10Z","publication_status":"published","file":[{"file_size":6192760,"file_name":"Thesis Valentin Hübner source.tar.xz","relation":"source_file","date_updated":"2025-06-25T13:38:07Z","content_type":"application/x-xz","access_level":"closed","date_created":"2025-06-25T13:38:07Z","checksum":"794c02f8c82ca59ba6dda3bd7eed871a","creator":"vhuebner","file_id":"19905"},{"file_id":"19976","creator":"vhuebner","checksum":"ac56063d81c81e40322b6ff5a8c4912e","date_created":"2025-07-09T13:37:00Z","access_level":"open_access","date_updated":"2025-07-09T13:37:00Z","content_type":"application/pdf","relation":"main_file","file_name":"Thesis Valentin Hübner.pdf","file_size":4837864}],"publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","file_date_updated":"2025-07-09T13:37:00Z","corr_author":"1","year":"2025","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"acknowledgement":"The research for this thesis was supported by the European Research Council\r\n(grant agreements No. 863818 and No. 850529), the European Union’s Horizon 2020 research and innovation programme (Marie Skłodowska-Curie grant agreement No. 754411),\r\nthe Austrian Science Fund (grant DOI 10.55776/COE12), the French Agence Nationale\r\nde la Recherche under the Programme d’investissements d’avenir (project reference 17-\r\nEURE-0010) and the Australian Government through the Australian Research Council\r\n(grant No. SR200100005, “Securing Antarctica’s Environmental Future”).","title":"Reciprocity and inequality in social dilemmas","ddc":["519"],"date_published":"2025-06-25T00:00:00Z","month":"06","citation":{"apa":"Hübner, V. (2025). <i>Reciprocity and inequality in social dilemmas</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19903\">https://doi.org/10.15479/AT-ISTA-19903</a>","ama":"Hübner V. Reciprocity and inequality in social dilemmas. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19903\">10.15479/AT-ISTA-19903</a>","ieee":"V. Hübner, “Reciprocity and inequality in social dilemmas,” Institute of Science and Technology Austria, 2025.","mla":"Hübner, Valentin. <i>Reciprocity and Inequality in Social Dilemmas</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19903\">10.15479/AT-ISTA-19903</a>.","ista":"Hübner V. 2025. Reciprocity and inequality in social dilemmas. Institute of Science and Technology Austria.","chicago":"Hübner, Valentin. “Reciprocity and Inequality in Social Dilemmas.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19903\">https://doi.org/10.15479/AT-ISTA-19903</a>.","short":"V. Hübner, Reciprocity and Inequality in Social Dilemmas, Institute of Science and Technology Austria, 2025."},"status":"public","type":"dissertation","alternative_title":["ISTA Thesis"],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"supervisor":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"has_accepted_license":"1","date_updated":"2026-04-07T12:30:57Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"_id":"19903","author":[{"last_name":"Hübner","first_name":"Valentin","orcid":"0009-0001-5009-4987","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","full_name":"Hübner, Valentin"}],"OA_place":"publisher","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Cooperation, that is, one person paying a cost for another's benefit, is a fundamental principle without which no form of society could exist. The extent to which humans cooperate with each other is also an essential feature that differentiates them from other animals. Cooperation occurs even in the absence of altruistic motivations, when it is selfishly incentivised by the expectation of a future reward. For example, many economic interactions are well described that way. This kind of cooperation requires that people exhibit reciprocal behaviour that acts as a mechanism that rewards cooperation.\r\nWith game-theoretic models, it is possible to formally study potential such mechanisms and under what conditions they can exist. This thesis contributes to this effort by analysing recently introduced models of cooperation that advance on previous work by taking into account the potential for pre-existing inequality among cooperating individuals as well as the different forms that reciprocity can take.\r\nIndividuals may differ both intrinsically, in their abilities, as well as extrinsically, in the amount of resources they have available. Allowing for such differences in a model of cooperation helps to understand how inequality affects the potential for, and outcomes of, cooperation among unequals. In this thesis, it is shown that in the presence of intrinsic inequality, a similar unequal distribution of resources can increase the potential for cooperation. This effect is stronger the smaller the group is in which cooperation takes place. It is also shown that under particular assumptions, if the unequal members of a group vary the size of their contributions to a cooperative effort over time, they can thereby increase their efficiency and improve the collective outcome.\r\nCooperative behaviour in a two-person interaction can be rewarded either by direct reciprocation whenever the same two people interact again, or indirectly by a third party who observed the interaction. In the latter case of indirect reciprocity, individuals are proximally rewarded by a good reputation, which ultimately translates to being rewarded with cooperative behaviour by others. This mechanism can enable selfishly motivated cooperation even in circumstances where individuals are unlikely to meet again, akin to how money facilitates trade. While these two forms of reciprocity have mostly been studied in isolation, this thesis analyses both direct and indirect reciprocity in a general model in order to compare their relative effectiveness under different circumstances. The contribution of this thesis is an extension of previous work regarding a specific kind of interaction, whose parameters allow for convenient mathematical analysis, to the most general set of possible interactions."}],"doi":"10.15479/AT-ISTA-19903","ec_funded":1,"page":"157","oa":1,"oa_version":"Published Version","day":"25","degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","fulldoi":"https://doi.org/10.15479/AT-ISTA-19903"},{"month":"03","date_published":"2024-03-05T00:00:00Z","title":"Efficiency and resilience of cooperation in asymmetric social dilemmas","ddc":["000"],"acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529: E-DIRECT (to C.H.), the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement #754411 and the French Agence Nationale de la Recherche (under the Investissement d’Avenir Programme, ANR-17-EURE-0010) (to M.K.).","department":[{"_id":"KrCh"}],"year":"2024","corr_author":"1","file_date_updated":"2024-03-12T13:12:22Z","article_type":"original","article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"publication_status":"published","file":[{"checksum":"068520e3efd4d008bb9177e8aedb7d22","file_id":"15109","creator":"dernst","success":1,"file_size":2203220,"content_type":"application/pdf","date_updated":"2024-03-12T13:12:22Z","date_created":"2024-03-12T13:12:22Z","access_level":"open_access","relation":"main_file","file_name":"2024_PNAS_Huebner.pdf"}],"pmid":1,"related_material":{"record":[{"id":"15108","status":"public","relation":"research_data"},{"status":"public","relation":"dissertation_contains","id":"19903"}],"link":[{"relation":"press_release","description":"News on ISTA Website","url":"https://ista.ac.at/en/news/what-math-tells-us-about-social-dilemmas/"}]},"date_created":"2024-03-05T09:18:49Z","has_accepted_license":"1","intvolume":"       121","OA_type":"hybrid","issue":"10","scopus_import":"1","publication":"Proceedings of the National Academy of Sciences of the United States of America","quality_controlled":"1","project":[{"grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"}],"type":"journal_article","isi":1,"APC_amount":"3041,76 EUR","status":"public","citation":{"short":"V. Hübner, M. Staab, C. Hilbe, K. Chatterjee, M. Kleshnina, Proceedings of the National Academy of Sciences of the United States of America 121 (2024).","chicago":"Hübner, Valentin, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2024. <a href=\"https://doi.org/10.1073/pnas.2315558121\">https://doi.org/10.1073/pnas.2315558121</a>.","apa":"Hübner, V., Staab, M., Hilbe, C., Chatterjee, K., &#38; Kleshnina, M. (2024). Efficiency and resilience of cooperation in asymmetric social dilemmas. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2315558121\">https://doi.org/10.1073/pnas.2315558121</a>","ama":"Hübner V, Staab M, Hilbe C, Chatterjee K, Kleshnina M. Efficiency and resilience of cooperation in asymmetric social dilemmas. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2024;121(10). doi:<a href=\"https://doi.org/10.1073/pnas.2315558121\">10.1073/pnas.2315558121</a>","ieee":"V. Hübner, M. Staab, C. Hilbe, K. Chatterjee, and M. Kleshnina, “Efficiency and resilience of cooperation in asymmetric social dilemmas,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 10. National Academy of Sciences, 2024.","ista":"Hübner V, Staab M, Hilbe C, Chatterjee K, Kleshnina M. 2024. Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences of the United States of America. 121(10), e2315558121.","mla":"Hübner, Valentin, et al. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 10, e2315558121, National Academy of Sciences, 2024, doi:<a href=\"https://doi.org/10.1073/pnas.2315558121\">10.1073/pnas.2315558121</a>."},"ec_funded":1,"doi":"10.1073/pnas.2315558121","abstract":[{"text":"Direct reciprocity is a powerful mechanism for cooperation in social dilemmas. The very logic of reciprocity, however, seems to require that individuals are symmetric, and that everyone has the same means to influence each others’ payoffs. Yet in many applications, individuals are asymmetric. Herein, we study the effect of asymmetry in linear public good games. Individuals may differ in their endowments (their ability to contribute to a public good) and in their productivities (how effective their contributions are). Given the individuals’ productivities, we ask which allocation of endowments is optimal for cooperation. To this end, we consider two notions of optimality. The first notion focuses on the resilience of cooperation. The respective endowment distribution ensures that full cooperation is feasible even under the most adverse conditions. The second notion focuses on efficiency. The corresponding endowment distribution maximizes group welfare. Using analytical methods, we fully characterize these two endowment distributions. This analysis reveals that both optimality notions favor some endowment inequality: More productive players ought to get higher endowments. Yet the two notions disagree on how unequal endowments are supposed to be. A focus on resilience results in less inequality. With additional simulations, we show that the optimal endowment allocation needs to account for both the resilience and the efficiency of cooperation.","lang":"eng"}],"language":[{"iso":"eng"}],"article_number":"e2315558121","OA_place":"publisher","_id":"15083","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"author":[{"last_name":"Hübner","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","full_name":"Hübner, Valentin","orcid":"0009-0001-5009-4987","first_name":"Valentin"},{"last_name":"Staab","full_name":"Staab, Manuel","first_name":"Manuel"},{"last_name":"Hilbe","first_name":"Christian","orcid":"0000-0001-5116-955X","full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Kleshnina","full_name":"Kleshnina, Maria","first_name":"Maria"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-04-07T12:30:56Z","publisher":"National Academy of Sciences","fulldoi":"https://doi.org/10.1073/pnas.2315558121","day":"05","oa_version":"Published Version","volume":121,"oa":1,"external_id":{"pmid":["38408249"],"isi":["001207786500004"]}},{"oa":1,"status":"public","citation":{"ama":"Hübner V, Kleshnina M. Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.” 2024. doi:<a href=\"https://doi.org/10.5281/ZENODO.10639167\">10.5281/ZENODO.10639167</a>","apa":"Hübner, V., &#38; Kleshnina, M. (2024). Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.” Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.10639167\">https://doi.org/10.5281/ZENODO.10639167</a>","ista":"Hübner V, Kleshnina M. 2024. Computer code for ‘Efficiency and resilience of cooperation in asymmetric social dilemmas’, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.10639167\">10.5281/ZENODO.10639167</a>.","mla":"Hübner, Valentin, and Maria Kleshnina. <i>Computer Code for “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.”</i> Zenodo, 2024, doi:<a href=\"https://doi.org/10.5281/ZENODO.10639167\">10.5281/ZENODO.10639167</a>.","ieee":"V. Hübner and M. Kleshnina, “Computer code for ‘Efficiency and resilience of cooperation in asymmetric social dilemmas.’” Zenodo, 2024.","chicago":"Hübner, Valentin, and Maria Kleshnina. “Computer Code for ‘Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.’” Zenodo, 2024. <a href=\"https://doi.org/10.5281/ZENODO.10639167\">https://doi.org/10.5281/ZENODO.10639167</a>.","short":"V. Hübner, M. Kleshnina, (2024)."},"type":"research_data_reference","day":"09","oa_version":"Published Version","has_accepted_license":"1","fulldoi":"https://doi.org/10.5281/ZENODO.10639167","publisher":"Zenodo","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"15083"}]},"date_created":"2024-03-12T13:02:58Z","date_updated":"2025-09-04T12:14:54Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"corr_author":"1","_id":"15108","author":[{"full_name":"Hübner, Valentin","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","orcid":"0009-0001-5009-4987","first_name":"Valentin","last_name":"Hübner"},{"full_name":"Kleshnina, Maria","first_name":"Maria","last_name":"Kleshnina"}],"year":"2024","main_file_link":[{"url":"https://10.5281/zenodo.10639167","open_access":"1"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2024-02-09T00:00:00Z","abstract":[{"lang":"eng","text":"in the research article \"Efficiency and resilience of cooperation in asymmetric social dilemmas\" (by Valentin Hübner, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina).\r\n\r\nWe used different implementations for the case of two and three players, both described below."}],"department":[{"_id":"KrCh"}],"title":"Computer code for \"Efficiency and resilience of cooperation in asymmetric social dilemmas\"","ddc":["000"],"month":"02","doi":"10.5281/ZENODO.10639167"}]