{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:21:04Z","timestamp":1751192464070,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T00:00:00Z","timestamp":1688688000000},"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,7,9]]},"DOI":"10.1145\/3580507.3597698","type":"proceedings-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T14:19:22Z","timestamp":1688739562000},"page":"242-269","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Guaranteeing Envy-Freeness under Generalized Assignment Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9276-2181","authenticated-orcid":false,"given":"Siddharth","family":"Barman","sequence":"first","affiliation":[{"name":"Computer Science and Automation, Indian Institute of Science, Bengaluru, Karnataka, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7505-1687","authenticated-orcid":false,"given":"Arindam","family":"Khan","sequence":"additional","affiliation":[{"name":"Computer Science and Automation, Indian Institute of Science, Bengaluru, Karnataka, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3795-3989","authenticated-orcid":false,"given":"Sudarshan","family":"Shyam","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1090-2721","authenticated-orcid":false,"given":"K. V. N.","family":"Sreenivas","sequence":"additional","affiliation":[{"name":"Computer Science and Automation, Indian Institute of Science, Bengaluru, Karnataka, India"}]}],"member":"320","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence.","author":"Aleksandrov Martin Damyanov","year":"2015","unstructured":"Martin Damyanov Aleksandrov , Haris Aziz , Serge Gaspers , and Toby Walsh . 2015 . Online fair division: Analysing a food bank problem . In Twenty-Fourth International Joint Conference on Artificial Intelligence. Martin Damyanov Aleksandrov, Haris Aziz, Serge Gaspers, and Toby Walsh. 2015. Online fair division: Analysing a food bank problem. In Twenty-Fourth International Joint Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_2_1","volume-title":"Fair division of indivisible goods: A survey. arXiv preprint arXiv:2208.08782","author":"Amanatidis Georgios","year":"2022","unstructured":"Georgios Amanatidis , Haris Aziz , Georgios Birmpas , Aris Filos-Ratsikas , Bo Li , Herv\u00e9 Moulin , Alexandros A Voudouris , and Xiaowei Wu. 2022. Fair division of indivisible goods: A survey. arXiv preprint arXiv:2208.08782 ( 2022 ). Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Herv\u00e9 Moulin, Alexandros A Voudouris, and Xiaowei Wu. 2022. Fair division of indivisible goods: A survey. arXiv preprint arXiv:2208.08782 (2022)."},{"key":"e_1_3_2_1_3_1","volume-title":"Fair Division Algorithms for Electricity Distribution. arXiv preprint arXiv:2205.14531","author":"Baghel Dinesh Kumar","year":"2022","unstructured":"Dinesh Kumar Baghel , Vadim E Levit , and Erel Segal-Halevi . 2022. Fair Division Algorithms for Electricity Distribution. arXiv preprint arXiv:2205.14531 ( 2022 ). Dinesh Kumar Baghel, Vadim E Levit, and Erel Segal-Halevi. 2022. Fair Division Algorithms for Electricity Distribution. arXiv preprint arXiv:2205.14531 (2022)."},{"key":"e_1_3_2_1_4_1","volume-title":"Finding Fair Allocations under Budget Constraints. arXiv preprint arXiv:2208.08168","author":"Barman Siddharth","year":"2022","unstructured":"Siddharth Barman , Arindam Khan , Sudarshan Shyam , and K. V. N. Sreenivas . 2022. Finding Fair Allocations under Budget Constraints. arXiv preprint arXiv:2208.08168 ( 2022 ). Siddharth Barman, Arindam Khan, Sudarshan Shyam, and K. V. N. Sreenivas. 2022. Finding Fair Allocations under Budget Constraints. arXiv preprint arXiv:2208.08168 (2022)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57980-7_3"},{"key":"e_1_3_2_1_6_1","unstructured":"Gerdus Benad\u00e8 Daniel Halpern and Alexandros Psomas. 2022. Dynamic Fair Division with Partial Information. In NeurIPS. http:\/\/papers.nips.cc\/paper_files\/paper\/2022\/hash\/17bb0edcc02bd1f74e771e23b2aa1501-Abstract-Conference.html  Gerdus Benad\u00e8 Daniel Halpern and Alexandros Psomas. 2022. Dynamic Fair Division with Partial Information. In NeurIPS. http:\/\/papers.nips.cc\/paper_files\/paper\/2022\/hash\/17bb0edcc02bd1f74e771e23b2aa1501-Abstract-Conference.html"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Arpita Biswas and Siddharth Barman. 2018. Fair Division Under Cardinality Constraints.. In IJCAI. 91--97.  Arpita Biswas and Siddharth Barman. 2018. Fair Division Under Cardinality Constraints.. In IJCAI. 91--97.","DOI":"10.24963\/ijcai.2018\/13"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975"},{"key":"e_1_3_2_1_9_1","volume-title":"Procaccia","author":"Brandt Felix","year":"2016","unstructured":"Felix Brandt , Vincent Conitzer , Ulle Endriss , J\u00e9r\u00f4me Lang , and Ariel D . Procaccia . 2016 . Handbook of Computational Social Choice. Cambridge University Press . Felix Brandt, Vincent Conitzer, Ulle Endriss, J\u00e9r\u00f4me Lang, and Ariel D. Procaccia. 2016. Handbook of Computational Social Choice. Cambridge University Press."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1544"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329574"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355902"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1359134"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382820"},{"key":"e_1_3_2_1_15_1","volume-title":"Tien Foo Sing, and Chaoqun Ren","author":"Deng Yongheng","year":"2013","unstructured":"Yongheng Deng , Tien Foo Sing, and Chaoqun Ren . 2013 . The story of Singapore's public housing: From a nation of home-seekers to a nation of homeowners. In The future of public housing. Springer , 103--121. Yongheng Deng, Tien Foo Sing, and Chaoqun Ren. 2013. The story of Singapore's public housing: From a nation of home-seekers to a nation of homeowners. In The future of public housing. Springer, 103--121."},{"key":"e_1_3_2_1_16_1","volume-title":"Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI). 5312--5320","author":"Dror Amitay","year":"2021","unstructured":"Amitay Dror , Michal Feldman , and Erel Segal-Halevi . 2021 . On Fair Division under Heterogeneous Matroid Constraints . In Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI). 5312--5320 . Amitay Dror, Michal Feldman, and Erel Segal-Halevi. 2021. On Fair Division under Heterogeneous Matroid Constraints. In Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI). 5312--5320."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_34"},{"key":"e_1_3_2_1_18_1","volume-title":"Approximately envy-free budget-feasible allocation. arXiv preprint arXiv:2106.14446","author":"Gan Jiarui","year":"2021","unstructured":"Jiarui Gan , Bo Li , and Xiaowei Wu. 2021. Approximately envy-free budget-feasible allocation. arXiv preprint arXiv:2106.14446 ( 2021 ). Jiarui Gan, Bo Li, and Xiaowei Wu. 2021. Approximately envy-free budget-feasible allocation. arXiv preprint arXiv:2106.14446 (2021)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90042-6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.07.008"},{"volume-title":"Knapsack problems: algorithms and computer implementations","author":"Martello Silvano","key":"e_1_3_2_1_22_1","unstructured":"Silvano Martello and Paolo Toth . 1990. Knapsack problems: algorithms and computer implementations . John Wiley & Sons . Silvano Martello and Paolo Toth. 1990. Knapsack problems: algorithms and computer implementations. John Wiley & Sons."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"volume-title":"Fair division and collective welfare","author":"Moulin Herv\u00e9","key":"e_1_3_2_1_24_1","unstructured":"Herv\u00e9 Moulin . 2004. Fair division and collective welfare . MIT press . Herv\u00e9 Moulin. 2004. Fair division and collective welfare. MIT press."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.3138\/infor.45.3.123"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382131"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02247962"},{"key":"e_1_3_2_1_28_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency.","author":"Schrijver Alexander","year":"2003","unstructured":"Alexander Schrijver . 2003 . Combinatorial Optimization: Polyhedra and Efficiency. Vol. B. Alexander Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Vol. B."},{"key":"e_1_3_2_1_29_1","first-page":"1","article-title":"Fair cake-cutting algorithms with real land-value data","volume":"35","author":"Shtechman Itay","year":"2021","unstructured":"Itay Shtechman , Rica Gonen , and Erel Segal-Halevi . 2021 . Fair cake-cutting algorithms with real land-value data . Autonomous Agents and Multi-Agent Systems 35 , 2 (2021), 1 -- 28 . Itay Shtechman, Rica Gonen, and Erel Segal-Halevi. 2021. Fair cake-cutting algorithms with real land-value data. Autonomous Agents and Multi-Agent Systems 35, 2 (2021), 1--28.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3505156.3505162"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(74)90075-1"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(85)90023-0"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/65"}],"event":{"name":"EC '23: 24th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"London United Kingdom","acronym":"EC '23"},"container-title":["Proceedings of the 24th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597698","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580507.3597698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:43Z","timestamp":1750178263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580507.3597698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,7]]},"references-count":33,"alternative-id":["10.1145\/3580507.3597698","10.1145\/3580507"],"URL":"https:\/\/doi.org\/10.1145\/3580507.3597698","relation":{},"subject":[],"published":{"date-parts":[[2023,7,7]]},"assertion":[{"value":"2023-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}