{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T17:28:23Z","timestamp":1784050103762,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["IIS-2147187,CCF-2007080,IIS-2024287,CCF-1733556"],"award-info":[{"award-number":["IIS-2147187,CCF-2007080,IIS-2024287,CCF-1733556"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-1-2488"],"award-info":[{"award-number":["N00014-20-1-2488"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538285","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"436-465","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Fair Allocations for Smoothed Utilities"],"prefix":"10.1145","author":[{"given":"Yushi","family":"Bai","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uriel","family":"Feige","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"G\u00f6lz","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel D.","family":"Procaccia","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147173"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-6419.1994.tb00098.x"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64946-3_24"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI). 39--45","author":"Aziz H.","year":"2020","unstructured":"H. Aziz and S. Rey . 2020. Almost Group Envy-Free Allocation of Indivisible Goods and Chores . In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI). 39--45 . https:\/\/doi.org\/10.24963\/ijcai. 2020 \/6 10.24963\/ijcai.2020 H. Aziz and S. Rey. 2020. Almost Group Envy-Free Allocation of Indivisible Goods and Chores. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI). 39--45. https:\/\/doi.org\/10.24963\/ijcai.2020\/6"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI). https:\/\/arxiv.org\/pdf\/2109","author":"Bai Y.","unstructured":"Y. Bai and P. G\u00f6lz . 2022. Envy-Free and Pareto-Optimal Allocations for Agents with Asymmetric Random Valuations . In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI). https:\/\/arxiv.org\/pdf\/2109 .08971.pdf. Y. Bai and P. G\u00f6lz. 2022. Envy-Free and Pareto-Optimal Allocations for Agents with Asymmetric Random Valuations. In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI). https:\/\/arxiv.org\/pdf\/2109.08971.pdf."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 19th ACM Conference on Economics and Computation (EC). 557--574","author":"Barman S.","year":"1916","unstructured":"S. Barman , S. K. Krishnamurthy , and R. Vaish . 2018. Finding Fair and Efficient Allocations . In Proceedings of the 19th ACM Conference on Economics and Computation (EC). 557--574 . https:\/\/doi.org\/10.1145\/32 1916 6.3219176 10.1145\/3219166.3219176 S. Barman, S. K. Krishnamurthy, and R. Vaish. 2018. Finding Fair and Efficient Allocations. In Proceedings of the 19th ACM Conference on Economics and Computation (EC). 557--574. https:\/\/doi.org\/10.1145\/3219166.3219176"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120680.1120683"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2351--2363","author":"Blum A.","year":"1974","unstructured":"A. Blum , I. Caragiannis , N. Haghtalab , A. D. Procaccia , E. B. Procaccia , and R. Vaish . 2017. Opting into Optimal Matchings . In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2351--2363 . https:\/\/doi.org\/10.1137\/1.978161 1974 782.155 10.1137\/1.9781611974782.155 A. Blum, I. Caragiannis, N. Haghtalab, A. D. Procaccia, E. B. Procaccia, and R. Vaish. 2017. Opting into Optimal Matchings. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2351--2363. https:\/\/doi.org\/10.1137\/1.9781611974782.155"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 22nd ACM Conference on Economics and Computation (EC). https:\/\/doi.org\/10","author":"Blum A.","unstructured":"A. Blum and P. G\u00f6lz . 2021. Incentive-Compatible Kidney Exchange in a Slightly Semi-Random Model . In Proceedings of the 22nd ACM Conference on Economics and Computation (EC). https:\/\/doi.org\/10 .1145\/3465456.3467622 10.1145\/3465456.3467622 A. Blum and P. G\u00f6lz. 2021. Incentive-Compatible Kidney Exchange in a Slightly Semi-Random Model. In Proceedings of the 22nd ACM Conference on Economics and Computation (EC). https:\/\/doi.org\/10.1145\/3465456.3467622"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1034"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA14564"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355902"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 21st ACM Conference on Economics and Computation (EC). 1--19","author":"Chaudhury B. R.","unstructured":"B. R. Chaudhury , J. Garg , and K. Mehlhorn . 2020. EFX Exists for Three Agents . In Proceedings of the 21st ACM Conference on Economics and Computation (EC). 1--19 . https:\/\/doi.org\/10.1145\/3391403.3399511 10.1145\/3391403.3399511 B. R. Chaudhury, J. Garg, and K. Mehlhorn. 2020. EFX Exists for Three Agents. In Proceedings of the 21st ACM Conference on Economics and Computation (EC). 1--19. https:\/\/doi.org\/10.1145\/3391403.3399511"},{"key":"e_1_3_2_1_15_1","volume-title":"Envy-Free Cake Cutting: A Polynomial Number of Queries with High Probability. arxiv","author":"Ch\u00e8ze G.","year":"2005","unstructured":"G. Ch\u00e8ze . 2021. Envy-Free Cake Cutting: A Polynomial Number of Queries with High Probability. arxiv : 2005 .01982 G. Ch\u00e8ze. 2021. Envy-Free Cake Cutting: A Polynomial Number of Queries with High Probability. arxiv: 2005.01982"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 2017 ACM Conference on Economics and Computation (EC). 629--646","author":"Conitzer V.","unstructured":"V. Conitzer , R. Freeman , and N. Shah . 2017. Fair Public Decision Making . In Proceedings of the 2017 ACM Conference on Economics and Computation (EC). 629--646 . https:\/\/doi.org\/10.1145\/3033274.3085125 10.1145\/3033274.3085125 V. Conitzer, R. Freeman, and N. Shah. 2017. Fair Public Decision Making. In Proceedings of the 2017 ACM Conference on Economics and Computation (EC). 629--646. https:\/\/doi.org\/10.1145\/3033274.3085125"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI). 1405--1411","author":"Dickerson J. P.","unstructured":"J. P. Dickerson , J. Goldman , J. Karp , A. D. Procaccia , and T. Sandholm . 2014. The Computational Rise and Fall of Fairness . In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI). 1405--1411 . https:\/\/dl.acm.org\/doi\/10.5555\/2893873.2894091 J. P. Dickerson, J. Goldman, J. Karp, A. D. Procaccia, and T. Sandholm. 2014. The Computational Rise and Fall of Fairness. In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI). 1405--1411. https:\/\/dl.acm.org\/doi\/10.5555\/2893873.2894091"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11291"},{"key":"e_1_3_2_1_19_1","volume-title":"Beyond the Worst-Case Analysis of Algorithms","author":"Feige U.","unstructured":"U. Feige . 2021. Introduction to Semi-Random Models . In Beyond the Worst-Case Analysis of Algorithms , T. Roughgarden (Ed.). Cambridge University Press , 189--211. https:\/\/doi.org\/10.1017\/9781108637435.013 10.1017\/9781108637435.013 U. Feige. 2021. Introduction to Semi-Random Models. In Beyond the Worst-Case Analysis of Algorithms, T. Roughgarden (Ed.). Cambridge University Press, 189--211. https:\/\/doi.org\/10.1017\/9781108637435.013"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 674--683","author":"Feige U.","year":"1998","unstructured":"U. Feige and J. Kilian . 1998. Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs . In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 674--683 . https:\/\/doi.org\/10.1109\/SFCS. 1998 .743518 10.1109\/SFCS.1998.743518 U. Feige and J. Kilian. 1998. Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 674--683. https:\/\/doi.org\/10.1109\/SFCS.1998.743518"},{"key":"e_1_3_2_1_21_1","volume-title":"The Stanford Encyclopedia of Philosophy summer 2021 edition ed.)","author":"Fleurbaey M.","year":"2021","unstructured":"M. Fleurbaey . 2021. Economics and Economic Justice . In The Stanford Encyclopedia of Philosophy summer 2021 edition ed.) , E. N. Zalta (Ed.). https:\/\/plato.stanford.edu\/archives\/sum 2021 \/entries\/economic-justice\/ M. Fleurbaey. 2021. Economics and Economic Justice. In The Stanford Encyclopedia of Philosophy summer 2021 edition ed.), E. N. Zalta (Ed.). https:\/\/plato.stanford.edu\/archives\/sum2021\/entries\/economic-justice\/"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI). 280--286","author":"Freeman R.","year":"2019","unstructured":"R. Freeman , S. Sikdar , R. Vaish , and L. Xia . 2019. Equitable Allocations of Indivisible Goods . In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI). 280--286 . https:\/\/doi.org\/10.24963\/ijcai. 2019 \/40 10.24963\/ijcai.2019 R. Freeman, S. Sikdar, R. Vaish, and L. Xia. 2019. Equitable Allocations of Indivisible Goods. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI). 280--286. https:\/\/doi.org\/10.24963\/ijcai.2019\/40"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2728732.2728738"},{"key":"#cr-split#-e_1_3_2_1_24_1.1","doi-asserted-by":"crossref","unstructured":"A. Gupta and S. Singla. 2021. Random-Order Models. In Beyond the Worst-Case Analysis of Algorithms T. Roughgarden (Ed.). Cambridge University Press 234--258. https:\/\/doi.org\/10.1017\/9781108637435.015 10.1017\/9781108637435.015","DOI":"10.1017\/9781108637435.015"},{"key":"#cr-split#-e_1_3_2_1_24_1.2","doi-asserted-by":"crossref","unstructured":"A. Gupta and S. Singla. 2021. Random-Order Models. In Beyond the Worst-Case Analysis of Algorithms T. Roughgarden (Ed.). Cambridge University Press 234--258. https:\/\/doi.org\/10.1017\/9781108637435.015","DOI":"10.1017\/9781108637435.015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11238-007-9069-8"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC). 587--596","author":"Karande C.","year":"1993","unstructured":"C. Karande , A. Mehta , and P. Tripathi . 2011. Online Bipartite Matching with Unknown Distributions . In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC). 587--596 . https:\/\/doi.org\/10.1145\/ 1993 636.1993715 10.1145\/1993636.1993715 C. Karande, A. Mehta, and P. Tripathi. 2011. Online Bipartite Matching with Unknown Distributions. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC). 587--596. https:\/\/doi.org\/10.1145\/1993636.1993715"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 7th Annual ACM -SIAM Symposium on Discrete Algorithms (SODA). 359--364","author":"Kenyon C.","year":"1996","unstructured":"C. Kenyon . 1996 . Best-Fit Bin-Packing with Random Order . In Proceedings of the 7th Annual ACM -SIAM Symposium on Discrete Algorithms (SODA). 359--364 . https:\/\/dl.acm.org\/doi\/10.5555\/313852.314083 C. Kenyon. 1996. Best-Fit Bin-Packing with Random Order. In Proceedings of the 7th Annual ACM -SIAM Symposium on Discrete Algorithms (SODA). 359--364. https:\/\/dl.acm.org\/doi\/10.5555\/313852.314083"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.78"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI). 523--529","author":"Kurokawa D.","unstructured":"D. Kurokawa , A. D. Procaccia , and J. Wang . 2016. When Can the Maximin Share Guarantee Be Guaranteed? . In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI). 523--529 . http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/12282 D. Kurokawa, A. D. Procaccia, and J. Wang. 2016. When Can the Maximin Share Guarantee Be Guaranteed?. In Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI). 523--529. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/12282"},{"key":"e_1_3_2_1_30_1","volume-title":"Approximation Algorithms for Scheduling Unrelated Parallel Machines. Mathematical programming","author":"Lenstra J. K.","year":"1990","unstructured":"J. K. Lenstra , D. B. Shmoys , and \u00c9. Tardos. 1990. Approximation Algorithms for Scheduling Unrelated Parallel Machines. Mathematical programming , Vol. 46 , 1 ( 1990 ), 259--271. https:\/\/doi.org\/10.1007\/BF01585745 10.1007\/BF01585745 J. K. Lenstra, D. B. Shmoys, and \u00c9. Tardos. 1990. Approximation Algorithms for Scheduling Unrelated Parallel Machines. Mathematical programming, Vol. 46, 1 (1990), 259--271. https:\/\/doi.org\/10.1007\/BF01585745"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the 5th ACM Conference on Electronic Commerce (EC). 125--131","author":"Lipton R. J.","unstructured":"R. J. Lipton , E. Markakis , E. Mossel , and A. Saberi . 2004. On Approximately Fair Allocations of Indivisible Goods . In Proceedings of the 5th ACM Conference on Electronic Commerce (EC). 125--131 . https:\/\/doi.org\/10.1145\/988772.988792 10.1145\/988772.988792 R. J. Lipton, E. Markakis, E. Mossel, and A. Saberi. 2004. On Approximately Fair Allocations of Indivisible Goods. In Proceedings of the 5th ACM Conference on Electronic Commerce (EC). 125--131. https:\/\/doi.org\/10.1145\/988772.988792"},{"key":"e_1_3_2_1_32_1","volume-title":"Asymptotic Existence of Fair Divisions for Groups. Mathematical Social Sciences","volume":"89","author":"Manurangsi P.","year":"2017","unstructured":"P. Manurangsi and W. Suksompong . 2017 . Asymptotic Existence of Fair Divisions for Groups. Mathematical Social Sciences , Vol. 89 ( Sept. 2017 ), 100--108. https:\/\/doi.org\/10.1016\/j.mathsocsci.2017.05.006 10.1016\/j.mathsocsci.2017.05.006 P. Manurangsi and W. Suksompong. 2017. Asymptotic Existence of Fair Divisions for Groups. Mathematical Social Sciences, Vol. 89 (Sept. 2017), 100--108. https:\/\/doi.org\/10.1016\/j.mathsocsci.2017.05.006"},{"key":"e_1_3_2_1_33_1","volume-title":"When Do Envy-Free Allocations Exist - SIAM Journal on Discrete Mathematics","volume":"34","author":"Manurangsi P.","year":"2020","unstructured":"P. Manurangsi and W. Suksompong . 2020 . When Do Envy-Free Allocations Exist - SIAM Journal on Discrete Mathematics , Vol. 34 , 3 ( 2020 ), 1505--1521. https:\/\/doi.org\/10.1137\/19M1279125 10.1137\/19M1279125 P. Manurangsi and W. Suksompong. 2020. When Do Envy-Free Allocations Exist - SIAM Journal on Discrete Mathematics, Vol. 34, 3 (2020), 1505--1521. https:\/\/doi.org\/10.1137\/19M1279125"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1353381"},{"key":"e_1_3_2_1_35_1","unstructured":"F. Sandomirskiy and E. Segal-Halevi. 2020. Efficient Fair Division with Minimal Sharing. (2020). arxiv: 1908.01669  F. Sandomirskiy and E. Segal-Halevi. 2020. Efficient Fair Division with Minimal Sharing. (2020). arxiv: 1908.01669"},{"key":"e_1_3_2_1_36_1","unstructured":"N. Shah. 2021. Personal Communication.  N. Shah. 2021. Personal Communication."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"},{"key":"#cr-split#-e_1_3_2_1_38_1.1","unstructured":"A. Srinivasan. 2008. Budgeted Allocations in the Full-Information Setting. In Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques. 247--253. https:\/\/doi.org\/10.1007\/978--3--540--85363--3_20 10.1007\/978--3--540--85363--3_20"},{"key":"#cr-split#-e_1_3_2_1_38_1.2","doi-asserted-by":"crossref","unstructured":"A. Srinivasan. 2008. Budgeted Allocations in the Full-Information Setting. In Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques. 247--253. https:\/\/doi.org\/10.1007\/978--3--540--85363--3_20","DOI":"10.1007\/978-3-540-85363-3_20"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2016.03.007"},{"key":"e_1_3_2_1_40_1","first-page":"11044","article-title":"The Smoothed Possibility of Social Choice","volume":"33","author":"Xia L.","year":"2020","unstructured":"L. Xia . 2020 . The Smoothed Possibility of Social Choice . Advances in Neural Information Processing Systems (NeurIPS) , Vol. 33 (2020), 11044 -- 11055 . https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/7e05d6f828574fbc975a896b25bb011e-Paper.pdf L. Xia. 2020. The Smoothed Possibility of Social Choice. Advances in Neural Information Processing Systems (NeurIPS), Vol. 33 (2020), 11044--11055. https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/7e05d6f828574fbc975a896b25bb011e-Paper.pdf","journal-title":"Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"e_1_3_2_1_41_1","volume-title":"Advances in Neural Information Processing Systems (NeurIPS)","volume":"34","author":"Xia L.","year":"2021","unstructured":"L. Xia . 2021 . The Semi-Random Satisfaction of Voting Axioms . Advances in Neural Information Processing Systems (NeurIPS) , Vol. 34 (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/file\/3083202a936b7d0ef8b680d7ae73fa1a-Paper.pdf L. Xia. 2021. The Semi-Random Satisfaction of Voting Axioms. Advances in Neural Information Processing Systems (NeurIPS), Vol. 34 (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/file\/3083202a936b7d0ef8b680d7ae73fa1a-Paper.pdf"},{"key":"e_1_3_2_1_42_1","volume-title":"Proceedings of the 21st ACM Conference on Economics and Computation (EC). 911--912","author":"Zeng D.","year":"1907","unstructured":"D. Zeng and A. Psomas . 2020. Fairness-Efficiency Tradeoffs in Dynamic Fair Division . In Proceedings of the 21st ACM Conference on Economics and Computation (EC). 911--912 . https:\/\/arxiv.org\/pdf\/ 1907 .11672.pdf D. Zeng and A. Psomas. 2020. Fairness-Efficiency Tradeoffs in Dynamic Fair Division. In Proceedings of the 21st ACM Conference on Economics and Computation (EC). 911--912. https:\/\/arxiv.org\/pdf\/1907.11672.pdf"}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538285","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538285","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:04Z","timestamp":1750188664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":44,"alternative-id":["10.1145\/3490486.3538285","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538285","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}