{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:29:07Z","timestamp":1759940947247,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANID FONDECYT","award":["3210805"],"award-info":[{"award-number":["3210805"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467940","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"67-76","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Diversity, Fairness, and Sustainability in Population Protocols"],"prefix":"10.1145","author":[{"given":"Nan","family":"Kang","sequence":"first","affiliation":[{"name":"King's College London, London, United Kingdom"}]},{"given":"Frederik","family":"Mallmann-Trenn","sequence":"additional","affiliation":[{"name":"King's College London, London, United Kingdom"}]},{"given":"Nicol\u00e1s","family":"Rivera","sequence":"additional","affiliation":[{"name":"IMFD & Universidad de Valpara\u00edso, Valparaiso, Chile"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Reversible Markov Chains and Random Walks on Graphs. (2002). Unfinished monograph, recompiled","author":"Aldous David","year":"2014","unstructured":"David Aldous and James Allen Fill . 2002. Reversible Markov Chains and Random Walks on Graphs. (2002). Unfinished monograph, recompiled 2014 , available at http:\/\/www.stat.berkeley.edu\/simaldous\/RWG\/book.html. David Aldous and James Allen Fill. 2002. Reversible Markov Chains and Random Walks on Graphs. (2002). Unfinished monograph, recompiled 2014, available at http:\/\/www.stat.berkeley.edu\/simaldous\/RWG\/book.html."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-PS184"},{"key":"e_1_3_2_2_3_1","volume-title":"26th Annual European Symposium on Algorithms (ESA 2018) (Leibniz International Proceedings in Informatics (LIPIcs)),","author":"Becchetti Luca","year":"2018","unstructured":"Luca Becchetti , Andrea Clementi , Pasin Manurangsi , Emanuele Natale , Francesco Pasquale , Prasad Raghavendra , and Luca Trevisan . 2018. Average Whenever You Meet: Opportunistic Protocols for Community Detection . In 26th Annual European Symposium on Algorithms (ESA 2018) (Leibniz International Proceedings in Informatics (LIPIcs)), , Yossi Azar, Hannah Bast, and Grzegorz Herman (Eds.), Vol. 112 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany , 7:1--7:13. https:\/\/doi.org\/10.4230\/LIPIcs.ESA. 2018 .7 Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, and Luca Trevisan. 2018. Average Whenever You Meet: Opportunistic Protocols for Community Detection. In 26th Annual European Symposium on Algorithms (ESA 2018) (Leibniz International Proceedings in Informatics (LIPIcs)), , Yossi Azar, Hannah Bast, and Grzegorz Herman (Eds.), Vol. 112. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 7:1--7:13. https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.7"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Luca Becchetti Andrea Clementi Emanuele Natale Francesco Pasquale and Riccardo Silvestri. 2015a. Plurality Consensus in the Gossip Model. In SODA. 371--390.  Luca Becchetti Andrea Clementi Emanuele Natale Francesco Pasquale and Riccardo Silvestri. 2015a. Plurality Consensus in the Gossip Model. In SODA. 371--390.","DOI":"10.1137\/1.9781611973730.27"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.27"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch46"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384312"},{"key":"e_1_3_2_2_8_1","volume-title":"The critical contact process dies out. The Annals of Probability","author":"Bezuidenhout Carol","year":"1990","unstructured":"Carol Bezuidenhout and Geoffrey Grimmett . 1990. The critical contact process dies out. The Annals of Probability ( 1990 ), 1462--1482. Carol Bezuidenhout and Geoffrey Grimmett. 1990. The critical contact process dies out. The Annals of Probability (1990), 1462--1482."},{"key":"e_1_3_2_2_9_1","volume-title":"Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. In STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) , , Thomas Wilke Christoph D\u00fcrr (Ed.)","volume":"14","author":"Chung Kai-Min","year":"2012","unstructured":"Kai-Min Chung , Henry Lam , Zhenming Liu , and Michael Mitzenmacher . 2012 . Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. In STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) , , Thomas Wilke Christoph D\u00fcrr (Ed.) , Vol. 14 . LIPIcs , Paris, France, 124--135. https:\/\/hal.archives-ouvertes.fr\/hal-00678208 Kai-Min Chung, Henry Lam, Zhenming Liu, and Michael Mitzenmacher. 2012. Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. In STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) , , Thomas Wilke Christoph D\u00fcrr (Ed.), Vol. 14. LIPIcs , Paris, France, 124--135. https:\/\/hal.archives-ouvertes.fr\/hal-00678208"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/120900368"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43951-7_37"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Colin Cooper Robert Els\"a sser Tomasz Radzik Nicola\u00e1s Rivera and Takeharu Shiraga. 2015. Fast Consensus for Voting on General Expander Graphs. In DISC . 248--262.  Colin Cooper Robert Els\"a sser Tomasz Radzik Nicola\u00e1s Rivera and Takeharu Shiraga. 2015. Fast Consensus for Voting on General Expander Graphs. In DISC . 248--262.","DOI":"10.1007\/978-3-662-48653-5_17"},{"key":"e_1_3_2_2_13_1","volume-title":"Fast Plurality Consensus in Regular Expanders. In 31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), , Andr\u00e9a W. Richa (Ed.)","volume":"91","author":"Cooper Colin","year":"2017","unstructured":"Colin Cooper , Tomasz Radzik , Nicol\u00e1s Rivera , and Takeharu Shiraga . 2017 . Fast Plurality Consensus in Regular Expanders. In 31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), , Andr\u00e9a W. Richa (Ed.) , Vol. 91 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 13:1--13:16. https:\/\/doi.org\/10.4230\/LIPIcs.DISC. 2017.13 Colin Cooper, Tomasz Radzik, Nicol\u00e1s Rivera, and Takeharu Shiraga. 2017. Fast Plurality Consensus in Regular Expanders. In 31st International Symposium on Distributed Computing (DISC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), , Andr\u00e9a W. Richa (Ed.), Vol. 91. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 13:1--13:16. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2017.13"},{"key":"e_1_3_2_2_14_1","volume-title":"DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings . 46--60","author":"Cornejo Alejandro","year":"2014","unstructured":"Alejandro Cornejo , Anna R. Dornhaus , Nancy A. Lynch , and Radhika Nagpal . 2014 . Task Allocation in Ant Colonies. In Distributed Computing - 28th International Symposium , DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings . 46--60 . https:\/\/doi.org\/10.1007\/978--3--662--45174--8_4 Alejandro Cornejo, Anna R. Dornhaus, Nancy A. Lynch, and Radhika Nagpal. 2014. Task Allocation in Ant Colonies. In Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings . 46--60. https:\/\/doi.org\/10.1007\/978--3--662--45174--8_4"},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018","author":"Cruciani Emilio","year":"2018","unstructured":"Emilio Cruciani , Emanuele Natale , Andr\u00e9 Nusser , and Giacomo Scornavacca . 2018 . Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks . In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018 , Stockholm, Sweden, July 10--15 , 2018 . 777--785. http:\/\/dl.acm.org\/citation.cfm?id=3237499 Emilio Cruciani, Emanuele Natale, Andr\u00e9 Nusser, and Giacomo Scornavacca. 2018. Phase Transition of the 2-Choices Dynamics on Core-Periphery Networks. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10--15, 2018 . 777--785. http:\/\/dl.acm.org\/citation.cfm?id=3237499"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33016046"},{"key":"e_1_3_2_2_17_1","volume-title":"Algorithms and Techniques (APPROX\/RANDOM 2014)","volume":"28","author":"D\u00edaz Josep","year":"2014","unstructured":"Josep D\u00edaz , Leslie Ann Goldberg , David Richerby , and Maria Serna . 2014 . Absorption Time of the Moran Process. In Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques (APPROX\/RANDOM 2014) , Vol. 28 . 630--642. https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2014.630 Josep D\u00edaz, Leslie Ann Goldberg, David Richerby, and Maria Serna. 2014. Absorption Time of the Moran Process. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2014) , Vol. 28. 630--642. https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2014.630"},{"key":"e_1_3_2_2_18_1","volume-title":"Self-Stabilizing Task Allocation In Spite of Noise. CoRR","author":"Dornhaus Anna R.","year":"2018","unstructured":"Anna R. Dornhaus , Nancy A. Lynch , Frederik Mallmann-Trenn , Dominik Pajak , and Tsvetomira Radeva . 2018. Self-Stabilizing Task Allocation In Spite of Noise. CoRR , Vol. abs\/ 1805 .03691 ( 2018 ). arxiv: 1805.03691 http:\/\/arxiv.org\/abs\/1805.03691 Anna R. Dornhaus, Nancy A. Lynch, Frederik Mallmann-Trenn, Dominik Pajak, and Tsvetomira Radeva. 2018. Self-Stabilizing Task Allocation In Spite of Noise. CoRR , Vol. abs\/1805.03691 (2018). arxiv: 1805.03691 http:\/\/arxiv.org\/abs\/1805.03691"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.59"},{"key":"e_1_3_2_2_20_1","volume-title":"arxiv: cs.DC\/2105.09926","author":"Kang Nan","year":"2021","unstructured":"Nan Kang , Frederik Mallmann-Trenn , and Nicol\u00e1s Rivera . 2021. Diversity, Fairness, and Sustainability in Population Protocols . ( 2021 ). arxiv: cs.DC\/2105.09926 Nan Kang, Frederik Mallmann-Trenn, and Nicol\u00e1s Rivera. 2021. Diversity, Fairness, and Sustainability in Population Protocols. (2021). arxiv: cs.DC\/2105.09926"},{"key":"e_1_3_2_2_21_1","volume-title":"Best-of-Three Voting on Dense Graphs. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '19)","author":"Kang Nan","year":"2019","unstructured":"Nan Kang and Nicol\u00e1s Rivera . 2019 . Best-of-Three Voting on Dense Graphs. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '19) . Association for Computing Machinery, New York, NY, USA, 115--121. https:\/\/doi.org\/10.1145\/3323165.3323207 Nan Kang and Nicol\u00e1s Rivera. 2019. Best-of-Three Voting on Dense Graphs. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '19). Association for Computing Machinery, New York, NY, USA, 115--121. https:\/\/doi.org\/10.1145\/3323165.3323207"},{"key":"e_1_3_2_2_22_1","volume-title":"Nature","volume":"433","author":"Lieberman E.","year":"2005","unstructured":"E. Lieberman , C. Hauert , and M. Nowak . 2005. Evolutionary dynamics on graphs . Nature , Vol. 433 , 7023 (20 Jan. 2005 ), 312--316. https:\/\/doi.org\/10.1038\/nature03204 E. Lieberman, C. Hauert, and M. Nowak. 2005. Evolutionary dynamics on graphs . Nature , Vol. 433, 7023 (20 Jan. 2005), 312--316. https:\/\/doi.org\/10.1038\/nature03204"},{"volume-title":"Stochastic interacting systems: contact, voter and exclusion processes","author":"Liggett Thomas M","key":"e_1_3_2_2_23_1","unstructured":"Thomas M Liggett . 2099. Stochastic interacting systems: contact, voter and exclusion processes . Springer . Thomas M Liggett. 2099. Stochastic interacting systems: contact, voter and exclusion processes .Springer."},{"key":"e_1_3_2_2_24_1","volume-title":"46th International Colloquium on Automata, Languages, and Programming, ICALP 2019","author":"Mallmann-Trenn Frederik","year":"2019","unstructured":"Frederik Mallmann-Trenn , Yannic Maus , and Dominik Pajak . 2019 . Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019 , July 9 --12 , 2019, Patras, Greece. 148:1--148:16. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.148 Frederik Mallmann-Trenn, Yannic Maus, and Dominik Pajak. 2019. Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9--12, 2019, Patras, Greece. 148:1--148:16. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.148"},{"key":"e_1_3_2_2_25_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming, ICALP 2018","author":"Mallmann-Trenn Frederik","year":"2018","unstructured":"Frederik Mallmann-Trenn , Cameron Musco , and Christopher Musco . 2018 . Eigenvector Computation and Community Detection in Asynchronous Gossip Models. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 , July 9 --13 , 2018, Prague, Czech Republic. 159:1--159:14. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.159 Frederik Mallmann-Trenn, Cameron Musco, and Christopher Musco. 2018. Eigenvector Computation and Community Detection in Asynchronous Gossip Models. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9--13, 2018, Prague, Czech Republic. 159:1--159:14. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.159"},{"key":"e_1_3_2_2_26_1","volume-title":"Six Susceptible-Infected-Susceptible Models on Scale-free Networks. Scientific reports","author":"Morita Satoru","year":"2016","unstructured":"Satoru Morita . 2016. Six Susceptible-Infected-Susceptible Models on Scale-free Networks. Scientific reports , Vol. 6 ( 2016 ). Satoru Morita. 2016. Six Susceptible-Infected-Susceptible Models on Scale-free Networks. Scientific reports , Vol. 6 (2016)."},{"key":"e_1_3_2_2_27_1","volume-title":"meeting, coalescing and returning. In Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019","author":"Roberto","year":"2019","unstructured":"Roberto I. Oliveira and Yuval Peres. 2019. Random walks on graphs: new bounds on hitting , meeting, coalescing and returning. In Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019 , San Diego, CA, USA , January 6, 2019 . 119--126. Roberto I. Oliveira and Yuval Peres. 2019. Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. In Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019. 119--126."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743520"},{"key":"e_1_3_2_2_29_1","volume-title":"Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems. PLoS computational biology","author":"Radeva Tsvetomira","year":"2017","unstructured":"Tsvetomira Radeva , Anna Dornhaus , Nancy Lynch , Radhika Nagpal , and Hsin-Hao Su. 2017. Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems. PLoS computational biology , Vol. 13 , 12 ( 2017 ), e1005904. Tsvetomira Radeva, Anna Dornhaus, Nancy Lynch, Radhika Nagpal, and Hsin-Hao Su. 2017. Costs of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systems. PLoS computational biology , Vol. 13, 12 (2017), e1005904."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1043862425"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.9.1_97"},{"key":"e_1_3_2_2_32_1","volume-title":"2019 b. Uniform partition in population protocol model under weak fairness. arXiv preprint arXiv:1911.04678","author":"Yasumi Hiroto","year":"2019","unstructured":"Hiroto Yasumi , Fukuhito Ooshita , and Michiko Inoue . 2019 b. Uniform partition in population protocol model under weak fairness. arXiv preprint arXiv:1911.04678 ( 2019 ). Hiroto Yasumi, Fukuhito Ooshita, and Michiko Inoue. 2019 b. Uniform partition in population protocol model under weak fairness. arXiv preprint arXiv:1911.04678 (2019)."},{"key":"e_1_3_2_2_33_1","volume-title":"21st International Conference on Principles of Distributed Systems (OPODIS","author":"Yasumi Hiroto","year":"2018","unstructured":"Hiroto Yasumi , Fukuhito Ooshita , Ken'ichi Yamaguchi , and Michiko Inoue . 2018 . Constant-space population protocols for uniform bipartition . In 21st International Conference on Principles of Distributed Systems (OPODIS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Hiroto Yasumi, Fukuhito Ooshita, Ken'ichi Yamaguchi, and Michiko Inoue. 2018. Constant-space population protocols for uniform bipartition. In 21st International Conference on Principles of Distributed Systems (OPODIS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '21"},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467940","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:11Z","timestamp":1750191431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":33,"alternative-id":["10.1145\/3465084.3467940","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467940","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}