[{"date_created":"2024-06-03T07:43:15Z","doi":"10.1145/3661814.3662080","publication_status":"published","article_processing_charge":"No","publication_identifier":{"eissn":["1043-6871"],"isbn":["9798400706608"]},"oa_version":"Preprint","article_number":"6","external_id":{"arxiv":["2405.02479"],"isi":["001275042100006"]},"author":[{"first_name":"Ali","full_name":"Asadi, Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","first_name":"Jakub"},{"first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta"}],"abstract":[{"lang":"eng","text":"Turn-based discounted-sum games are two-player zero-sum games played on finite directed graphs. The vertices of the graph are partitioned between player 1 and player 2. Plays are infinite walks on the graph where the next vertex is decided by a player that owns the current vertex. Each edge is assigned an integer weight and the payoff of a play is the discounted-sum of the weights of the play. The goal of player 1 is to maximize the discounted-sum payoff against the adversarial player 2. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class and the existence of a polynomial-time algorithm is a major open question. Since breaking the general exponential barrier has been a challenging problem, faster parameterized algorithms have been considered. If the discount factor is expressed in unary, then discounted-sum games can be solved in polynomial time. However, if the discount factor is arbitrary (or expressed in binary), but the weights are in unary, none of the existing approaches yield a sub-exponential bound. Our main result is a new analysis technique for a classical algorithm (namely, the strategy iteration algorithm) that present a new runtime bound which is [EQUATION] for game graphs with n vertices and absolute weights of at most W. In particular, our result yields a deterministic sub-exponential bound for games with weights that are constant or represented in unary."}],"language":[{"iso":"eng"}],"isi":1,"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"39th Annual ACM/IEEE Symposium on Logic in Computer Science","citation":{"ama":"Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. Deterministic sub-exponential algorithm for discounted-sum games with unary weights. In: 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery; 2024. doi:10.1145/3661814.3662080","short":"A. Asadi, K. Chatterjee, J. Svoboda, R.J. Saona Urmeneta, in:, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Association for Computing Machinery, 2024.","ista":"Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. 2024. Deterministic sub-exponential algorithm for discounted-sum games with unary weights. 39th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Jakub Svoboda, and Raimundo J Saona Urmeneta. “Deterministic Sub-Exponential Algorithm for Discounted-Sum Games with Unary Weights.” In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery, 2024. https://doi.org/10.1145/3661814.3662080.","ieee":"A. Asadi, K. Chatterjee, J. Svoboda, and R. J. Saona Urmeneta, “Deterministic sub-exponential algorithm for discounted-sum games with unary weights,” in 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Tallinn, Estonia, 2024.","apa":"Asadi, A., Chatterjee, K., Svoboda, J., & Saona Urmeneta, R. J. (2024). Deterministic sub-exponential algorithm for discounted-sum games with unary weights. In 39th Annual ACM/IEEE Symposium on Logic in Computer Science. Tallinn, Estonia: Association for Computing Machinery. https://doi.org/10.1145/3661814.3662080","mla":"Asadi, Ali, et al. “Deterministic Sub-Exponential Algorithm for Discounted-Sum Games with Unary Weights.” 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 6, Association for Computing Machinery, 2024, doi:10.1145/3661814.3662080."},"oa":1,"date_published":"2024-07-08T00:00:00Z","das_tickbox":"0","month":"07","title":"Deterministic sub-exponential algorithm for discounted-sum games with unary weights","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.02479"}],"publisher":"Association for Computing Machinery","_id":"17098","supplementarymaterial":"no","quality_controlled":"1","researchdata_availability":"no","conference":{"start_date":"2024-07-08","name":"LICS: Logic in Computer Science","location":"Tallinn, Estonia","end_date":"2024-07-11"},"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.\r\n","department":[{"_id":"KrCh"}],"year":"2024","arxiv":1,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"ec_funded":1,"status":"public","type":"conference","scopus_import":"1","date_updated":"2026-10-15T09:51:23Z","day":"08","fulldoi":"https://doi.org/10.1145/3661814.3662080"},{"title":"MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.15593"}],"publisher":"Neural Information Processing Systems Foundation","_id":"19510","oa":1,"OA_place":"repository","date_published":"2024-12-20T00:00:00Z","month":"12","volume":37,"acknowledged_ssus":[{"_id":"CampIT"}],"language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"software","url":"https://github.com/IST-DASLab/MicroAdam"}]},"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"38th Conference on Neural Information Processing Systems","citation":{"ama":"Modoranu I-V, Safaryan M, Malinovsky G, et al. MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-0001","short":"I.-V. Modoranu, M. Safaryan, G. Malinovsky, E. Kurtic, T. Robert, P. Richtárik, D.-A. Alistarh, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","chicago":"Modoranu, Ionut-Vlad, Mher Safaryan, Grigory Malinovsky, Eldar Kurtic, Thomas Robert, Peter Richtárik, and Dan-Adrian Alistarh. “MICROADAM: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-0001.","ieee":"I.-V. Modoranu et al., “MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence,” in 38th Conference on Neural Information Processing Systems, 2024, vol. 37.","ista":"Modoranu I-V, Safaryan M, Malinovsky G, Kurtic E, Robert T, Richtárik P, Alistarh D-A. 2024. MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence. 38th Conference on Neural Information Processing Systems. , Advances in Neural Information Processing Systems, vol. 37.","mla":"Modoranu, Ionut-Vlad, et al. “MICROADAM: Accurate Adaptive Optimization with Low Space Overhead and Provable Convergence.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-0001.","apa":"Modoranu, I.-V., Safaryan, M., Malinovsky, G., Kurtic, E., Robert, T., Richtárik, P., & Alistarh, D.-A. (2024). MICROADAM: Accurate adaptive optimization with low space overhead and provable convergence. In 38th Conference on Neural Information Processing Systems (Vol. 37). Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-0001"},"intvolume":" 37","publication_status":"published","doi":"10.52202/079017-0001","article_processing_charge":"No","date_created":"2025-04-06T22:01:32Z","oa_version":"Preprint","publication_identifier":{"issn":["1049-5258"]},"external_id":{"arxiv":["2405.15593"]},"author":[{"id":"449f7a18-f128-11eb-9611-9b430c0c6333","full_name":"Modoranu, Ionut-Vlad","first_name":"Ionut-Vlad","last_name":"Modoranu"},{"id":"dd546b39-0804-11ed-9c55-ef075c39778d","first_name":"Mher","full_name":"Safaryan, Mher","last_name":"Safaryan"},{"full_name":"Malinovsky, Grigory","first_name":"Grigory","last_name":"Malinovsky"},{"id":"47beb3a5-07b5-11eb-9b87-b108ec578218","full_name":"Kurtic, Eldar","first_name":"Eldar","last_name":"Kurtic"},{"id":"de632733-1457-11f0-ae22-b5914b8c1c41","full_name":"Robert, Thomas","first_name":"Thomas","last_name":"Robert"},{"first_name":"Peter","full_name":"Richtárik, Peter","last_name":"Richtárik"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"abstract":[{"text":"We propose a new variant of the Adam optimizer [Kingma and Ba, 2014] called\r\nMICROADAM that specifically minimizes memory overheads, while maintaining\r\ntheoretical convergence guarantees. We achieve this by compressing the gradient\r\ninformation before it is fed into the optimizer state, thereby reducing its memory\r\nfootprint significantly. We control the resulting compression error via a novel\r\ninstance of the classical error feedback mechanism from distributed optimization [Seide et al., 2014, Alistarh et al., 2018, Karimireddy et al., 2019] in which\r\nthe error correction information is itself compressed to allow for practical memory\r\ngains. We prove that the resulting approach maintains theoretical convergence\r\nguarantees competitive to those of AMSGrad, while providing good practical performance. Specifically, we show that MICROADAM can be implemented efficiently\r\non GPUs: on both million-scale (BERT) and billion-scale (LLaMA) models, MICROADAM provides practical convergence competitive to that of the uncompressed\r\nAdam baseline, with lower memory usage and similar running time. Our code is\r\navailable at https://github.com/IST-DASLab/MicroAdam.","lang":"eng"}],"scopus_import":"1","date_updated":"2026-10-15T09:49:27Z","day":"20","fulldoi":"https://doi.org/10.52202/079017-0001","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"ec_funded":1,"alternative_title":["Advances in Neural Information Processing Systems"],"status":"public","type":"conference","department":[{"_id":"DaAl"}],"year":"2024","arxiv":1,"quality_controlled":"1","OA_type":"green","acknowledgement":"The authors thank Razvan Pascanu, Mahdi Nikdan and Soroush Tabesh for their valuable feedback, the IT department from Institute of Science and Technology Austria for the hardware support and Weights and Biases for the infrastructure to track all our experiments. Mher Safaryan has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No 101034413."},{"month":"11","volume":110,"oa":1,"date_published":"2024-11-15T00:00:00Z","das_tickbox":"0","OA_place":"repository","_id":"18654","supplementarymaterial":"yes","publisher":"American Physical Society","article_type":"letter_note","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2312.03080"}],"title":"Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study","external_id":{"isi":["001447562900001"],"arxiv":["2312.03080"]},"author":[{"last_name":"Sato","full_name":"Sato, Toshihiro","first_name":"Toshihiro"},{"first_name":"B. J.","full_name":"Ramshaw, B. J.","last_name":"Ramshaw"},{"orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","full_name":"Modic, Kimberly A","first_name":"Kimberly A","last_name":"Modic"},{"full_name":"Assaad, Fakher F.","first_name":"Fakher F.","last_name":"Assaad"}],"abstract":[{"lang":"eng","text":"We compute the rotational anisotropy of the free energy of 𝛼−RuCl3 in an external magnetic field. This quantity, known as the magnetotropic susceptibility, 𝑘, relates to the second derivative of the free energy with respect to the angle of rotation. We have used approximation-free, auxiliary-field quantum Monte Carlo simulations for a realistic model of 𝛼−RuCl3 and optimized the path integral to alleviate the negative sign problem. This allows us to reach temperatures down to 30K—an energy scale below the dominant Kitaev coupling. We demonstrate that the magnetotropic spin susceptibility in this model of 𝛼−RuCl3 displays scaling behavior 𝑘=𝑇𝑓(𝐵/𝑇) at high temperatures. Once the uniform susceptibility departs from the Curie law (i.e., at the energy scale of the exchange interactions), it appears to transition to an emergent scalinglike behavior, characterized by a different function 𝑓 at lower temperatures, stemming from the locality of torque fluctuations. We observe a remarkable numerical match between experiment and simulations and we also find qualitative agreement with the pure Kitaev model. In comparison, for the XXZ Heisenberg Hamiltonian, the scaling 𝑘=𝑇𝑓(𝐵/𝑇) breaks down at a temperature scale where the uniform spin susceptibility deviates from the Curie law and never reemerges at low temperatures."}],"article_number":"L201114","oa_version":"Preprint","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"doi":"10.1103/PhysRevB.110.L201114","article_processing_charge":"No","publication_status":"published","date_created":"2024-12-15T23:01:50Z","publication":"Physical Review B","intvolume":" 110","citation":{"ieee":"T. Sato, B. J. Ramshaw, K. A. Modic, and F. F. Assaad, “Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study,” Physical Review B, vol. 110, no. 20. American Physical Society, 2024.","chicago":"Sato, Toshihiro, B. J. Ramshaw, Kimberly A Modic, and Fakher F. Assaad. “Scale-Invariant Magnetic Anisotropy in α-RuCl3: A Quantum Monte Carlo Study.” Physical Review B. American Physical Society, 2024. https://doi.org/10.1103/PhysRevB.110.L201114.","ista":"Sato T, Ramshaw BJ, Modic KA, Assaad FF. 2024. Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. 110(20), L201114.","ama":"Sato T, Ramshaw BJ, Modic KA, Assaad FF. Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. 2024;110(20). doi:10.1103/PhysRevB.110.L201114","short":"T. Sato, B.J. Ramshaw, K.A. Modic, F.F. Assaad, Physical Review B 110 (2024).","apa":"Sato, T., Ramshaw, B. J., Modic, K. A., & Assaad, F. F. (2024). Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.110.L201114","mla":"Sato, Toshihiro, et al. “Scale-Invariant Magnetic Anisotropy in α-RuCl3: A Quantum Monte Carlo Study.” Physical Review B, vol. 110, no. 20, L201114, American Physical Society, 2024, doi:10.1103/PhysRevB.110.L201114."},"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"type":"journal_article","status":"public","project":[{"grant_number":"F8607","name":"Center for Correlated Quantum Materials and Solid State Quantum Systems: Scale- invariance in entangled quantum spin systems","_id":"34ac8b51-11ca-11ed-8bc3-86c15daa9f8f"}],"issue":"20","day":"15","date_updated":"2026-10-15T09:50:59Z","fulldoi":"https://doi.org/10.1103/PhysRevB.110.L201114","scopus_import":"1","acknowledgement":"We gratefully acknowledge the Gauss Centre for Supercomputing e.V. for funding this project by providing computing time on the GCS Supercomputer SUPERMUC-NG at the Leibniz Supercomputing Centre (Project No. pn73xu) as well as the scientific support and HPC resources provided by the Erlangen National High Performance Computing Center (NHR@FAU) of the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) under the NHR Project b133ae. NHR funding is provided by federal and Bavarian state authorities. NHR@FAU hardware is partially funded by the German Research Foundation (DFG) – 440719683. T.S. thanks funding from the Deutsche Forschungsgemeinschaft under Grant No. SA 3986/1-1 as well as the Würzburg-Dresden Cluster of Excellence on Complexity and Topology in Quantum Matter ct.qmat (EXC 2147, Project ID 390858490). F.F.A. acknowledges financial support from the German Research Foundation (DFG) under the Grant AS 120/16-1 (Project No. 493886309) that is part of the collaborative research project SFB Q-M&S funded by the Austrian Science Fund (FWF) F 86. K.A.M. thanks financial support from the Austrian Science Fund, SFB F 86, Q-M&S.","quality_controlled":"1","OA_type":"green","researchdata_availability":"no","arxiv":1,"year":"2024","department":[{"_id":"KiMo"}]},{"fulldoi":"https://doi.org/10.52202/079017-3180","date_updated":"2026-10-15T09:50:27Z","day":"20","scopus_import":"1","type":"conference","status":"public","alternative_title":["Advances in Neural Information Processing Systems"],"arxiv":1,"year":"2024","department":[{"_id":"DaAl"}],"conference":{"end_date":"2024-12-15","location":"Vancouver, Canada","name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-09"},"OA_type":"green","quality_controlled":"1","_id":"19511","publisher":"Neural Information Processing Systems Foundation","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2404.00456","open_access":"1"}],"title":"QuaRot: Outlier-free 4-bit inference in rotated LLMs","month":"12","volume":37,"OA_place":"repository","date_published":"2024-12-20T00:00:00Z","oa":1,"intvolume":" 37","citation":{"ama":"Ashkboos S, Mohtashami A, Croci ML, et al. QuaRot: Outlier-free 4-bit inference in rotated LLMs. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-3180","short":"S. Ashkboos, A. Mohtashami, M.L. Croci, B. Li, P. Cameron, M. Jaggi, D.-A. Alistarh, T. Hoefler, J. Hensman, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ista":"Ashkboos S, Mohtashami A, Croci ML, Li B, Cameron P, Jaggi M, Alistarh D-A, Hoefler T, Hensman J. 2024. QuaRot: Outlier-free 4-bit inference in rotated LLMs. 38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","chicago":"Ashkboos, Saleh, Amirkeivan Mohtashami, Maximilian L. Croci, Bo Li, Pashmina Cameron, Martin Jaggi, Dan-Adrian Alistarh, Torsten Hoefler, and James Hensman. “QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-3180.","ieee":"S. Ashkboos et al., “QuaRot: Outlier-free 4-bit inference in rotated LLMs,” in 38th Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","apa":"Ashkboos, S., Mohtashami, A., Croci, M. L., Li, B., Cameron, P., Jaggi, M., … Hensman, J. (2024). QuaRot: Outlier-free 4-bit inference in rotated LLMs. In 38th Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-3180","mla":"Ashkboos, Saleh, et al. “QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMs.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-3180."},"publication":"38th Conference on Neural Information Processing Systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"relation":"software","url":"https://github.com/spcl/QuaRot"}]},"language":[{"iso":"eng"}],"author":[{"last_name":"Ashkboos","full_name":"Ashkboos, Saleh","first_name":"Saleh"},{"first_name":"Amirkeivan","full_name":"Mohtashami, Amirkeivan","last_name":"Mohtashami"},{"first_name":"Maximilian L.","full_name":"Croci, Maximilian L.","last_name":"Croci"},{"full_name":"Li, Bo","first_name":"Bo","last_name":"Li"},{"first_name":"Pashmina","full_name":"Cameron, Pashmina","last_name":"Cameron"},{"last_name":"Jaggi","full_name":"Jaggi, Martin","first_name":"Martin"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"last_name":"Hoefler","first_name":"Torsten","full_name":"Hoefler, Torsten"},{"last_name":"Hensman","first_name":"James","full_name":"Hensman, James"}],"abstract":[{"text":"We introduce QuaRot, a new Quantization scheme based on Rotations, which is able to quantize LLMs end-to-end, including all weights, activations, and KV cache in 4 bits. QuaRot rotates LLMs in a way that removes outliers from the hidden state without changing the output, making quantization easier. This computational invariance is applied to the hidden state (residual) of the LLM, as well as to the activations of the feed-forward components, aspects of the attention mechanism, and to the KV cache. The result is a quantized model where all matrix multiplications are performed in 4 bits, without any channels identified for retention in higher precision. Our 4-bit quantized LLAMA2-70B model has losses of at most 0.47 WikiText-2 perplexity and retains 99% of the zero-shot performance. We also show that QuaRot can provide lossless 6 and 8 bit LLAMA-2 models without any calibration data using round-to-nearest quantization. Code is available at github.com/spcl/QuaRot.","lang":"eng"}],"external_id":{"arxiv":["2404.00456"]},"oa_version":"Preprint","publication_identifier":{"issn":["1049-5258"]},"article_processing_charge":"No","doi":"10.52202/079017-3180","date_created":"2025-04-06T22:01:32Z","publication_status":"published"},{"title":"Frustrated magnetism in octahedra-based Ce6 Ni6 P17","article_type":"original","publisher":"American Physical Society","supplementarymaterial":"yes","_id":"15003","date_published":"2024-02-01T00:00:00Z","das_tickbox":"0","month":"02","volume":109,"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"intvolume":" 109","citation":{"chicago":"Franco, D. G., R. Avalos, D. Hafner, Kimberly A Modic, Yu Prots, O. Stockert, A. Hoser, et al. “Frustrated Magnetism in Octahedra-Based Ce6 Ni6 P17.” Physical Review B. American Physical Society, 2024. https://doi.org/10.1103/PhysRevB.109.054405.","ieee":"D. G. Franco et al., “Frustrated magnetism in octahedra-based Ce6 Ni6 P17,” Physical Review B, vol. 109, no. 5. American Physical Society, 2024.","ista":"Franco DG, Avalos R, Hafner D, Modic KA, Prots Y, Stockert O, Hoser A, Moll PJW, Brando M, Aligia AA, Geibel C. 2024. Frustrated magnetism in octahedra-based Ce6 Ni6 P17. Physical Review B. 109(5), 054405.","ama":"Franco DG, Avalos R, Hafner D, et al. Frustrated magnetism in octahedra-based Ce6 Ni6 P17. Physical Review B. 2024;109(5). doi:10.1103/PhysRevB.109.054405","short":"D.G. Franco, R. Avalos, D. Hafner, K.A. Modic, Y. Prots, O. Stockert, A. Hoser, P.J.W. Moll, M. Brando, A.A. Aligia, C. Geibel, Physical Review B 109 (2024).","mla":"Franco, D. G., et al. “Frustrated Magnetism in Octahedra-Based Ce6 Ni6 P17.” Physical Review B, vol. 109, no. 5, 054405, American Physical Society, 2024, doi:10.1103/PhysRevB.109.054405.","apa":"Franco, D. G., Avalos, R., Hafner, D., Modic, K. A., Prots, Y., Stockert, O., … Geibel, C. (2024). Frustrated magnetism in octahedra-based Ce6 Ni6 P17. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.109.054405"},"publication":"Physical Review B","date_created":"2024-02-18T23:01:01Z","article_processing_charge":"No","publication_status":"published","doi":"10.1103/PhysRevB.109.054405","oa_version":"None","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"article_number":"054405","author":[{"last_name":"Franco","full_name":"Franco, D. G.","first_name":"D. G."},{"full_name":"Avalos, R.","first_name":"R.","last_name":"Avalos"},{"last_name":"Hafner","full_name":"Hafner, D.","first_name":"D."},{"last_name":"Modic","full_name":"Modic, Kimberly A","first_name":"Kimberly A","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425"},{"last_name":"Prots","full_name":"Prots, Yu","first_name":"Yu"},{"full_name":"Stockert, O.","first_name":"O.","last_name":"Stockert"},{"last_name":"Hoser","first_name":"A.","full_name":"Hoser, A."},{"full_name":"Moll, P. J.W.","first_name":"P. J.W.","last_name":"Moll"},{"full_name":"Brando, M.","first_name":"M.","last_name":"Brando"},{"last_name":"Aligia","first_name":"A. A.","full_name":"Aligia, A. A."},{"full_name":"Geibel, C.","first_name":"C.","last_name":"Geibel"}],"abstract":[{"text":"Magnetic frustration allows to access novel and intriguing properties of magnetic systems and has been explored mainly in planar triangular-like arrays of magnetic ions. In this work, we describe the phosphide Ce6Ni6P17, where the Ce+3 ions accommodate in a body-centered cubic lattice of Ce6 regular octahedra. From measurements of magnetization, specific heat, and resistivity, we determine a rich phase diagram as a function of temperature and magnetic field in which different magnetic phases are found. Besides clear evidence of magnetic frustration is obtained from entropy analysis. At zero field, a second-order antiferromagnetic transition occurs at TN1≈1 K followed by a first-order transition at TN2≈0.45 K. With magnetic field new magnetic phases appear, including a weakly first-order transition which ends in a classical critical point and a third magnetic phase. We also study the exact solution of the spin-1/2 Heisenberg model in an octahedron which allows us a qualitative understanding of the phase diagram and compare with the experimental results.","lang":"eng"}],"external_id":{"isi":["001198571800008"]},"scopus_import":"1","fulldoi":"https://doi.org/10.1103/PhysRevB.109.054405","date_updated":"2026-10-15T09:50:31Z","day":"01","issue":"5","status":"public","type":"journal_article","department":[{"_id":"KiMo"}],"year":"2024","researchdata_availability":"no","quality_controlled":"1","acknowledgement":"The authors thank Bernardo Pentke for the SEM micrographs (Departamento Fisicoquímica de Materiales CABCNEA). We are indebted to Julián Sereni for useful discussions. D. G. F. acknowledges financial support provided by Agencia I+D+i, Argentina, Grant No. PICT-2021-I-INVI00852 and Universidad Nacional de Cuyo (SIIP) Grant No. 06/C018-T1. A. A. A. acknowledges financial support provided by PICT 2018-01546 and PICT 2020A-03661 of the\r\nAgencia I+D+i. "},{"year":"2024","department":[{"_id":"JuFi"}],"arxiv":1,"researchdata_availability":"unclear","OA_type":"green","quality_controlled":"1","scopus_import":"1","fulldoi":"https://doi.org/10.1512/iumj.2024.73.9701","day":"01","date_updated":"2026-10-15T09:49:54Z","issue":"1","page":"111-148","type":"journal_article","status":"public","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"citation":{"ama":"Hensel S, Laux T. BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness. Indiana University Mathematics Journal. 2024;73(1):111-148. doi:10.1512/iumj.2024.73.9701","short":"S. Hensel, T. Laux, Indiana University Mathematics Journal 73 (2024) 111–148.","ista":"Hensel S, Laux T. 2024. BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness. Indiana University Mathematics Journal. 73(1), 111–148.","chicago":"Hensel, Sebastian, and Tim Laux. “BV Solutions for Mean Curvature Flow with Constant Angle: Allen-Cahn Approximation and Weak-Strong Uniqueness.” Indiana University Mathematics Journal. Indiana University Mathematics Journal, 2024. https://doi.org/10.1512/iumj.2024.73.9701.","ieee":"S. Hensel and T. Laux, “BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness,” Indiana University Mathematics Journal, vol. 73, no. 1. Indiana University Mathematics Journal, pp. 111–148, 2024.","mla":"Hensel, Sebastian, and Tim Laux. “BV Solutions for Mean Curvature Flow with Constant Angle: Allen-Cahn Approximation and Weak-Strong Uniqueness.” Indiana University Mathematics Journal, vol. 73, no. 1, Indiana University Mathematics Journal, 2024, pp. 111–48, doi:10.1512/iumj.2024.73.9701.","apa":"Hensel, S., & Laux, T. (2024). BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness. Indiana University Mathematics Journal. Indiana University Mathematics Journal. https://doi.org/10.1512/iumj.2024.73.9701"},"intvolume":" 73","publication":"Indiana University Mathematics Journal","oa_version":"Preprint","publication_identifier":{"issn":["0022-2518"]},"article_processing_charge":"No","publication_status":"published","date_created":"2025-01-27T15:20:19Z","doi":"10.1512/iumj.2024.73.9701","author":[{"last_name":"Hensel","orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","full_name":"Hensel, Sebastian"},{"last_name":"Laux","full_name":"Laux, Tim","first_name":"Tim"}],"abstract":[{"lang":"eng","text":"We study weak solutions to mean curvature flow satisfying Young’s angle condition for general contact angles α ∈ (0, π). First, we construct BV solutions by using the Allen-Cahn approximation with boundary contact energy as proposed by Owen and Sternberg. Second, we prove the weak-strong uniqueness and stability for this solution concept. The main ingredient for both results is a relative energy, which can also be interpreted as a tilt excess. "}],"external_id":{"arxiv":["2112.11150"]},"article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2112.11150"}],"title":"BV solutions for mean curvature flow with constant angle: Allen-Cahn approximation and weak-strong uniqueness","supplementarymaterial":"unclear","_id":"18926","publisher":"Indiana University Mathematics Journal","volume":73,"month":"01","date_published":"2024-01-01T00:00:00Z","OA_place":"repository","oa":1},{"oa":1,"das_tickbox":"0","date_published":"2024-01-29T00:00:00Z","month":"01","title":"Zero-sum random games on directed graphs","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2401.16252","open_access":"1"}],"_id":"17101","supplementarymaterial":"no","article_processing_charge":"No","publication_status":"submitted","doi":"10.48550/arXiv.2401.16252","date_created":"2024-06-03T07:45:22Z","oa_version":"Preprint","article_number":"2401.16252","external_id":{"arxiv":["2401.16252"]},"abstract":[{"text":"This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players.\r\nStarting from a fixed vertex, players take turns to move a token along the edges of the graph.\r\nOn the one hand, for acyclic directed graphs of bounded degree and sub-exponential expansion, we show that the value of the game converges almost surely to a constant at an exponential rate dominated in terms of the expansion.\r\nOn the other hand, for the infinite d-ary tree that does not fall into the previous class of graphs, we show convergence at a double-exponential rate in terms of the expansion.","lang":"eng"}],"author":[{"last_name":"Attia","first_name":"Luc","full_name":"Attia, Luc"},{"last_name":"Lichev","full_name":"Lichev, Lyuben","first_name":"Lyuben"},{"first_name":"Dieter","full_name":"Mitsche, Dieter","last_name":"Mitsche"},{"last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","first_name":"Raimundo J"},{"last_name":"Ziliotto","full_name":"Ziliotto, Bruno","first_name":"Bruno"}],"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"arXiv","citation":{"mla":"Attia, Luc, et al. “Zero-Sum Random Games on Directed Graphs.” ArXiv, 2401.16252, doi:10.48550/arXiv.2401.16252.","apa":"Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., & Ziliotto, B. (n.d.). Zero-sum random games on directed graphs. arXiv. https://doi.org/10.48550/arXiv.2401.16252","ieee":"L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Zero-sum random games on directed graphs,” arXiv. .","chicago":"Attia, Luc, Lyuben Lichev, Dieter Mitsche, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Zero-Sum Random Games on Directed Graphs.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2401.16252.","ista":"Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Zero-sum random games on directed graphs. arXiv, 2401.16252.","ama":"Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Zero-sum random games on directed graphs. arXiv. doi:10.48550/arXiv.2401.16252","short":"L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, ArXiv (n.d.)."},"status":"public","type":"preprint","day":"29","date_updated":"2026-10-15T09:51:45Z","fulldoi":"https://doi.org/10.48550/arXiv.2401.16252","researchdata_availability":"no","acknowledgement":"This work was supported by the French Agence Nationale de la Recherche (ANR) under references ANR-21-CE40-0020 (CONVERGENCE project) and ANR-20-CE40-0002 (GrHyDy), and by Fondecyt grant 1220174. This collaboration was mainly conducted during a 1-year visit of Bruno Ziliotto to the Center for Mathematical Modeling (CMM) at University of Chile in 2023,\r\nunder the IRL program of CNRS.","department":[{"_id":"KrCh"}],"year":"2024","arxiv":1},{"acknowledgement":"This work was partially funded by the Academy of Finland, grant 314888, the European Research Council CoG 863818 (ForM-SMArt), and the Austrian Science Fund (FWF) project I 4800-N (ADVISE). LS was supported by the Stochastic Analysis and Application Research Center (SAARC) under National Research Foundation of Korea grant NRF-2019R1A5A1028324.","quality_controlled":"1","conference":{"name":"OPODIS: Conference on Principles of Distributed Systems","start_date":"2023-12-06","location":"Tokyo, Japan","end_date":"2023-12-08"},"researchdata_availability":"no","arxiv":1,"department":[{"_id":"KrCh"}],"year":"2024","file":[{"date_updated":"2024-02-26T09:04:58Z","file_name":"2024_LIPICs_Hirvonen.pdf","relation":"main_file","content_type":"application/pdf","creator":"dernst","success":1,"file_size":867363,"checksum":"4fc7eea6e4ba140b904781fc7df868ec","date_created":"2024-02-26T09:04:58Z","file_id":"15028","access_level":"open_access"}],"status":"public","has_accepted_license":"1","type":"conference","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"ec_funded":1,"alternative_title":["LIPIcs"],"day":"18","date_updated":"2026-10-15T10:07:37Z","fulldoi":"https://doi.org/10.4230/LIPIcs.OPODIS.2023.11","ddc":["000"],"scopus_import":"1","file_date_updated":"2024-02-26T09:04:58Z","article_number":"11","external_id":{"arxiv":["2102.13457"],"isi":["001585185800011"]},"author":[{"full_name":"Hirvonen, Juho","first_name":"Juho","last_name":"Hirvonen"},{"last_name":"Schmid","first_name":"Laura","full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"abstract":[{"text":"Graphical games are a useful framework for modeling the interactions of (selfish) agents who are connected via an underlying topology and whose behaviors influence each other. They have wide applications ranging from computer science to economics and biology. Yet, even though an agent’s payoff only depends on the actions of their direct neighbors in graphical games, computing the Nash equilibria and making statements about the convergence time of \"natural\" local dynamics in particular can be highly challenging. In this work, we present a novel approach for classifying complexity of Nash equilibria in graphical games by establishing a connection to local graph algorithms, a subfield of distributed computing. In particular, we make the observation that the equilibria of graphical games are equivalent to locally verifiable labelings (LVL) in graphs; vertex labelings which are verifiable with constant-round local algorithms. This connection allows us to derive novel lower bounds on the convergence time to equilibrium of best-response dynamics in graphical games. Since we establish that distributed convergence can sometimes be provably slow, we also introduce and give bounds on an intuitive notion of \"time-constrained\" inefficiency of best responses. We exemplify how our results can be used in the implementation of mechanisms that ensure convergence of best responses to a Nash equilibrium. Our results thus also give insight into the convergence of strategy-proof algorithms for graphical games, which is still not well understood.","lang":"eng"}],"doi":"10.4230/LIPIcs.OPODIS.2023.11","article_processing_charge":"No","date_created":"2024-02-18T23:01:01Z","publication_status":"published","oa_version":"Published Version","publication_identifier":{"isbn":["9783959773089"],"issn":["1868-8969"]},"publication":"27th International Conference on Principles of Distributed Systems","intvolume":" 286","citation":{"chicago":"Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11.","ista":"Hirvonen J, Schmid L, Chatterjee K, Schmid S. 2024. On the convergence time in graphical games: A locality-sensitive approach. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 11.","ieee":"J. Hirvonen, L. Schmid, K. Chatterjee, and S. Schmid, “On the convergence time in graphical games: A locality-sensitive approach,” in 27th International Conference on Principles of Distributed Systems, Tokyo, Japan, 2024, vol. 286.","short":"J. Hirvonen, L. Schmid, K. Chatterjee, S. Schmid, in:, 27th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ama":"Hirvonen J, Schmid L, Chatterjee K, Schmid S. On the convergence time in graphical games: A locality-sensitive approach. In: 27th International Conference on Principles of Distributed Systems. Vol 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.OPODIS.2023.11","mla":"Hirvonen, Juho, et al. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” 27th International Conference on Principles of Distributed Systems, vol. 286, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.OPODIS.2023.11.","apa":"Hirvonen, J., Schmid, L., Chatterjee, K., & Schmid, S. (2024). On the convergence time in graphical games: A locality-sensitive approach. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11"},"language":[{"iso":"eng"}],"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"date_published":"2024-01-18T00:00:00Z","das_tickbox":"0","month":"01","volume":286,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"15006","supplementarymaterial":"no","title":"On the convergence time in graphical games: A locality-sensitive approach"},{"arxiv":1,"department":[{"_id":"KrCh"}],"dataavailabilitystatement":"We refer to the artefact with the exact code used for the submission and all logs [31], and the gitlab with the continually developed source code [30].","file":[{"checksum":"c888231d0a47b55786b7b4c0f02216bb","access_level":"open_access","file_id":"17419","date_created":"2024-08-12T08:39:12Z","file_size":368487,"success":1,"creator":"dernst","file_name":"2024_CAV_Meggendorfer.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2024-08-12T08:39:12Z"}],"year":"2024","acknowledgement":"M. Weininger has received funding from the EU’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 101034413.","researchdata_availability":"yes","conference":{"location":"Montreal, Canada","end_date":"2024-07-27","start_date":"2024-07-24","name":"CAV: Computer Aided Verification"},"quality_controlled":"1","fulldoi":"https://doi.org/10.1007/978-3-031-65633-0_16","date_updated":"2026-10-15T10:06:48Z","day":"01","ddc":["000"],"scopus_import":"1","has_accepted_license":"1","status":"public","type":"conference","page":"359-372","ec_funded":1,"project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"alternative_title":["LNCS"],"intvolume":" 14683","citation":{"ama":"Meggendorfer T, Weininger M. Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In: 36th International Conference on Computer Aided Verification. Vol 14683. Springer Nature; 2024:359-372. doi:10.1007/978-3-031-65633-0_16","short":"T. Meggendorfer, M. Weininger, in:, 36th International Conference on Computer Aided Verification, Springer Nature, 2024, pp. 359–372.","ista":"Meggendorfer T, Weininger M. 2024. Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. 36th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 14683, 359–372.","chicago":"Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games.” In 36th International Conference on Computer Aided Verification, 14683:359–72. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-65633-0_16.","ieee":"T. Meggendorfer and M. Weininger, “Playing games with your PET: Extending the Partial Exploration Tool to stochastic games,” in 36th International Conference on Computer Aided Verification, Montreal, Canada, 2024, vol. 14683, pp. 359–372.","apa":"Meggendorfer, T., & Weininger, M. (2024). Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. In 36th International Conference on Computer Aided Verification (Vol. 14683, pp. 359–372). Montreal, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-65633-0_16","mla":"Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your PET: Extending the Partial Exploration Tool to Stochastic Games.” 36th International Conference on Computer Aided Verification, vol. 14683, Springer Nature, 2024, pp. 359–72, doi:10.1007/978-3-031-65633-0_16."},"publication":"36th International Conference on Computer Aided Verification","language":[{"iso":"eng"}],"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"file_date_updated":"2024-08-12T08:39:12Z","abstract":[{"lang":"eng","text":"We present version 2.0 of the Partial Exploration Tool (PET), a tool for verification of probabilistic systems. We extend the previous version by adding support for stochastic games, based on a recent unified framework for sound value iteration algorithms. Thereby, PET2 is the first tool implementing a sound and efficient approach for solving stochastic games with objectives of the type reachability/safety and mean payoff. We complement this approach by developing and implementing a partial-exploration based variant for all three objectives. Our experimental evaluation shows that PET2 offers the most efficient partial-exploration based algorithm and is the most viable tool on SGs, even outperforming unsound tools."}],"author":[{"last_name":"Meggendorfer","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","first_name":"Tobias"},{"orcid":"0000-0002-0163-2152","id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"}],"external_id":{"arxiv":["2405.03885"],"isi":["001307897000016"]},"date_created":"2024-08-09T11:24:54Z","article_processing_charge":"Yes (in subscription journal)","doi":"10.1007/978-3-031-65633-0_16","publication_status":"published","oa_version":"Published Version","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783031656330"],"eissn":["1611-3349"],"isbn":["9783031656323"]},"publisher":"Springer Nature","_id":"17402","supplementarymaterial":"no","title":"Playing games with your PET: Extending the Partial Exploration Tool to stochastic games","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2024-07-01T00:00:00Z","das_tickbox":"1","oa":1,"month":"07","volume":14683},{"supplementarymaterial":"no","_id":"17162","publisher":"Association for Computing Machinery","article_type":"original","title":"Quantitative bounds on resource usage of probabilistic programs","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":8,"month":"04","oa":1,"das_tickbox":"1","date_published":"2024-04-29T00:00:00Z","publication":"Proceedings of the ACM on Programming Languages","citation":{"short":"K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, Proceedings of the ACM on Programming Languages 8 (2024).","ama":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. 2024;8(OOPSLA1). doi:10.1145/3649824","ista":"Chatterjee K, Goharshady AK, Meggendorfer T, Zikelic D. 2024. Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. 8(OOPSLA1), 107.","ieee":"K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Quantitative bounds on resource usage of probabilistic programs,” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1. Association for Computing Machinery, 2024.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Quantitative Bounds on Resource Usage of Probabilistic Programs.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2024. https://doi.org/10.1145/3649824.","apa":"Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2024). Quantitative bounds on resource usage of probabilistic programs. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3649824","mla":"Chatterjee, Krishnendu, et al. “Quantitative Bounds on Resource Usage of Probabilistic Programs.” Proceedings of the ACM on Programming Languages, vol. 8, no. OOPSLA1, 107, Association for Computing Machinery, 2024, doi:10.1145/3649824."},"intvolume":" 8","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"research_data","id":"23140","status":"public"}]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","first_name":"Dorde","full_name":"Zikelic, Dorde","last_name":"Zikelic"}],"abstract":[{"lang":"eng","text":"Cost analysis, also known as resource usage analysis, is the task of finding bounds on the total cost of a program and is a well-studied problem in static analysis. In this work, we consider two classical quantitative problems in cost analysis for probabilistic programs. The first problem is to find a bound on the expected total cost of the program. This is a natural measure for the resource usage of the program and can also be directly applied to average-case runtime analysis. The second problem asks for a tail bound, i.e. given a threshold t the goal is to find a probability bound p such that ℙ[total cost ≥ t] ≤ p. Intuitively, given a threshold t on the resource, the problem is to find the likelihood that the total cost exceeds this threshold.\r\nFirst, for expectation bounds, a major obstacle in previous works on cost analysis is that they can handle only non-negative costs or bounded variable updates. In contrast, we provide a new variant of the standard notion of cost martingales, that allows us to find expectation bounds for a class of programs with general positive or negative costs and no restriction on the variable updates. More specifically, our approach is applicable as long as there is a lower bound on the total cost incurred along every path.\r\nSecond, for tail bounds, all previous methods are limited to programs in which the expected total cost is finite. In contrast, we present a novel approach, based on a combination of our martingale-based method for expectation bounds with a quantitative safety analysis, to obtain a solution to the tail bound problem that is applicable even to programs with infinite expected cost. Specifically, this allows us to obtain runtime tail bounds for programs that do not terminate almost-surely.\r\nIn summary, we provide a novel combination of martingale-based cost analysis and quantitative safety analysis that is able to find expectation and tail cost bounds for probabilistic programs, without the restrictions of non-negative costs, bounded updates, or finiteness of the expected total cost. Finally, we provide experimental results showcasing that our approach can solve instances that were beyond the reach of previous methods."}],"file_date_updated":"2024-06-27T07:48:16Z","article_number":"107","oa_version":"Published Version","publication_identifier":{"eissn":["2475-1421"]},"date_created":"2024-06-23T22:01:02Z","publication_status":"published","doi":"10.1145/3649824","article_processing_charge":"Yes (in subscription journal)","date_updated":"2026-10-15T10:02:32Z","day":"29","fulldoi":"https://doi.org/10.1145/3649824","scopus_import":"1","ddc":["000"],"type":"journal_article","status":"public","has_accepted_license":"1","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"issue":"OOPSLA1","ec_funded":1,"year":"2024","file":[{"access_level":"open_access","date_created":"2024-06-27T07:48:16Z","file_id":"17182","checksum":"9243ded966f71df1572be5466019be5c","file_size":413096,"success":1,"creator":"dernst","content_type":"application/pdf","file_name":"2024_ProcACMProgLanguage_Chatterjee.pdf","relation":"main_file","date_updated":"2024-06-27T07:48:16Z"}],"dataavailabilitystatement":"The software that supports Section 8 is available on Zenodo [Meggendorfer and Žikelić 2024]. https://doi.org/10.5281/zenodo.10457566","department":[{"_id":"KrCh"}],"acknowledgement":"This work was supported in part by the European Research Council (ERC) under Grant No. 863818\r\n(ForM-SMArt) and the Hong Kong Research Grants Council under ECS Project No. 26208122.","quality_controlled":"1","researchdata_availability":"yes"},{"citation":{"mla":"Andersson, Joel Daniel, et al. “Continual Counting with Gradual Privacy Expiration.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-0299.","apa":"Andersson, J. D., Henzinger, M., Pagh, R., Steiner, T. A., & Upadhyay, J. (2024). Continual counting with gradual privacy expiration. In 38th Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-0299","ama":"Andersson JD, Henzinger M, Pagh R, Steiner TA, Upadhyay J. Continual counting with gradual privacy expiration. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-0299","short":"J.D. Andersson, M. Henzinger, R. Pagh, T.A. Steiner, J. Upadhyay, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ista":"Andersson JD, Henzinger M, Pagh R, Steiner TA, Upadhyay J. 2024. Continual counting with gradual privacy expiration. 38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","ieee":"J. D. Andersson, M. Henzinger, R. Pagh, T. A. Steiner, and J. Upadhyay, “Continual counting with gradual privacy expiration,” in 38th Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","chicago":"Andersson, Joel Daniel, Monika Henzinger, Rasmus Pagh, Teresa Anna Steiner, and Jalaj Upadhyay. “Continual Counting with Gradual Privacy Expiration.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-0299."},"intvolume":" 37","publication":"38th Conference on Neural Information Processing Systems","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"last_name":"Andersson","full_name":"Andersson, Joel Daniel","first_name":"Joel Daniel"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Pagh","full_name":"Pagh, Rasmus","first_name":"Rasmus"},{"last_name":"Steiner","full_name":"Steiner, Teresa Anna","first_name":"Teresa Anna"},{"full_name":"Upadhyay, Jalaj","first_name":"Jalaj","last_name":"Upadhyay"}],"abstract":[{"lang":"eng","text":"Differential privacy with gradual expiration models the setting where data items\r\narrive in a stream and at a given time t the privacy loss guaranteed for a data item\r\nseen at time (t − d) is εg(d), where g is a monotonically non-decreasing function.\r\nWe study the fundamental continual (binary) counting problem where each data\r\nitem consists of a bit, and the algorithm needs to output at each time step the sum of\r\nall the bits streamed so far. For a stream of length T and privacy without expiration\r\ncontinual counting is possible with maximum (over all time steps) additive error\r\nO(log2\r\n(T)/ε) and the best known lower bound is Ω(log(T)/ε); closing this gap\r\nis a challenging open problem.\r\nWe show that the situation is very different for privacy with gradual expiration by\r\ngiving upper and lower bounds for a large set of expiration functions g. Specifically,\r\nour algorithm achieves an additive error of O(log(T)/ε) for a large set of privacy\r\nexpiration functions. We also give a lower bound that shows that if C is the additive\r\nerror of any ε-DP algorithm for this problem, then the product of C and the privacy\r\nexpiration function after 2C steps must be Ω(log(T)/ε). Our algorithm matches\r\nthis lower bound as its additive error is O(log(T)/ε), even when g(2C) = O(1).\r\nOur empirical evaluation shows that we achieve a slowly growing privacy loss\r\nwith significantly smaller empirical privacy loss for large values of d than a natural\r\nbaseline algorithm."}],"external_id":{"arxiv":["2406.03802"]},"publication_identifier":{"eissn":["1049-5258"]},"oa_version":"Preprint","publication_status":"published","doi":"10.52202/079017-0299","article_processing_charge":"No","date_created":"2025-04-06T22:01:32Z","_id":"19512","publisher":"Neural Information Processing Systems Foundation","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2406.03802","open_access":"1"}],"title":"Continual counting with gradual privacy expiration","volume":37,"month":"12","date_published":"2024-12-20T00:00:00Z","OA_place":"repository","oa":1,"arxiv":1,"year":"2024","department":[{"_id":"MoHe"}],"acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Joel Daniel Andersson and Rasmus Pagh are affiliated with Basic Algorithms Research Copenhagen (BARC), supported by the VILLUM Foundation grant 16582, and are also supported by Providentia, a Data Science Distinguished Investigator grant from Novo Nordisk Fonden. Teresa Anna Steiner is supported by a research grant (VIL51463) from VILLUM FONDEN. This work was done while Teresa Anna Steiner was a Postdoc at the Technical University of Denmark. Jalaj Upadhyay’s research was funded by the Rutgers Decanal Grant no. 302918 and an unrestricted gift from Google.","conference":{"end_date":"2024-12-15","location":"Vancouver, Canada","start_date":"2024-12-09","name":"NeurIPS: Neural Information Processing Systems"},"OA_type":"green","quality_controlled":"1","fulldoi":"https://doi.org/10.52202/079017-0299","day":"20","date_updated":"2026-10-15T09:52:07Z","scopus_import":"1","type":"conference","status":"public","alternative_title":["Advances in Neural Information Processing Systems"],"ec_funded":1,"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}]},{"publication":"38th Conference on Neural Information Processing Systems","intvolume":" 37","citation":{"apa":"Fumero, M., Pegoraro, M., Maiorca, V., Locatello, F., & Rodolà, E. (2024). Latent functional maps: A spectral framework for representation alignment. In 38th Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation. https://doi.org/10.52202/079017-2115","mla":"Fumero, Marco, et al. “Latent Functional Maps: A Spectral Framework for Representation Alignment.” 38th Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024, doi:10.52202/079017-2115.","ama":"Fumero M, Pegoraro M, Maiorca V, Locatello F, Rodolà E. Latent functional maps: A spectral framework for representation alignment. In: 38th Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024. doi:10.52202/079017-2115","short":"M. Fumero, M. Pegoraro, V. Maiorca, F. Locatello, E. Rodolà, in:, 38th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ista":"Fumero M, Pegoraro M, Maiorca V, Locatello F, Rodolà E. 2024. Latent functional maps: A spectral framework for representation alignment. 38th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","ieee":"M. Fumero, M. Pegoraro, V. Maiorca, F. Locatello, and E. Rodolà, “Latent functional maps: A spectral framework for representation alignment,” in 38th Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","chicago":"Fumero, Marco, Marco Pegoraro, Valentino Maiorca, Francesco Locatello, and Emanuele Rodolà. “Latent Functional Maps: A Spectral Framework for Representation Alignment.” In 38th Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024. https://doi.org/10.52202/079017-2115."},"language":[{"iso":"eng"}],"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2406.14183"]},"abstract":[{"lang":"eng","text":"Neural models learn data representations that lie on low-dimensional manifolds,\r\nyet modeling the relation between these representational spaces is an ongoing challenge. By integrating spectral geometry principles into neural modeling, we show\r\nthat this problem can be better addressed in the functional domain, mitigating complexity, while enhancing interpretability and performances on downstream tasks.\r\nTo this end, we introduce a multi-purpose framework to the representation learning\r\ncommunity, which allows to: (i) compare different spaces in an interpretable way\r\nand measure their intrinsic similarity; (ii) find correspondences between them, both\r\nin unsupervised and weakly supervised settings, and (iii) to effectively transfer\r\nrepresentations between distinct spaces. We validate our framework on various\r\napplications, ranging from stitching to retrieval tasks, and on multiple modalities,\r\ndemonstrating that Latent Functional Maps can serve as a swiss-army knife for\r\nrepresentation alignment"}],"author":[{"first_name":"Marco","full_name":"Fumero, Marco","id":"1c1593eb-393f-11ef-bb8e-ab4f1e979650","last_name":"Fumero"},{"first_name":"Marco","full_name":"Pegoraro, Marco","last_name":"Pegoraro"},{"full_name":"Maiorca, Valentino","first_name":"Valentino","last_name":"Maiorca"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","full_name":"Locatello, Francesco","last_name":"Locatello"},{"full_name":"Rodolà, Emanuele","first_name":"Emanuele","last_name":"Rodolà"}],"doi":"10.52202/079017-2115","publication_status":"published","article_processing_charge":"No","date_created":"2025-04-06T22:01:32Z","oa_version":"Preprint","publication_identifier":{"eissn":["1049-5258"]},"publisher":"Neural Information Processing Systems Foundation","_id":"19515","title":"Latent functional maps: A spectral framework for representation alignment","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2406.14183"}],"oa":1,"OA_place":"repository","date_published":"2024-12-20T00:00:00Z","month":"12","volume":37,"arxiv":1,"department":[{"_id":"FrLo"}],"year":"2024","acknowledgement":"MF is supported by the MSCA IST-Bridge fellowship which has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement No 101034413. ER and VM are supported by the PNRR MUR project PE0000013-FAIR. MP is supported by the Sapienza grant \"Predicting and Explaining Clinical Trial Outcomes\", prot. RG12218166FA3F13.","quality_controlled":"1","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2024-12-09","location":"Vancouver, Canada","end_date":"2024-12-15"},"OA_type":"green","day":"20","date_updated":"2026-10-15T09:52:55Z","fulldoi":"https://doi.org/10.52202/079017-2115","scopus_import":"1","status":"public","type":"conference","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"ec_funded":1,"alternative_title":["Advances in Neural Information Processing Systems"]},{"OA_type":"green","oa_version":"None","article_processing_charge":"No","date_created":"2026-10-15T10:02:22Z","doi":"10.5281/zenodo.10457565","author":[{"first_name":"Đorđe","full_name":" Žikelić, Đorđe","last_name":" Žikelić"}],"abstract":[{"text":"The artefact for the OOPSLA 2024 paper \"Quantitative Bounds on Resource Usage of Probabilistic Programs\".\r\n\r\n","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2024","related_material":{"record":[{"id":"17162","status":"public","relation":"used_in_publication"}]},"department":[{"_id":"KrCh"}],"citation":{"apa":" Žikelić, Đ. (2024). Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. Zenodo. https://doi.org/10.5281/zenodo.10457565","mla":" Žikelić, Đorđe. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. Zenodo, 2024, doi:10.5281/zenodo.10457565.","ieee":"Đ. Žikelić, “Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs.” Zenodo, 2024.","ista":" Žikelić Đ. 2024. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs, Zenodo, 10.5281/zenodo.10457565.","chicago":" Žikelić, Đorđe. “Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs.” Zenodo, 2024. https://doi.org/10.5281/zenodo.10457565.","ama":" Žikelić Đ. Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs. 2024. doi:10.5281/zenodo.10457565","short":"Đ. Žikelić, (2024)."},"month":"03","date_published":"2024-03-05T00:00:00Z","OA_place":"repository","oa":1,"type":"research_data_reference","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.10457565"}],"title":"Artefact for: Quantitative Bounds on Resource Usage of Probabilistic Programs","ddc":["000"],"fulldoi":"https://doi.org/10.5281/zenodo.10457565","contributor":[{"first_name":"Tobias","last_name":"Meggendorfer","contributor_type":"contact_person"}],"_id":"23140","date_updated":"2026-10-15T10:02:33Z","day":"05","publisher":"Zenodo"},{"_id":"15083","supplementarymaterial":"yes","publisher":"National Academy of Sciences","article_type":"original","title":"Efficiency and resilience of cooperation in asymmetric social dilemmas","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"month":"03","volume":121,"date_published":"2024-03-05T00:00:00Z","das_tickbox":"1","OA_place":"publisher","oa":1,"citation":{"chicago":"Hübner, Valentin, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2315558121.","ieee":"V. Hübner, M. Staab, C. Hilbe, K. Chatterjee, and M. Kleshnina, “Efficiency and resilience of cooperation in asymmetric social dilemmas,” Proceedings of the National Academy of Sciences of the United States of America, 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.","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).","ama":"Hübner V, Staab M, Hilbe C, Chatterjee K, Kleshnina M. Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences of the United States of America. 2024;121(10). doi:10.1073/pnas.2315558121","mla":"Hübner, Valentin, et al. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 10, e2315558121, National Academy of Sciences, 2024, doi:10.1073/pnas.2315558121.","apa":"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. National Academy of Sciences. https://doi.org/10.1073/pnas.2315558121"},"intvolume":" 121","publication":"Proceedings of the National Academy of Sciences of the United States of America","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"related_material":{"link":[{"description":"News on ISTA Website","relation":"press_release","url":"https://ista.ac.at/en/news/what-math-tells-us-about-social-dilemmas/"}],"record":[{"id":"15108","status":"public","relation":"research_data"},{"relation":"dissertation_contains","status":"public","id":"19903"}]},"language":[{"iso":"eng"}],"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"}],"author":[{"orcid":"0009-0001-5009-4987","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","full_name":"Hübner, Valentin","first_name":"Valentin","last_name":"Hübner"},{"first_name":"Manuel","full_name":"Staab, Manuel","last_name":"Staab"},{"full_name":"Hilbe, Christian","first_name":"Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X","last_name":"Hilbe"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Kleshnina","first_name":"Maria","full_name":"Kleshnina, Maria"}],"external_id":{"pmid":["38408249"],"isi":["001207786500004"]},"article_number":"e2315558121","file_date_updated":"2024-03-12T13:12:22Z","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"oa_version":"Published Version","date_created":"2024-03-05T09:18:49Z","doi":"10.1073/pnas.2315558121","publication_status":"published","article_processing_charge":"Yes (in subscription journal)","fulldoi":"https://doi.org/10.1073/pnas.2315558121","pmid":1,"date_updated":"2026-10-15T10:10:26Z","day":"05","scopus_import":"1","ddc":["000"],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","type":"journal_article","APC_amount":"3041,76 EUR","has_accepted_license":"1","status":"public","issue":"10","ec_funded":1,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"file":[{"checksum":"068520e3efd4d008bb9177e8aedb7d22","file_id":"15109","date_created":"2024-03-12T13:12:22Z","access_level":"open_access","file_size":2203220,"success":1,"creator":"dernst","file_name":"2024_PNAS_Huebner.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2024-03-12T13:12:22Z"}],"year":"2024","department":[{"_id":"KrCh"}],"dataavailabilitystatement":"Figures are based on simulation averages over many independent runs of the respective simulation. Results were analyzed and visualized with Python and Matlab R2023a. The computer code is published in (65). All other data are included in the manuscript and/or SI Appendix.","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.).","researchdata_availability":"yes","OA_type":"hybrid","quality_controlled":"1"},{"ddc":["000"],"scopus_import":"1","fulldoi":"https://doi.org/10.1371/journal.pcbi.1012008","date_updated":"2026-10-15T12:28:11Z","day":"29","issue":"3","ec_funded":1,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"has_accepted_license":"1","APC_amount":"3149,96 EUR","status":"public","type":"journal_article","department":[{"_id":"KrCh"}],"dataavailabilitystatement":"Code for the figures and the computational experiments is available from the Figshare repository: https://figshare.com/s/4e08d78c892749f84201.","file":[{"success":1,"checksum":"a511cf369d9172beb123fe73f291b5cc","date_created":"2024-08-20T10:52:28Z","access_level":"open_access","file_id":"17450","file_size":1425292,"date_updated":"2024-08-20T10:52:28Z","creator":"dernst","file_name":"2024_PloSComBio_Svoboda.pdf","relation":"main_file","content_type":"application/pdf"}],"year":"2024","arxiv":1,"OA_type":"gold","researchdata_availability":"yes","quality_controlled":"1","acknowledgement":"We thank Gavin Rees for helpful discussions. J.S., S.J., and K.C were supported by\r\nEuropean Research Council (ERC) CoG 863818 (ForM-SMArt). J.T was supported by Center for Foundations of Modern Computer Science (Charles University project UNCE/SCI/004) and by the project PRIMUS/24/SCI/012 from Charles University. ","title":"Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating","article_type":"original","publisher":"Public Library of Science","supplementarymaterial":"yes","_id":"15297","date_published":"2024-03-29T00:00:00Z","OA_place":"publisher","das_tickbox":"1","oa":1,"month":"03","volume":20,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20138"}]},"language":[{"iso":"eng"}],"corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","DOAJ_listed":"1","isi":1,"intvolume":" 20","citation":{"apa":"Svoboda, J., Joshi, S. S., Tkadlec, J., & Chatterjee, K. (2024). Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1012008","mla":"Svoboda, Jakub, et al. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” PLoS Computational Biology, vol. 20, no. 3, e1012008, Public Library of Science, 2024, doi:10.1371/journal.pcbi.1012008.","short":"J. Svoboda, S.S. Joshi, J. Tkadlec, K. Chatterjee, PLoS Computational Biology 20 (2024).","ama":"Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 2024;20(3). doi:10.1371/journal.pcbi.1012008","ieee":"J. Svoboda, S. S. Joshi, J. Tkadlec, and K. Chatterjee, “Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating,” PLoS Computational Biology, vol. 20, no. 3. Public Library of Science, 2024.","ista":"Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. 2024. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 20(3), e1012008.","chicago":"Svoboda, Jakub, Soham Shrikant Joshi, Josef Tkadlec, and Krishnendu Chatterjee. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” PLoS Computational Biology. Public Library of Science, 2024. https://doi.org/10.1371/journal.pcbi.1012008."},"publication":"PLoS Computational Biology","doi":"10.1371/journal.pcbi.1012008","publication_status":"published","date_created":"2024-04-07T22:00:55Z","article_processing_charge":"Yes","oa_version":"Published Version","publication_identifier":{"eissn":["1553-7358"],"issn":["1553-734X"]},"article_number":"e1012008","file_date_updated":"2024-08-20T10:52:28Z","abstract":[{"lang":"eng","text":"Populations evolve by accumulating advantageous mutations. Every population has some spatial structure that can be modeled by an underlying network. The network then influences the probability that new advantageous mutations fixate. Amplifiers of selection are networks that increase the fixation probability of advantageous mutants, as compared to the unstructured fully-connected network. Whether or not a network is an amplifier depends on the choice of the random process that governs the evolutionary dynamics. Two popular choices are Moran process with Birth-death updating and Moran process with death-Birth updating. Interestingly, while some networks are amplifiers under Birth-death updating and other networks are amplifiers under death-Birth updating, so far no spatial structures have been found that function as an amplifier under both types of updating simultaneously. In this work, we identify networks that act as amplifiers of selection under both versions of the Moran process. The amplifiers are robust, modular, and increase fixation probability for any mutant fitness advantage in a range r ∈ (1, 1.2). To complement this positive result, we also prove that for certain quantities closely related to fixation probability, it is impossible to improve them simultaneously for both versions of the Moran process. Together, our results highlight how the two versions of the Moran process differ and what they have in common."}],"author":[{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","first_name":"Jakub","last_name":"Svoboda"},{"last_name":"Joshi","id":"f97aac0e-f57c-11ee-93d0-a5a82d8df168","first_name":"Soham Shrikant","full_name":"Joshi, Soham Shrikant"},{"orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","first_name":"Josef","last_name":"Tkadlec"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}],"external_id":{"arxiv":["2401.14914"],"isi":["001194482400002"]}},{"author":[{"last_name":"Hübner","first_name":"Valentin","full_name":"Hübner, Valentin","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","orcid":"0009-0001-5009-4987"},{"last_name":"Kleshnina","full_name":"Kleshnina, Maria","first_name":"Maria"}],"abstract":[{"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.","lang":"eng"}],"date_created":"2024-03-12T13:02:58Z","article_processing_charge":"No","doi":"10.5281/ZENODO.10639167","oa_version":"Published Version","citation":{"mla":"Hübner, Valentin, and Maria Kleshnina. Computer Code for “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.” Zenodo, 2024, doi:10.5281/ZENODO.10639167.","apa":"Hübner, V., & Kleshnina, M. (2024). Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.” Zenodo. https://doi.org/10.5281/ZENODO.10639167","short":"V. Hübner, M. Kleshnina, (2024).","ama":"Hübner V, Kleshnina M. Computer code for “Efficiency and resilience of cooperation in asymmetric social dilemmas.” 2024. doi:10.5281/ZENODO.10639167","chicago":"Hübner, Valentin, and Maria Kleshnina. “Computer Code for ‘Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.’” Zenodo, 2024. https://doi.org/10.5281/ZENODO.10639167.","ieee":"V. Hübner and M. Kleshnina, “Computer code for ‘Efficiency and resilience of cooperation in asymmetric social dilemmas.’” Zenodo, 2024.","ista":"Hübner V, Kleshnina M. 2024. Computer code for ‘Efficiency and resilience of cooperation in asymmetric social dilemmas’, Zenodo, 10.5281/ZENODO.10639167."},"department":[{"_id":"KrCh"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"15083"}]},"year":"2024","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","type":"research_data_reference","oa":1,"date_published":"2024-02-09T00:00:00Z","month":"02","publisher":"Zenodo","_id":"15108","day":"09","date_updated":"2026-10-15T10:10:25Z","fulldoi":"https://doi.org/10.5281/ZENODO.10639167","ddc":["000"],"title":"Computer code for \"Efficiency and resilience of cooperation in asymmetric social dilemmas\"","main_file_link":[{"url":"https://10.5281/zenodo.10639167","open_access":"1"}]},{"arxiv":1,"dataavailabilitystatement":"The implementations of the algorithms mentioned in the experiments section and the benchmarks are available at doi.org/10.5281/zenodo.12518217.","department":[{"_id":"KrCh"}],"year":"2024","file":[{"creator":"dernst","content_type":"application/pdf","relation":"main_file","file_name":"2024_LNCS_Chatterjee.pdf","date_updated":"2024-10-01T09:56:54Z","date_created":"2024-10-01T09:56:54Z","file_id":"18165","access_level":"open_access","checksum":"223845be9e754681ee218866827c95e7","file_size":650495,"success":1}],"acknowledgement":"This work was supported in part by the ERC-2020-CoG 863818 (FoRM-SMArt) and the Hong Kong Research Grants Council ECS Project Number 26208122.","quality_controlled":"1","conference":{"location":"Milan, Italy","end_date":"2024-09-13","name":"FM: Formal Methods","start_date":"2024-09-09"},"researchdata_availability":"yes","day":"11","date_updated":"2026-10-16T07:29:39Z","fulldoi":"https://doi.org/10.1007/978-3-031-71162-6_31","ddc":["000"],"scopus_import":"1","status":"public","has_accepted_license":"1","type":"conference","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"page":"600-619","ec_funded":1,"alternative_title":["LNCS"],"publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","citation":{"ieee":"K. Chatterjee, A. K. Goharshady, E. Goharshady, M. Karrabi, and D. Zikelic, “Sound and complete witnesses for template-based verification of LTL properties on polynomial programs,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Milan, Italy, 2024, vol. 14933, pp. 600–619.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Ehsan Goharshady, Mehrdad Karrabi, and Dorde Zikelic. “Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14933:600–619. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-71162-6_31.","ista":"Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. 2024. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). FM: Formal Methods, LNCS, vol. 14933, 600–619.","ama":"Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 14933. Springer Nature; 2024:600-619. doi:10.1007/978-3-031-71162-6_31","short":"K. Chatterjee, A.K. Goharshady, E. Goharshady, M. Karrabi, D. Zikelic, in:, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature, 2024, pp. 600–619.","mla":"Chatterjee, Krishnendu, et al. “Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14933, Springer Nature, 2024, pp. 600–19, doi:10.1007/978-3-031-71162-6_31.","apa":"Chatterjee, K., Goharshady, A. K., Goharshady, E., Karrabi, M., & Zikelic, D. (2024). Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 14933, pp. 600–619). Milan, Italy: Springer Nature. https://doi.org/10.1007/978-3-031-71162-6_31"},"intvolume":" 14933","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"research_data","id":"22798","status":"public"}]},"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","file_date_updated":"2024-10-01T09:56:54Z","external_id":{"isi":["001336893300031"],"arxiv":["2403.05386"]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady"},{"full_name":"Goharshady, Ehsan","first_name":"Ehsan","last_name":"Goharshady"},{"last_name":"Karrabi","orcid":"0009-0007-5253-9170","id":"67638922-f394-11eb-9cf6-f20423e08757","first_name":"Mehrdad","full_name":"Karrabi, Mehrdad"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic"}],"abstract":[{"text":"We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our witnesses are applicable to both verification (proving) and refutation (finding bugs) settings. We then consider LTL formulas in which atomic propositions can be polynomial constraints and turn our focus to polynomial arithmetic programs, i.e. programs in which every assignment and guard consists only of polynomial expressions. For this setting, we provide an efficient algorithm to automatically synthesize such LTL witnesses. Our synthesis procedure is both sound and semi-complete. Finally, we present experimental results demonstrating the effectiveness of our approach and that it can handle programs which were beyond the reach of previous state-of-the-art tools.","lang":"eng"}],"date_created":"2024-09-29T22:01:37Z","article_processing_charge":"Yes (in subscription journal)","doi":"10.1007/978-3-031-71162-6_31","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031711619"],"eissn":["1611-3349"]},"oa_version":"Published Version","publisher":"Springer Nature","supplementarymaterial":"no","_id":"18155","title":"Sound and complete witnesses for template-based verification of LTL properties on polynomial programs","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"das_tickbox":"1","date_published":"2024-09-11T00:00:00Z","month":"09","volume":14933},{"citation":{"ista":"Chatterjee K, Kafshdar Goharshady A, Kafshdar Goharshady E, Karrabi M, Žikelić Ð. 2024. Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs, Repository, 10.5281/zenodo.12518216.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, and Ðorđe Žikelić. “Data for Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs.” Repository, 2024. https://doi.org/10.5281/zenodo.12518216.","ieee":"K. Chatterjee, A. Kafshdar Goharshady, E. Kafshdar Goharshady, M. Karrabi, and Ð. Žikelić, “Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs.” Repository, 2024.","ama":"Chatterjee K, Kafshdar Goharshady A, Kafshdar Goharshady E, Karrabi M, Žikelić Ð. Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. 2024. doi:10.5281/zenodo.12518216","short":"K. Chatterjee, A. Kafshdar Goharshady, E. Kafshdar Goharshady, M. Karrabi, Ð. Žikelić, (2024).","apa":"Chatterjee, K., Kafshdar Goharshady, A., Kafshdar Goharshady, E., Karrabi, M., & Žikelić, Ð. (2024). Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. Repository. https://doi.org/10.5281/zenodo.12518216","mla":"Chatterjee, Krishnendu, et al. Data for Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs. Repository, 2024, doi:10.5281/zenodo.12518216."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2024","department":[{"_id":"KrCh"}],"related_material":{"record":[{"id":"18155","status":"public","relation":"used_in_publication"}]},"abstract":[{"text":"This repository contains the artifact of the paper titled \"Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs\" accepted at FM 2024.\r\n\r\nThe task of verifying an LTL formula on a program can be reduced to verifying a Büchi specification on the product transition system. This tool takes a non-deterministic transition system together with a Büchi specification as input and based on user preferences tries to either (i) prove the existence of a run in the program that satisfies the Büchi condition or (ii) demonstrate that every run of the program satisfies the Büchi condition.\r\n \r\nThe tool is written in Java and works well with openjdk 11 on Ubuntu 22.04. Running all the experiments can take weeks to finish. We have provided a script for running the strongest configuration of our tool which solves most of the benchmarks and takes less than 48 hours. Detailed guidance is given in the readme file.","lang":"eng"}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":" Kafshdar Goharshady","first_name":"Amir","full_name":" Kafshdar Goharshady, Amir"},{"first_name":"Ehsan","full_name":"Kafshdar Goharshady, Ehsan","last_name":"Kafshdar Goharshady"},{"last_name":"Karrabi","first_name":"Mehrdad","full_name":"Karrabi, Mehrdad"},{"first_name":"Ðorđe","full_name":"Žikelić, Ðorđe","last_name":"Žikelić"}],"oa_version":"None","OA_type":"green","date_created":"2026-09-03T11:50:15Z","article_processing_charge":"No","doi":"10.5281/zenodo.12518216","fulldoi":"https://doi.org/10.5281/zenodo.12518216","_id":"22798","day":"24","date_updated":"2026-10-16T07:29:39Z","publisher":"Repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/zenodo.12518216"}],"title":"Data for Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs","ddc":["000"],"type":"research_data_reference","status":"public","month":"06","date_published":"2024-06-24T00:00:00Z","OA_place":"repository","oa":1},{"file":[{"success":1,"file_size":2491151,"date_created":"2025-01-02T12:14:15Z","access_level":"open_access","file_id":"18721","checksum":"0115e9090b478e0644308c6dab58605b","date_updated":"2025-01-02T12:14:15Z","content_type":"application/pdf","relation":"main_file","file_name":"2024_PNAS_Svoboda.pdf","creator":"dernst"}],"year":"2024","department":[{"_id":"KrCh"}],"dataavailabilitystatement":"Code data have been deposited in Code: Amplifiers of Cooperation (DOI: https://doi.org/10.5281/zenodo.10832535)","acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.","researchdata_availability":"yes","OA_type":"hybrid","quality_controlled":"1","fulldoi":"https://doi.org/10.1073/pnas.2405605121","pmid":1,"day":"10","date_updated":"2026-10-16T08:00:05Z","scopus_import":"1","ddc":["000"],"type":"journal_article","APC_amount":"3143,76 EUR","has_accepted_license":"1","status":"public","issue":"50","ec_funded":1,"project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"citation":{"ista":"Svoboda J, Chatterjee K. 2024. Density amplifiers of cooperation for spatial games. Proceedings of the National Academy of Sciences of the United States of America. 121(50), e2405605121.","ieee":"J. Svoboda and K. Chatterjee, “Density amplifiers of cooperation for spatial games,” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 50. National Academy of Sciences, 2024.","chicago":"Svoboda, Jakub, and Krishnendu Chatterjee. “Density Amplifiers of Cooperation for Spatial Games.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2405605121.","ama":"Svoboda J, Chatterjee K. Density amplifiers of cooperation for spatial games. Proceedings of the National Academy of Sciences of the United States of America. 2024;121(50). doi:10.1073/pnas.2405605121","short":"J. Svoboda, K. Chatterjee, Proceedings of the National Academy of Sciences of the United States of America 121 (2024).","mla":"Svoboda, Jakub, and Krishnendu Chatterjee. “Density Amplifiers of Cooperation for Spatial Games.” Proceedings of the National Academy of Sciences of the United States of America, vol. 121, no. 50, e2405605121, National Academy of Sciences, 2024, doi:10.1073/pnas.2405605121.","apa":"Svoboda, J., & Chatterjee, K. (2024). Density amplifiers of cooperation for spatial games. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2405605121"},"intvolume":" 121","publication":"Proceedings of the National Academy of Sciences of the United States of America","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"related_material":{"record":[{"status":"public","id":"20138","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"abstract":[{"text":"Spatial games provide a simple and elegant mathematical model to study the evolution of cooperation in networks. In spatial games, individuals reside in vertices, adopt simple strategies, and interact with neighbors to receive a payoff. Depending on their own and neighbors’ payoffs, individuals can change their strategy. The payoff is determined by the Prisoners’ Dilemma, a classical matrix game, where players cooperate or defect. While cooperation is the desired behavior, defection provides a higher payoff for a selfish individual. There are many theoretical and empirical studies related to the role of the network in the evolution of cooperation. However, the fundamental question of whether there exist networks that for low initial cooperation rate ensure a high chance of fixation, i.e., cooperation spreads across the whole population, has remained elusive for spatial games with strong selection. In this work, we answer this fundamental question in the affirmative by presenting network structures that ensure high fixation probability for cooperators in the strong selection regime. Besides, our structures have many desirable properties: (a) they ensure the spread of cooperation even for a low initial density of cooperation and high temptation of defection, (b) they have constant degrees, and (c) the number of steps, until cooperation spreads, is at most quadratic in the size of the network.","lang":"eng"}],"author":[{"orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","full_name":"Svoboda, Jakub","last_name":"Svoboda"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"}],"external_id":{"isi":["001379596100014"],"pmid":["39642209"]},"article_number":"e2405605121","file_date_updated":"2025-01-02T12:14:15Z","oa_version":"Published Version","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"publication_status":"published","date_created":"2024-12-22T23:01:47Z","article_processing_charge":"Yes","doi":"10.1073/pnas.2405605121","supplementarymaterial":"yes","_id":"18703","publisher":"National Academy of Sciences","article_type":"original","title":"Density amplifiers of cooperation for spatial games","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"month":"12","volume":121,"das_tickbox":"1","date_published":"2024-12-10T00:00:00Z","OA_place":"publisher","oa":1},{"publication":"Logical Methods in Computer Science","citation":{"ama":"Chatterjee K, Doyen L. Stochastic processes with expected stopping time. Logical Methods in Computer Science. 2024;20(4):11:1-11:34. doi:10.46298/lmcs-20(4:11)2024","short":"K. Chatterjee, L. Doyen, Logical Methods in Computer Science 20 (2024) 11:1-11:34.","ieee":"K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” Logical Methods in Computer Science, vol. 20, no. 4. EPI Sciences, p. 11:1-11:34, 2024.","ista":"Chatterjee K, Doyen L. 2024. Stochastic processes with expected stopping time. Logical Methods in Computer Science. 20(4), 11:1-11:34.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Logical Methods in Computer Science. EPI Sciences, 2024. https://doi.org/10.46298/lmcs-20(4:11)2024.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” Logical Methods in Computer Science, vol. 20, no. 4, EPI Sciences, 2024, p. 11:1-11:34, doi:10.46298/lmcs-20(4:11)2024.","apa":"Chatterjee, K., & Doyen, L. (2024). Stochastic processes with expected stopping time. Logical Methods in Computer Science. EPI Sciences. https://doi.org/10.46298/lmcs-20(4:11)2024"},"intvolume":" 20","isi":1,"DOAJ_listed":"1","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"related_material":{"record":[{"status":"public","id":"10004","relation":"earlier_version"}]},"external_id":{"isi":["001367316400002"],"arxiv":["2104.07278"]},"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"abstract":[{"lang":"eng","text":"Markov chains are the de facto finite-state model for stochastic dynamical systems, and Markov decision processes (MDPs) extend Markov chains by incorporating non-deterministic behaviors. Given an MDP and rewards on states, a classical optimization criterion is the maximal expected total reward where the MDP stops after T steps, which can be computed by a simple dynamic programming algorithm. We consider a natural generalization of the problem where the stopping times can be chosen according to a probability distribution, such that the expected stopping time is T, to optimize the expected total reward. Quite surprisingly we establish inter-reducibility of the expected stopping-time problem for Markov chains with the Positivity problem (which is related to the well-known Skolem problem), for which establishing either decidability or undecidability would be a major breakthrough. Given the hardness of the exact problem, we consider the approximate version of the problem: we show that it can be solved in exponential time for Markov chains and in exponential space for MDPs."}],"file_date_updated":"2024-12-09T08:38:48Z","oa_version":"Published Version","publication_identifier":{"eissn":["1860-5974"]},"publication_status":"published","article_processing_charge":"Yes","doi":"10.46298/lmcs-20(4:11)2024","date_created":"2024-12-08T23:01:56Z","_id":"18630","supplementarymaterial":"no","publisher":"EPI Sciences","article_type":"original","title":"Stochastic processes with expected stopping time","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"month":"11","volume":20,"oa":1,"das_tickbox":"0","date_published":"2024-11-12T00:00:00Z","OA_place":"publisher","arxiv":1,"year":"2024","file":[{"date_updated":"2024-12-09T08:38:48Z","relation":"main_file","file_name":"2024_LMCS_Chatterjee.pdf","content_type":"application/pdf","creator":"dernst","success":1,"file_size":416814,"checksum":"b3315c74ce18ce0a30ed33d8c9972992","date_created":"2024-12-09T08:38:48Z","file_id":"18633","access_level":"open_access"}],"department":[{"_id":"KrCh"}],"acknowledgement":"The authors are grateful to the anonymous reviewers of LICS 2021 and of a previous version of this paper for insightful comments that helped improving the presentation. The research presented in this paper was partially supported by the grant ERC CoG 863818 (ForM-SMArt).","quality_controlled":"1","researchdata_availability":"no","OA_type":"gold","day":"12","date_updated":"2026-10-16T07:57:38Z","fulldoi":"https://doi.org/10.46298/lmcs-20(4:11)2024","scopus_import":"1","ddc":["000"],"type":"journal_article","status":"public","has_accepted_license":"1","alternative_title":["LMCS"],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"ec_funded":1,"issue":"4","page":"11:1-11:34"}]