{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T04:26:54Z","timestamp":1729052814463},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031739026","type":"print"},{"value":"9783031739033","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-73903-3_17","type":"book-chapter","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:01:53Z","timestamp":1729026113000},"page":"258-272","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Envy-Free and\u00a0Efficient Allocations for\u00a0Graphical Valuations"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-1727-5388","authenticated-orcid":false,"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4512-618X","authenticated-orcid":false,"given":"Aditi","family":"Sethia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,16]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Akrami, H., Alon, N., Chaudhury, B.R., Garg, J., Mehlhorn, K., Mehta, R.: EFX: a simpler approach and an (almost) optimal guarantee via rainbow cycle number. In: Proceedings of the 24th ACM Conference on Economics and Computation, EC 2023, p.\u00a061. Association for Computing Machinery, New York (2023)","DOI":"10.1145\/3580507.3597799"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, Y., Dombb, Y.: The efficiency of fair division with connected pieces. ACM Trans. Econ. Comput. 3(4) (2015)","DOI":"10.1145\/2781776"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.artint.2015.06.002","volume":"227","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Walsh, T.: Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227, 71\u201392 (2015)","journal-title":"Artif. Intell."},{"issue":"7","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1007\/s00224-021-10039-8","volume":"65","author":"X Bei","year":"2021","unstructured":"Bei, X., Lu, X., Manurangsi, P., Suksompong, W.: The Price of Fairness for Indivisible Goods. Theory Comput. Syst. 65(7), 1069\u20131093 (2021)","journal-title":"Theory Comput. Syst."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Berger, B., Cohen, A., Feldman, M., Fiat, A.: Almost full EFX exists for four agents. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 5, pp. 4826\u20134833 (2022)","DOI":"10.1609\/aaai.v36i5.20410"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V.F., Trichakis, N.: The Price of Fairness. Oper. Res. 59(1), 17\u201331 (2011)","journal-title":"Oper. Res."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-031-43254-5_16","volume-title":"Algorithmic Game Theory","author":"U Bhaskar","year":"2023","unstructured":"Bhaskar, U., Misra, N., Sethia, A., Vaish, R.: The price of equity with binary valuations and few agent types. In: Deligkas, A., Filos-Ratsikas, A. (eds.) SAGT 2023. LNCS, vol. 14238, pp. 271\u2013289. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43254-5_16"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.geb.2021.11.006","volume":"131","author":"V Bil\u00f2","year":"2022","unstructured":"Bil\u00f2, V., et al.: Almost envy-free allocations with connected bundles. Games Econom. Behav. 131, 197\u2013221 (2022)","journal-title":"Games Econom. Behav."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-031-39344-0_19","volume-title":"Frontiers of Algorithmics","author":"X Bu","year":"2023","unstructured":"Bu, X., Song, J., Yu, Z.: EFX allocations exist for binary valuations. In: Li, M., Sun, X., Wu, X. (eds.) IJTCS-FAW 2023. LNCS, vol. 13933, pp. 252\u2013262. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-39344-0_19"},{"issue":"6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Gravin, N., Huang, X.: Envy-freeness up to any item with high nash welfare: the virtue of donating items. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 527\u2013545 (2019)","DOI":"10.1145\/3328526.3329574"},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50(4), 589\u2013610 (2012)","journal-title":"Theory Comput. Syst."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. In: Proceedings of the 21st ACM Conference on Economics and Computation, EC 2020, pp. 1\u201319. Association for Computing Machinery, New York (2020)","DOI":"10.1145\/3391403.3399511"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Fiat, A., Koutsoupias, E., Sgouritsa, A.: Fair allocation in graphs. In: Proceedings of the 24th ACM Conference on Economics and Computation, EC 2023, pp. 473\u2013488. Association for Computing Machinery, New York (2023)","DOI":"10.1145\/3580507.3597764"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Deligkas, A., Eiben, E., Ganian, R., Hamm, T., Ordyniak, S.: The parameterized complexity of connected fair division. In: IJCAI, pp. 139\u2013145 (2021)","DOI":"10.24963\/ijcai.2021\/20"},{"key":"17_CR16","unstructured":"Foley, D.: Resource allocation and the public sector. Yale Econ. Essays 45\u201398 (1967)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Freeman, R., Sikdar, S., Vaish, R., Xia, L.: Equitable allocations of indivisible goods. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 280\u2013286 (2019)","DOI":"10.24963\/ijcai.2019\/40"},{"key":"17_CR18","unstructured":"Gamow, G., Stern, M.: Puzzle-Math (1958)"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"103547","DOI":"10.1016\/j.artint.2021.103547","volume":"300","author":"J Garg","year":"2021","unstructured":"Garg, J., Taki, S.: An improved approximation algorithm for maximin shares. Artif. Intell. 300, 103547 (2021)","journal-title":"Artif. Intell."},{"key":"17_CR20","unstructured":"Gourv\u00e8s, L., Monnot, J., Tlilane, L.: Near fairness in matroids. In: Proceedings of the 21st European Conference on Artificial Intelligence, pp. 393\u2013398 (2014)"},{"issue":"4","key":"17_CR21","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce, EC 2004, pp. 125\u2013131. Association for Computing Machinery, New York (2004)","DOI":"10.1145\/988772.988792"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce, pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"17_CR24","unstructured":"Payan, J., Sengupta, R., Viswanathan, V.: Relaxations of envy-freeness over graphs. In: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems,AAMAS 2023, pp. 2652\u20132654. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2023)"},{"issue":"2","key":"17_CR25","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/19M124397X","volume":"34","author":"B Plaut","year":"2020","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. SIAM J. Discrete Math. 34(2), 1039\u20131068 (2020)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"17_CR26","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16(1), 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Sun, A., Chen, B., Doan, X.V.: Equitability and welfare maximization for allocating indivisible items. Auton. Agents Multi-Agent Syst. 37(8) (2023)","DOI":"10.1007\/s10458-023-09618-5"},{"key":"17_CR28","unstructured":"Sun, A., Chen, B., Vinh\u00a0Doan, X.: Connections between fairness criteria and efficiency for allocating indivisible chores. In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1281\u20131289 (2021)"},{"key":"17_CR29","unstructured":"Zeng, J.A., Mehta, R.: On the structure of envy-free orientations on graphs (2024)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-73903-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:04:47Z","timestamp":1729026287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-73903-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9783031739026","9783031739033"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-73903-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,16]]},"assertion":[{"value":"16 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Brunswick, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/preflib.github.io\/adt2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}