{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:12:29Z","timestamp":1778818349507,"version":"3.51.4"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T00:00:00Z","timestamp":1792540800000},"content-version":"am","delay-in-days":142,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000879","name":"Alfred P Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115969","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:12:12Z","timestamp":1776294732000},"page":"115969","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Fair division with interdependent values"],"prefix":"10.1016","volume":"1076","author":[{"given":"Georgios","family":"Birmpas","sequence":"first","affiliation":[]},{"given":"Tomer","family":"Ezra","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2047-4089","authenticated-orcid":false,"given":"Matteo","family":"Russo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115969_bib0001","series-title":"Algorithmic Game Theory - 17th International Symposium, SAGT 2024","first-page":"72","article-title":"Fair division with interdependent values","author":"Birmpas","year":"2024"},{"issue":"Supplement","key":"10.1016\/j.tcs.2026.115969_bib0002","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/1907319","article-title":"Sur la division pragmatique","volume":"17","author":"Steinhaus","year":"1949","journal-title":"Econometrica"},{"key":"10.1016\/j.tcs.2026.115969_bib0003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00029890.1961.11989615","article-title":"How to cut a cake fairly","volume":"68","author":"Dubins","year":"1961","journal-title":"Am. Math. Month."},{"key":"10.1016\/j.tcs.2026.115969_bib0004","first-page":"45","article-title":"Resource allocation and the public sector","volume":"7","author":"Foley","year":"1967","journal-title":"Yale Econ. Essay."},{"key":"10.1016\/j.tcs.2026.115969_bib0005","series-title":"Puzzle-Math","author":"Gamow","year":"1958"},{"key":"10.1016\/j.tcs.2026.115969_bib0006","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","article-title":"Equity, envy and efficiency","volume":"9","author":"Varian","year":"1974","journal-title":"J. Econ. Theory"},{"key":"10.1016\/j.tcs.2026.115969_bib0007","series-title":"Proceedings of the 5th ACM Conference on Electronic Commerce, EC \u201904","first-page":"125","article-title":"On approximately fair allocations of indivisible goods","author":"Lipton","year":"2004"},{"key":"10.1016\/j.tcs.2026.115969_bib0008","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1086\/664613","article-title":"The combinatorial assignment problem: approximate competitive equilibrium from equal incomes","volume":"119","author":"Budish","year":"2011","journal-title":"J. Politi. Econ."},{"key":"10.1016\/j.tcs.2026.115969_bib0009","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/3355902","article-title":"The unreasonable fairness of maximum Nash welfare","volume":"7","author":"Caragiannis","year":"2019","journal-title":"ACM Trans. Econ. Comput."},{"key":"10.1016\/j.tcs.2026.115969_bib0010","series-title":"EC","first-page":"127","article-title":"Fair-share allocations for agents with arbitrary entitlements","author":"Babaioff","year":"2021"},{"key":"10.1016\/j.tcs.2026.115969_bib0011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.1.11291","article-title":"Fair allocation of indivisible goods to asymmetric agents","volume":"64","author":"Farhadi","year":"2019","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.tcs.2026.115969_bib0012","doi-asserted-by":"crossref","first-page":"18:1","DOI":"10.1145\/3457166","article-title":"Weighted envy-freeness in indivisible item allocation","volume":"9","author":"Chakraborty","year":"2021","journal-title":"ACM Trans. Econ. Comput."},{"key":"10.1016\/j.tcs.2026.115969_bib0013","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1287\/moor.2020.1062","article-title":"Competitive equilibrium with indivisible goods and generic budgets","volume":"46","author":"Babaioff","year":"2021","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.tcs.2026.115969_bib0014","doi-asserted-by":"crossref","unstructured":"G. Amanatidis, H. Aziz, G. Birmpas, A. Filos-Ratsikas, B. Li, H. Moulin, A.A. Voudouris, X. Wu, Fair division of indivisible goods: recent progress and open questions (2023) 103965.","DOI":"10.1016\/j.artint.2023.103965"},{"key":"10.1016\/j.tcs.2026.115969_bib0015","series-title":"First International Conference on Algorithmic Decision Theory, ADT \u201909","first-page":"111","article-title":"On low-envy truthful allocations","author":"Caragiannis","year":"2009"},{"key":"10.1016\/j.tcs.2026.115969_bib0016","series-title":"Proceedings of the 7th International Conference on Web and Internet Economics, WINE 2011","first-page":"278","article-title":"On worst-case allocations in the presence of indivisible goods","author":"Markakis","year":"2011"},{"key":"10.1016\/j.tcs.2026.115969_bib0017","series-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence, IJCAI \u201916","first-page":"31","article-title":"On truthful mechanisms for maximin share allocations","author":"Amanatidis","year":"2016"},{"key":"10.1016\/j.tcs.2026.115969_bib0018","series-title":"Proceedings of the 2017 ACM Conference on Economics and Computation, EC\u2019 17","first-page":"545","article-title":"Truthful allocation mechanisms without payments: characterization and implications on fairness","author":"Amanatidis","year":"2017"},{"key":"10.1016\/j.tcs.2026.115969_bib0019","series-title":"Web and Internet Economics - 16th International Conference, WINE 2020, Beijing, China, December 7\u201311, 2020, Proceedings","first-page":"341","article-title":"Simultaneously achieving ex-ante and ex-post fairness","author":"Aziz","year":"2020"},{"key":"10.1016\/j.tcs.2026.115969_bib0020","series-title":"Proceedings of the 16th International Conference on Web and Internet Economics, WINE 2020","first-page":"370","article-title":"Fair division with binary valuations: one rule to rule them all","author":"Halpern","year":"2020"},{"key":"10.1016\/j.tcs.2026.115969_bib0021","series-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence, AAAI 2021","first-page":"5119","article-title":"Fair and truthful mechanisms for dichotomous valuations","author":"Babaioff","year":"2021"},{"key":"10.1016\/j.tcs.2026.115969_bib0022","series-title":"AAAI","first-page":"4801","article-title":"Truthful and fair mechanisms for matroid-rank valuations","author":"Barman","year":"2022"},{"key":"10.1016\/j.tcs.2026.115969_bib0023","series-title":"AAMAS","first-page":"179","article-title":"Yankee Swap: A Fast and Simple Fair Allocation Mechanism for Matroid Rank Valuations","author":"Viswanathan","year":"2023"},{"key":"10.1016\/j.tcs.2026.115969_bib0024","series-title":"Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022","article-title":"Fair and efficient allocations without obvious manipulations","author":"Psomas","year":"2022"},{"key":"10.1016\/j.tcs.2026.115969_bib0025","doi-asserted-by":"crossref","unstructured":"G. Amanatidis, G. Birmpas, F. Fusco, P. Lazos, S. Leonardi, R. Reiffenh\u00e4user, Allocating indivisible goods to strategic agents: pure nash equilibria and fairness (2024) 2425\u20132445.","DOI":"10.1287\/moor.2022.0058"},{"key":"10.1016\/j.tcs.2026.115969_bib0026","doi-asserted-by":"crossref","first-page":"2717","DOI":"10.1287\/moor.2023.0244","article-title":"Round-robin beyond additive agents: existence and fairness of approximate equilibria","volume":"50","author":"Amanatidis","year":"2025","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.tcs.2026.115969_bib0027","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1287\/mnsc.15.7.446","article-title":"Communications to the editor\u2013competitive bidding with disparate information","volume":"15","author":"Wilson","year":"1969","journal-title":"Manage. Sci."},{"key":"10.1016\/j.tcs.2026.115969_bib0028","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.2307\/1911865","article-title":"A theory of auctions and competitive bidding","volume":"50","author":"Milgrom","year":"1982","journal-title":"Econometrica"},{"key":"10.1016\/j.tcs.2026.115969_bib0029","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1111\/1468-0262.00240","article-title":"Efficient design with interdependent valuations","volume":"69","author":"Jehiel","year":"2001","journal-title":"Econometrica"},{"key":"10.1016\/j.tcs.2026.115969_bib0030","series-title":"EC, ACM","first-page":"369","article-title":"Interdependent values without single-crossing","author":"Eden","year":"2018"},{"key":"10.1016\/j.tcs.2026.115969_bib0031","series-title":"EC","first-page":"19","article-title":"Combinatorial auctions with interdependent valuations: SOS to the rescue","author":"Eden","year":"2019"},{"key":"10.1016\/j.tcs.2026.115969_bib0032","series-title":"AAAI","first-page":"5321","article-title":"Poa of simple auctions with interdependent values","author":"Eden","year":"2021"},{"key":"10.1016\/j.tcs.2026.115969_bib0033","series-title":"SODA","first-page":"2920","article-title":"Private interdependent valuations","author":"Eden","year":"2022"},{"key":"10.1016\/j.tcs.2026.115969_bib0034","series-title":"WINE","first-page":"219","article-title":"Better approximation for interdependent SOS valuations","author":"Lu","year":"2022"},{"key":"10.1016\/j.tcs.2026.115969_bib0035","series-title":"SODA, SIAM","first-page":"416","article-title":"Interdependent public projects","author":"Cohen","year":"2023"},{"key":"10.1016\/j.tcs.2026.115969_bib0036","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.mathsocsci.2022.03.004","article-title":"On maximum weighted nash welfare for binary valuations","volume":"117","author":"Suksompong","year":"2022","journal-title":"Math. Soc. Sci."},{"key":"10.1016\/j.tcs.2026.115969_bib0037","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.mathsocsci.2023.09.004","article-title":"Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness","volume":"126","author":"Suksompong","year":"2023","journal-title":"Math. Soc. Sci."},{"key":"10.1016\/j.tcs.2026.115969_bib0038","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","article-title":"Counterspeculation, auctions, and competitive sealed tenders","volume":"16","author":"Vickrey","year":"1961","journal-title":"J. Finance"},{"key":"10.1016\/j.tcs.2026.115969_bib0039","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","article-title":"Multipart pricing of public goods","volume":"11","author":"Clarke","year":"1971","journal-title":"Public Choice"},{"key":"10.1016\/j.tcs.2026.115969_bib0040","doi-asserted-by":"crossref","first-page":"617","DOI":"10.2307\/1914085","article-title":"Incentives in teams","volume":"41","author":"Groves","year":"1973","journal-title":"Econometrica"},{"key":"10.1016\/j.tcs.2026.115969_bib0041","series-title":"EC","first-page":"767","article-title":"Optimal and near-optimal mechanism design with interdependent values","author":"Roughgarden","year":"2013"},{"key":"10.1016\/j.tcs.2026.115969_bib0042","series-title":"Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21\u201324, 2021, Proceedings","first-page":"64","article-title":"Prior-free clock auctions for bidders with interdependent values","author":"Gkatzelis","year":"2021"},{"key":"10.1016\/j.tcs.2026.115969_bib0043","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/19M124397X","article-title":"Almost envy-freeness with general valuations","volume":"34","author":"Plaut","year":"2020","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.tcs.2026.115969_bib0044","series-title":"FOCS","first-page":"249","article-title":"Settling the communication complexity of combinatorial auctions with two subadditive buyers","author":"Ezra","year":"2019"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002288?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002288?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:23:45Z","timestamp":1778815425000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":44,"alternative-id":["S0304397526002288"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115969","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fair division with interdependent values","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115969","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115969"}}