{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:05:23Z","timestamp":1784995523298,"version":"3.55.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032036384","type":"print"},{"value":"9783032036391","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-03639-1_10","type":"book-chapter","created":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T13:24:12Z","timestamp":1756646652000},"page":"175-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tractable Graph Structures in\u00a0EFX Orientation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9165-6280","authenticated-orcid":false,"given":"V\u00e1clav","family":"Bla\u017eej","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1255-8266","authenticated-orcid":false,"given":"Sushmita","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2116-6048","authenticated-orcid":false,"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0555-9500","authenticated-orcid":false,"given":"Peter","family":"Strulo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Afshinmehr, M., Danaei, A., Kazemi, M., Mehlhorn, K., Rathi, N.: EFX allocations and orientations on bipartite multi-graphs: a complete picture (2024). https:\/\/arxiv.org\/abs\/2410.17002","DOI":"10.65109\/ESDK4357"},{"key":"10_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-06678-8_1","volume-title":"IWOCA 2022","author":"A Agrawal","year":"2022","unstructured":"Agrawal, A., Ramanujan, M.S.: Distance from triviality 2.0: hybrid parameterizations. In: Bazgan, C., Fernau, H. (eds.) IWOCA 2022. LNCS, vol. 13270, pp. 3\u201320. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06678-8_1"},{"key":"10_CR3","doi-asserted-by":"publisher","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 EC 2023, p.\u00a061. EC 2023 (2023). https:\/\/doi.org\/10.1145\/3580507.3597799","DOI":"10.1145\/3580507.3597799"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2019.05.011","volume":"790","author":"H Aziz","year":"2019","unstructured":"Aziz, H., Bir\u00f3, P., Lang, J., Lesca, J., Monnot, J.: Efficient reallocation under additive and responsive preferences. Theoret. Comput. Sci. 790, 1\u201315 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR5","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). https:\/\/doi.org\/10.1016\/J.ARTINT.2015.06.002","journal-title":"Artif. Intell."},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Berger, B., Cohen, A., Feldman, M., Fiat, A.: Almost full EFX exists for four agents. In: Proceedings AAAI 2022, vol.\u00a036, pp. 4826\u20134833 (2022). https:\/\/doi.org\/10.1609\/aaai.v36i5.20410","DOI":"10.1609\/aaai.v36i5.20410"},{"key":"10_CR7","unstructured":"Bhaskar, U., Pandit, Y.: EFX allocations on some multi-graph classes (2024). https:\/\/arxiv.org\/abs\/2412.06513"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Budish, E.: The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011). https:\/\/EconPapers.repec.org\/RePEc:ucp:jpolec, https:\/\/doi.org\/10.1086\/664613","DOI":"10.1086\/664613"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum nash welfare. ACM Trans. Econ. Comput. 7(3) (2019). https:\/\/doi.org\/10.1145\/3355902","DOI":"10.1145\/3355902"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. J. ACM 71(1) (2024). https:\/\/doi.org\/10.1145\/3616009","DOI":"10.1145\/3616009"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player nash equilibria. J. ACM 56(3) (2009). https:\/\/doi.org\/10.1145\/1516512.1516516","DOI":"10.1145\/1516512.1516516"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Christodoulou, G., Fiat, A., Koutsoupias, E., Sgouritsa, A.: Fair allocation in graphs. In: Proceedings of EC 2023, pp. 473\u2013488. EC 2023 (2023). https:\/\/doi.org\/10.1145\/3580507.3597764","DOI":"10.1145\/3580507.3597764"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Kovacs, A.: A proof of the nisan-ronen conjecture (2023). https:\/\/arxiv.org\/abs\/2301.11905","DOI":"10.1145\/3564246.3585176"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Christodoulou, G., Koutsoupias, E., Kov\u00e1cs, A.: On the Nisan-Ronen conjecture. In: Proceedings of FOCS 2022, pp. 839\u2013850 (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00086","DOI":"10.1109\/FOCS52979.2021.00086"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009). https:\/\/doi.org\/10.1137\/070699652","journal-title":"SIAM J. Comput."},{"issue":"03","key":"10_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1142\/S0218195912500045","volume":"22","author":"M de Berg","year":"2012","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions for segments in the plane. Int. J. Comput. Geom. Appl. 22(03), 187\u2013205 (2012). https:\/\/doi.org\/10.1142\/S0218195912500045","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Deligkas, A., Eiben, E., Goldsmith, T.L., Korchemna, V.: Ef1 and EFX orientations (2024). https:\/\/arxiv.org\/abs\/2409.13616","DOI":"10.24963\/ijcai.2024\/7"},{"key":"10_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113932","volume":"962","author":"J Garg","year":"2023","unstructured":"Garg, J., Murhekar, A.: Computing fair and efficient allocations with few utility values. Theor. Comput. Sci. 962, 113932 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Garg, J., Murhekar, A., Qin, J.: Fair and efficient allocations of chores under bivalued preferences. In: Proceedings of AAAI 2022, vol. 36, no. 5, pp. 5043\u20135050 (2022)","DOI":"10.1609\/aaai.v36i5.20436"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Hosseini, H., Sikdar, S., Vaish, R., Wang, H., Xia, L.: Fair division through information withholding. In: Proceedings of AAAI 2020, vol. 34, pp. 2014\u20132021 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i02.5573","DOI":"10.1609\/aaai.v34i02.5573"},{"issue":"4","key":"10_CR22","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1137\/140962838","volume":"45","author":"Y Iwata","year":"2016","unstructured":"Iwata, Y., Wahlstr\u00f6m, M., Yoshida, Y.: Half-integrality, LP-branching, and FPT algorithms. SIAM J. Comput. 45(4), 1377\u20131411 (2016). https:\/\/doi.org\/10.1137\/140962838","journal-title":"SIAM J. Comput."},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of EC 2004, pp. 125\u2013131. EC 2004 (2004). https:\/\/doi.org\/10.1145\/988772.988792","DOI":"10.1145\/988772.988792"},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1287\/moor.2022.0044","volume":"49","author":"R Mahara","year":"2024","unstructured":"Mahara, R.: Extension of additive valuations to general valuations on the existence of EFX. Math. Oper. Res. 49(2), 1263\u20131277 (2024). https:\/\/doi.org\/10.1287\/moor.2022.0044","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econom. Behav. 35(1), 166\u2013196 (2001). https:\/\/doi.org\/10.1006\/game.1999.0790","journal-title":"Games Econom. Behav."},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Payan, J., Sengupta, R., Viswanathan, V.: Relaxations of envy-freeness over graphs. In: Proceedings of AAMAS 2023, pp. 2652\u20132654. ACM (2023). https:\/\/doi.org\/10.5555\/3545946.3599032","DOI":"10.5555\/3545946.3599032"},{"issue":"2","key":"10_CR27","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). https:\/\/doi.org\/10.1137\/19M124397X","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10_CR28","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/3382131","volume":"63","author":"AD Procaccia","year":"2020","unstructured":"Procaccia, A.D.: Technical perspective: an answer to fair division\u2019s most enigmatic question. Commun. ACM 63(4), 118 (2020). https:\/\/doi.org\/10.1145\/3382131","journal-title":"Commun. ACM"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Ramanujan, M.S., Saurabh, S.: Linear-time parameterized algorithms via skew-symmetric multicuts. ACM Trans. Algorithms 13(4), 46:1\u201346:25 (2017). https:\/\/doi.org\/10.1145\/3128600","DOI":"10.1145\/3128600"},{"key":"10_CR30","unstructured":"Zeng, J.A., Mehta, R.: On the structure of EFX orientations on graphs (2024). https:\/\/arxiv.org\/abs\/2404.13527"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-03639-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T15:38:38Z","timestamp":1784993918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-03639-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"ISBN":["9783032036384","9783032036391"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-03639-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"assertion":[{"value":"1 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bath","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}