{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T00:16:59Z","timestamp":1775607419875,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"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":[[2019,6,17]]},"DOI":"10.1145\/3328526.3329574","type":"proceedings-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T12:45:07Z","timestamp":1561121107000},"page":"527-545","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Envy-Freeness Up to Any Item with High Nash Welfare"],"prefix":"10.1145","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[{"name":"University of Patras & CTI \"Diophantus\", Rion-Patras, Greece"}]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]},{"given":"Xin","family":"Huang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3304415.3304423"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147173"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.36"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.147"},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS) . 36:1--12","author":"Anari Nima","year":"2017","unstructured":"Nima Anari , Shayan Oveis Gharan , Amin Saberi , and Mohit Singh . 2017 . Nash social welfare, matrix permanent, and stable polynomials . In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS) . 36:1--12 . Nima Anari, Shayan Oveis Gharan, Amin Saberi, and Mohit Singh. 2017. Nash social welfare, matrix permanent, and stable polynomials. In Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS) . 36:1--12."},{"key":"e_1_3_2_2_6_1","volume-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI). 4638--4645","author":"Aziz Haris","unstructured":"Haris Aziz , Sylvain Bouveret , Ioannis Caragiannis , Ira Giagkousi , and J\u00e9 r\u00f4 me Lang. 2018. Knowledge, fairness, and social constraints . In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI). 4638--4645 . Haris Aziz, Sylvain Bouveret, Ioannis Caragiannis, Ira Giagkousi, and J\u00e9 r\u00f4 me Lang. 2018. Knowledge, fairness, and social constraints. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI). 4638--4645."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897522"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764505"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085136"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219176"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0865"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-015-9287-3"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1086\/664613"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9359-y"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940726"},{"key":"e_1_3_2_2_16_1","volume-title":"On Fair Division for Indivisible Items. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS","author":"Chaudhury Bhaskar Ray","year":"2018","unstructured":"Bhaskar Ray Chaudhury , Yun Kuen Cheung , Jugal Garg , Naveen Garg , Martin Hoefer , and Kurt Mehlhorn . 2018 . On Fair Division for Indivisible Items. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, and Kurt Mehlhorn. 2018. On Fair Division for Indivisible Items. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI) . 1239--1244","author":"Chevaleyre Yann","year":"2007","unstructured":"Yann Chevaleyre , Ulle Endriss , Sylvia Estivie , and Nicolas Maudet . 2007 . Reaching envy-free states in distributed negotiation settings . In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI) . 1239--1244 . Yann Chevaleyre, Ulle Endriss, Sylvia Estivie, and Nicolas Maudet. 2007. Reaching envy-free states in distributed negotiation settings. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI) . 1239--1244."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085109"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746589"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940720"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706369"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/13094339X"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897580"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.150"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219238"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2728732.2728738"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3140756"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.01.012"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988792"},{"key":"e_1_3_2_2_30_1","volume-title":"Fair Division and Collective Welfare","author":"Moulin H.","unstructured":"H. Moulin . 2003. Fair Division and Collective Welfare . MIT Press . H. Moulin. 2003. Fair Division and Collective Welfare .MIT Press."},{"key":"e_1_3_2_2_31_1","volume-title":"The bargaining problem. Econometrica: Journal of the Econometric Society","author":"Nash John F","year":"1950","unstructured":"John F Nash Jr . 1950. The bargaining problem. Econometrica: Journal of the Econometric Society ( 1950 ), 155--162. John F Nash Jr. 1950. The bargaining problem. Econometrica: Journal of the Econometric Society (1950), 155--162."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-013-9224-2"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.09.010"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175470"},{"key":"e_1_3_2_2_35_1","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus Hugo","year":"1948","unstructured":"Hugo Steinhaus . 1948 . The problem of fair division . Econometrica , Vol. 16 , 1 (1948), 101 -- 104 . Hugo Steinhaus. 1948. The problem of fair division. Econometrica, Vol. 16, 1 (1948), 101--104.","journal-title":"Econometrica"}],"event":{"name":"EC '19: ACM Conference on Economics and Computation","location":"Phoenix AZ USA","acronym":"EC '19","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2019 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329574","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3328526.3329574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:41Z","timestamp":1750204421000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3328526.3329574"}},"subtitle":["The Virtue of Donating Items"],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":35,"alternative-id":["10.1145\/3328526.3329574","10.1145\/3328526"],"URL":"https:\/\/doi.org\/10.1145\/3328526.3329574","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}