{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:44Z","timestamp":1750219784159,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599340","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"25-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair Allocation Over Time, with Applications to Content Moderation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9919-0606","authenticated-orcid":false,"given":"Amine","family":"Allouah","sequence":"first","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9009-8683","authenticated-orcid":false,"given":"Christian","family":"Kroer","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6535-5449","authenticated-orcid":false,"given":"Xuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3045-691X","authenticated-orcid":false,"given":"Vashist","family":"Avadhanula","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7378-9367","authenticated-orcid":false,"given":"Nona","family":"Bohanon","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7566-4521","authenticated-orcid":false,"given":"Anil","family":"Dania","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7725-8309","authenticated-orcid":false,"given":"Caner","family":"Gocmen","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4089-673X","authenticated-orcid":false,"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3019-2144","authenticated-orcid":false,"given":"Parikshit","family":"Shah","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6380-1516","authenticated-orcid":false,"given":"Nicolas","family":"Stier-Moses","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4110-8754","authenticated-orcid":false,"given":"Ken Rodr\u00edguez","family":"Taarup","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_2_1","volume-title":"Nash-Bargaining, and other Rules. arXiv preprint arXiv:2006.15747","author":"Aziz Haris","year":"2020","unstructured":"Haris Aziz and Ethan Brown . 2020. Random Assignment Under Bi-Valued Utilities: Analyzing Hylland-Zeckhauser , Nash-Bargaining, and other Rules. arXiv preprint arXiv:2006.15747 ( 2020 ). Haris Aziz and Ethan Brown. 2020. Random Assignment Under Bi-Valued Utilities: Analyzing Hylland-Zeckhauser, Nash-Bargaining, and other Rules. arXiv preprint arXiv:2006.15747 (2020)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/6"},{"key":"e_1_3_2_2_4_1","volume-title":"AAMAS 2018--17th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 766--773","author":"Bampis Evripidis","year":"2018","unstructured":"Evripidis Bampis , Bruno Escoffier , and Sasa Mladenovic . 2018 . Fair resource allocation over time . In AAMAS 2018--17th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 766--773 . Evripidis Bampis, Bruno Escoffier, and Sasa Mladenovic. 2018. Fair resource allocation over time. In AAMAS 2018--17th International Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, 766--773."},{"key":"e_1_3_2_2_5_1","volume-title":"Will AI take over content moderation? Mind Matters News","author":"Bassett Caitlin","year":"2022","unstructured":"Caitlin Bassett . 2022. Will AI take over content moderation? Mind Matters News ( 2022 ). https:\/\/mindmatters.ai\/2022\/01\/will-ai-take-over-content-moderation\/ Caitlin Bassett. 2022. Will AI take over content moderation? Mind Matters News (2022). https:\/\/mindmatters.ai\/2022\/01\/will-ai-take-over-content-moderation\/"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355902"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706369"},{"volume-title":"Facebook Community Standards. https:\/\/transparency.fb.com\/policies\/community-standards\/ Online","year":"2022","key":"e_1_3_2_2_8_1","unstructured":"Facebook. 2022. Facebook Community Standards. https:\/\/transparency.fb.com\/policies\/community-standards\/ Online ; accessed 7- February - 2022 . Facebook. 2022. Facebook Community Standards. https:\/\/transparency.fb.com\/policies\/community-standards\/ Online; accessed 7-February-2022."},{"volume-title":"Resource allocation and the public sector","author":"Foley Duncan Karl","key":"e_1_3_2_2_9_1","unstructured":"Duncan Karl Foley . 1966. Resource allocation and the public sector . Yale University . Duncan Karl Foley. 1966. Resource allocation and the public sector. Yale University."},{"key":"e_1_3_2_2_10_1","volume-title":"Equitable allocations of indivisible goods. arXiv preprint arXiv:1905.10656","author":"Freeman Rupert","year":"2019","unstructured":"Rupert Freeman , Sujoy Sikdar , Rohit Vaish , and Lirong Xia . 2019. Equitable allocations of indivisible goods. arXiv preprint arXiv:1905.10656 ( 2019 ). Rupert Freeman, Sujoy Sikdar, Rohit Vaish, and Lirong Xia. 2019. Equitable allocations of indivisible goods. arXiv preprint arXiv:1905.10656 (2019)."},{"key":"e_1_3_2_2_11_1","unstructured":"Evrard Garcelon Vashist Avadhanula Alessandro Lazaric etal 2021. Top K Ranking for Multi-Armed Bandit with Noisy Evaluations. arXiv preprint arXiv:2112.06517 (2021).  Evrard Garcelon Vashist Avadhanula Alessandro Lazaric et al. 2021. Top K Ranking for Multi-Armed Bandit with Noisy Evaluations. arXiv preprint arXiv:2112.06517 (2021)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1177\/2053951720943234"},{"key":"e_1_3_2_2_13_1","volume-title":"Scalable Prediction of Information Cascades over Arbitrary Time Horizons. arXiv preprint arXiv:2009.02092","author":"Haimovich Daniel","year":"2020","unstructured":"Daniel Haimovich , Dima Karamshuk , Thomas J Leeper , Evgeniy Riabenko , and Milan Vojnovic . 2020. Scalable Prediction of Information Cascades over Arbitrary Time Horizons. arXiv preprint arXiv:2009.02092 ( 2020 ). Daniel Haimovich, Dima Karamshuk, Thomas J Leeper, Evgeniy Riabenko, and Milan Vojnovic. 2020. Scalable Prediction of Information Cascades over Arbitrary Time Horizons. arXiv preprint arXiv:2009.02092 (2020)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64946-3_26"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.11.011"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338243"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274641"},{"key":"e_1_3_2_2_18_1","volume-title":"QUEST: Queue Simulation for Content Moderation at Scale. arXiv preprint arXiv:2103.16816","author":"Makhijani Rahul","year":"2021","unstructured":"Rahul Makhijani , Parikshit Shah , Vashist Avadhanula , Caner Gocmen , Nicol\u00e1s E Stier-Moses , and Juli\u00e1n Mestre . 2021 . QUEST: Queue Simulation for Content Moderation at Scale. arXiv preprint arXiv:2103.16816 (2021). Rahul Makhijani, Parikshit Shah, Vashist Avadhanula, Caner Gocmen, Nicol\u00e1s E Stier-Moses, and Juli\u00e1n Mestre. 2021. QUEST: Queue Simulation for Content Moderation at Scale. arXiv preprint arXiv:2103.16816 (2021)."},{"volume-title":"Community Standards Enforcement Report. https:\/\/transparency.fb.com\/data\/community-standards-enforcement\/ Online","year":"2023","key":"e_1_3_2_2_19_1","unstructured":"Meta. 2022. Community Standards Enforcement Report. https:\/\/transparency.fb.com\/data\/community-standards-enforcement\/ Online ; accessed 31- January - 2023 . Meta. 2022. Community Standards Enforcement Report. https:\/\/transparency.fb.com\/data\/community-standards-enforcement\/ Online; accessed 31-January-2023."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.2307\/1906951"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403304"},{"key":"e_1_3_2_2_22_1","unstructured":"Justin Osofsky. 2019. Our Commitment to Our Content Reviewers. (2019). https:\/\/about.fb.com\/news\/2019\/02\/commitment-to-content-reviewers\/  Justin Osofsky. 2019. Our Commitment to Our Content Reviewers. (2019). https:\/\/about.fb.com\/news\/2019\/02\/commitment-to-content-reviewers\/"},{"key":"e_1_3_2_2_23_1","volume-title":"Two-Sided and Non-Bipartite. arXiv preprint arXiv:2106.02024","author":"Panageas Ioannis","year":"2021","unstructured":"Ioannis Panageas , Thorben Tr\u00f6bst , and Vijay V Vazirani . 2021. Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided , Two-Sided and Non-Bipartite. arXiv preprint arXiv:2106.02024 ( 2021 ). Ioannis Panageas, Thorben Tr\u00f6bst, and Vijay V Vazirani. 2021. Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite. arXiv preprint arXiv:2106.02024 (2021)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M124397X"},{"key":"e_1_3_2_2_25_1","volume-title":"Third Quarter","author":"Rosen Guy","year":"2022","unstructured":"Guy Rosen . 2022. Community Standards Enforcement Report , Third Quarter 2022 . (2022). https:\/\/about.fb.com\/news\/2022\/11\/integrity-and-transparency-reports-q3-2022\/ Guy Rosen. 2022. Community Standards Enforcement Report, Third Quarter 2022. (2022). https:\/\/about.fb.com\/news\/2022\/11\/integrity-and-transparency-reports-q3-2022\/"},{"key":"e_1_3_2_2_26_1","volume-title":"Twitter, YouTube and others. CNBC","author":"Schoolov Katie","year":"2021","unstructured":"Katie Schoolov . 2021. Why content moderation costs billions and is so tricky for Facebook , Twitter, YouTube and others. CNBC ( 2021 ). https:\/\/www.cnbc.com\/2021\/02\/27\/content-moderation-on-social-media.html Katie Schoolov. 2021. Why content moderation costs billions and is so tricky for Facebook, Twitter, YouTube and others. CNBC (2021). https:\/\/www.cnbc.com\/2021\/02\/27\/content-moderation-on-social-media.html"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(74)90075-1"},{"key":"e_1_3_2_2_28_1","volume-title":"Departement of Mathematics","author":"Wilson Stephen J","year":"1998","unstructured":"Stephen J Wilson . 1998. Fair division using linear programming. preprint , Departement of Mathematics , Iowa State University ( 1998 ). Stephen J Wilson. 1998. Fair division using linear programming. preprint, Departement of Mathematics, Iowa State University (1998)."}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Long Beach CA USA","acronym":"KDD '23"},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599340","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:47Z","timestamp":1750178267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":27,"alternative-id":["10.1145\/3580305.3599340","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599340","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}