{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T05:43:04Z","timestamp":1772170984798,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030304720","type":"print"},{"value":"9783030304737","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_25","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"374-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Fair Division with Subsidy"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Halpern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nisarg","family":"Shah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.2307\/2938172","volume":"59","author":"A Alkan","year":"1991","unstructured":"Alkan, A., Demange, G., Gale, D.: Fair allocation of indivisible goods and criteria of justice. Econometrica 59(4), 1023\u20131039 (1991)","journal-title":"Econometrica"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Finding fair and efficient allocations. In: Proceedings of the 19th ACM Conference on Economics and Computation (EC), pp. 557\u2013574 (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"25_CR3","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Greedy algorithms for maximizing Nash social welfare. In: Proceedings of the 17th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 7\u201313 (2018)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-4068(92)90001-N","volume":"21","author":"M Berliant","year":"1992","unstructured":"Berliant, M., Dunz, K., Thomson, W.: On the fair division of a heterogeneous commodity. J. Math. Econ. 21, 201\u2013216 (1992)","journal-title":"J. Math. Econ."},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0165-4896(98)00015-8","volume":"37","author":"C Bevi\u00e1","year":"1999","unstructured":"Bevi\u00e1, C., Quinzii, M., Silva, J.A.: Buying several indivisible goods. Math. Soc. Sci. 37(1), 1\u201323 (1999)","journal-title":"Math. Soc. Sci."},{"issue":"2","key":"25_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jeth.1996.2269","volume":"74","author":"S Bikhchandani","year":"1997","unstructured":"Bikhchandani, S., Mamer, J.W.: Competitive equilibrium in an exchange economy with indivisibilities. J. Econ. Theory 74(2), 385\u2013413 (1997)","journal-title":"J. Econ. Theory"},{"key":"25_CR7","unstructured":"Bilo, V., et al.: Almost envy-free allocations with connected bundles. In: Proceedings of the 10th Innovations in Theoretical Computer Science Conference (ITCS), pp. 1\u201321, 14 (2019)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Cechl\u00e1rov\u00e1, K., Elkind, E., Igarashi, A., Peters, D.: Fair division of a graph. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp. 135\u2013141 (2017)","DOI":"10.24963\/ijcai.2017\/20"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1613\/jair.2467","volume":"32","author":"S Bouveret","year":"2008","unstructured":"Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. J. Artif. Intell. Res. 32, 525\u2013564 (2008)","journal-title":"J. Artif. Intell. Res."},{"issue":"6","key":"25_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":"25_CR11","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. In: Proceedings of the 17th ACM Conference on Economics and Computation (EC), pp. 305\u2013322 (2016)","DOI":"10.1145\/2940716.2940726"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2015.05.071","volume":"247","author":"A Darmann","year":"2015","unstructured":"Darmann, A., Schauer, J.: Maximizing Nash product social welfare in allocating indivisible goods. Eur. J. Oper. Res. 247(2), 548\u2013559 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"873","DOI":"10.2307\/1912658","volume":"53","author":"G Demange","year":"1985","unstructured":"Demange, G., Gale, D.: The strategy structure of two-sided matching markets. Econometrica 53, 873\u2013888 (1985)","journal-title":"Econometrica"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Goldman, J., Karp, J., Procaccia, A.D., Sandholm, T.: The computational rise and fall of fairness. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI), pp. 1405\u20131411 (2014)","DOI":"10.1609\/aaai.v28i1.8884"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM (JACM) 19(2), 248\u2013264 (1972)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E Eisenberg","year":"1959","unstructured":"Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the pari-mutuel method. Ann. Math. Stat. 30(1), 165\u2013168 (1959)","journal-title":"Ann. Math. Stat."},{"key":"25_CR17","first-page":"45","volume":"7","author":"D Foley","year":"1967","unstructured":"Foley, D.: Resource allocation and the public sector. Yale Econ. Essays 7, 45\u201398 (1967)","journal-title":"Yale Econ. Essays"},{"issue":"4","key":"25_CR18","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s003550100149","volume":"19","author":"CJ Haake","year":"2002","unstructured":"Haake, C.J., Raith, M.G., Su, F.E.: Bidding for envy-freeness: a procedural approach to n-player fair-division problems. Soc. Choice Welfare 19(4), 723\u2013749 (2002)","journal-title":"Soc. Choice Welfare"},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s003550050015","volume":"17","author":"F Klijn","year":"2000","unstructured":"Klijn, F.: An algorithm for envy-free allocations in an economy with indivisible objects and money. Soc. Choice Welfare 17(2), 201\u2013215 (2000)","journal-title":"Soc. Choice Welfare"},{"key":"25_CR20","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 6th ACM Conference on Economics and Computation (EC), pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-1-349-07357-3_12","volume-title":"Arrow and the Foundations of the Theory of Economic Policy","author":"ES Maskin","year":"1987","unstructured":"Maskin, E.S.: On the fair allocation of indivisible goods. In: Feiwel, G.R. (ed.) Arrow and the Foundations of the Theory of Economic Policy, pp. 341\u2013349. Palgrave Macmillan, London (1987). https:\/\/doi.org\/10.1007\/978-1-349-07357-3_12"},{"issue":"3","key":"25_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0165-4896(02)00064-1","volume":"44","author":"M Meertens","year":"2002","unstructured":"Meertens, M., Potters, J., Reijnierse, H.: Envy-free and pareto efficient allocations in economies with indivisible goods and money. Math. Soc. Sci. 44(3), 223\u2013233 (2002)","journal-title":"Math. Soc. Sci."},{"key":"25_CR23","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2004)"},{"issue":"1","key":"25_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00199-005-0014-1","volume":"29","author":"S Ohseto","year":"2006","unstructured":"Ohseto, S.: Characterizations of strategy-proof and fair mechanisms for allocating indivisible goods. Econ. Theory 29(1), 111\u2013121 (2006)","journal-title":"Econ. Theory"},{"issue":"4","key":"25_CR25","doi-asserted-by":"publisher","first-page":"671","DOI":"10.2307\/1883182","volume":"92","author":"E Pazner","year":"1978","unstructured":"Pazner, E., Schmeidler, D.: Egalitarian equivalent allocations: a new concept of economic equity. Q. J. Econ. 92(4), 671\u2013687 (1978)","journal-title":"Q. J. Econ."},{"key":"25_CR26","doi-asserted-by":"publisher","first-page":"2584","DOI":"10.1137\/1.9781611975031.165","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Benjamin Plaut","year":"2018","unstructured":"Plaut, B., Rougligarden, T.: Almost envy-freeness with general valuations. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2584\u20132603 (2018)"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the 14th ACM Conference on Economics and Computation (EC), pp. 675\u2013692 (2014)","DOI":"10.1145\/2600057.2602835"},{"issue":"1","key":"25_CR28","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01769864","volume":"13","author":"M Quinzii","year":"1984","unstructured":"Quinzii, M.: Core and competitive equilibria with indivisibilities. Int. J. Game Theory 13(1), 41\u201360 (1984)","journal-title":"Int. J. Game Theory"},{"key":"25_CR29","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16, 101\u2013104 (1948)","journal-title":"Econometrica"},{"issue":"10","key":"25_CR30","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"FE Su","year":"1999","unstructured":"Su, F.E.: Rental harmony: sperner\u2019s lemma in fair division. Am. Math. Monthly 106(10), 930\u2013942 (1999)","journal-title":"Am. Math. Monthly"},{"issue":"4","key":"25_CR31","doi-asserted-by":"publisher","first-page":"939","DOI":"10.2307\/1912044","volume":"51","author":"LG Svensson","year":"1983","unstructured":"Svensson, L.G.: Large indivisibles: an analysis with respect to price equilibrium and fairness. Econometrica 51(4), 939\u2013954 (1983)","journal-title":"Econometrica"},{"key":"25_CR32","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"H Varian","year":"1974","unstructured":"Varian, H.: Equity, envy and efficiency. J. Econ. Theory 9, 63\u201391 (1974)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"25_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-4068(85)90023-0","volume":"14","author":"D Weller","year":"1985","unstructured":"Weller, D.: Fair division of a measurable space. J. Math. Econ. 14(1), 5\u201317 (1985)","journal-title":"J. Math. Econ."}],"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-030-30473-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:35:08Z","timestamp":1709811308000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}