{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T04:17:24Z","timestamp":1751516244690,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["FONDECYT 1241846"],"award-info":[{"award-number":["FONDECYT 1241846"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,7]]},"DOI":"10.1145\/3736252.3742644","type":"proceedings-article","created":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:49:32Z","timestamp":1751482172000},"page":"898-915","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Near-feasible Fair Allocations in Two-sided Markets"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4389-1398","authenticated-orcid":false,"given":"Javier","family":"Cembrano","sequence":"first","affiliation":[{"name":"Max Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3459-4646","authenticated-orcid":false,"given":"Andr\u00e9s","family":"Moraga","sequence":"additional","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica de Chile, Santiago, Chile"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0817-7356","authenticated-orcid":false,"given":"Victor","family":"Verdugo","sequence":"additional","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica de Chile, Santiago, Chile"}]}],"member":"320","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Santhini K. A. Kamesh Munagala Meghana Nasre Govind S Sankar et al. 2024. Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization. arXiv preprint arXiv:2403.15623 (2024)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.2093"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/sjoe.12362"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the 25th ACM Conference on Economics and Computation. 310\u2013310","author":"Arnosti Nick","year":"2024","unstructured":"Nick Arnosti, Carlos Bonet, and Jay Sethuraman. 2024. Explainable Affirmative Action. In Proceedings of the 25th ACM Conference on Economics and Computation. 310\u2013310."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467531"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589103"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3218083.3218090"},{"key":"e_1_3_2_1_8_1","volume-title":"Fair representation: Meeting the ideal of one man, one vote","author":"Balinski Michel","unstructured":"Michel Balinski and H. Peyton Young. 2010. Fair representation: Meeting the ideal of one man, one vote. Brookings Institution Press."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1126795"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055490"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384280"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90022-6"},{"key":"e_1_3_2_1_14_1","volume-title":"Fair algorithms for clustering. Advances in Neural Information Processing Systems 32","author":"Bera Suman","year":"2019","unstructured":"Suman Bera, Deeparnab Chakrabarty, Nicolas Flores, and Maryam Negahbani. 2019. Fair algorithms for clustering. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597771"},{"key":"e_1_3_2_1_16_1","first-page":"3","article-title":"Convex optimization: Algorithms and complexity","volume":"8","author":"S\u00e9bastien Bubeck","year":"2015","unstructured":"S\u00e9bastien Bubeck et al. 2015. Convex optimization: Algorithms and complexity. Foundations and Trends in Machine Learning 8, 3\u20134 (2015), 231\u2013357.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000140"},{"key":"e_1_3_2_1_18_1","volume-title":"Proportionality in Multiple Dimensions to Design Electoral Systems. arXiv preprint arXiv:2410.03304","author":"Cembrano Javier","year":"2024","unstructured":"Javier Cembrano, Jos\u00e9 Correa, Gonzalo D\u00edaz, and Victor Verdugo. 2024. Proportionality in Multiple Dimensions to Design Electoral Systems. arXiv preprint arXiv:2410.03304 (2024)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2109305119"},{"key":"e_1_3_2_1_20_1","volume-title":"Scarf's Algorithm on Arborescence Hypergraphs. To appear in ICALP","author":"Chandrasekaran Karthekeyan","year":"2025","unstructured":"Karthekeyan Chandrasekaran, Yuri Faenza, Chengyue He, and Jay Sethuraman. 2025. Scarf's Algorithm on Arborescence Hypergraphs. To appear in ICALP (2025)."},{"key":"e_1_3_2_1_21_1","volume-title":"Scott Duke Kominers, and Alexander Teytelboym","author":"Delacr\u00e9taz David","year":"2016","unstructured":"David Delacr\u00e9taz, Scott Duke Kominers, and Alexander Teytelboym. 2016. Refugee resettlement. University of Oxford Department of Economics Working Paper (2016)."},{"key":"e_1_3_2_1_22_1","volume-title":"Scarf's algorithm and stable marriages. Mathematics of Operations Research","author":"Faenza Yuri","year":"2025","unstructured":"Yuri Faenza, Chengyue He, and Jay Sethuraman. 2025. Scarf's algorithm and stable marriages. Mathematics of Operations Research (2025)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i13.33513"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2008.01.004"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_1_26_1","volume-title":"Market design: auctions and matching","author":"Haeringer Guillaume","unstructured":"Guillaume Haeringer. 2018. Market design: auctions and matching. MIT Press."},{"key":"e_1_3_2_1_27_1","volume-title":"Online and Matching-based Market Design","author":"Immorlica Nicole","unstructured":"Nicole Immorlica, Federico Echenique, and Vijay V Vazirani. 2023. Online and Matching-based Market Design. Cambridge University Press."},{"key":"e_1_3_2_1_28_1","volume-title":"Iterative methods in combinatorial optimization","author":"Lau Lap Chi","unstructured":"Lap Chi Lau, Ramamoorthi Ravi, and Mohit Singh. 2011. Iterative methods in combinatorial optimization. Vol. 46. Cambridge University Press."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/130929400"},{"key":"e_1_3_2_1_30_1","volume-title":"Conference on Learning Theory. 3246\u20133264","author":"Makarychev Yury","year":"2021","unstructured":"Yury Makarychev and Ali Vakilian. 2021. Approximation algorithms for socially fair clustering. In Conference on Learning Theory. 3246\u20133264."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01918-0"},{"key":"e_1_3_2_1_32_1","volume-title":"Fair division and collective welfare","author":"Moulin Herv\u00e9","unstructured":"Herv\u00e9 Moulin. 2004. Fair division and collective welfare. MIT press."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3869"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20141188"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1909"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467604"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.97"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Friedrich Pukelsheim. 2017. Proportional Representation. Springer International Publishing.","DOI":"10.1007\/978-3-319-64707-4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.108.7.1609"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000282"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20756"},{"key":"e_1_3_2_1_42_1","volume-title":"Equity: in theory and practice","author":"Young H Peyton","unstructured":"H Peyton Young. 2020. Equity: in theory and practice. Princeton University Press."}],"event":{"name":"EC '25: 26th ACM Conference on Economics and Computation","location":"Stanford University Stanford CA USA","acronym":"EC '25","sponsor":["SIGecom ACM Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 26th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736252.3742644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T18:51:38Z","timestamp":1751482298000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736252.3742644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"references-count":42,"alternative-id":["10.1145\/3736252.3742644","10.1145\/3736252"],"URL":"https:\/\/doi.org\/10.1145\/3736252.3742644","relation":{},"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2025-07-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}