{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T20:18:06Z","timestamp":1768681086502,"version":"3.49.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030859466","type":"print"},{"value":"9783030859473","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_25","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"376-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two Birds with One Stone: Fairness and Welfare via Transfers"],"prefix":"10.1007","author":[{"given":"Vishnu V.","family":"Narayan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mashbat","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"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"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00179981","volume":"12","author":"E Aragones","year":"1995","unstructured":"Aragones, E.: A derivation of the money Rawlsian solution. Soc. Choice Welfare 12(3), 267\u2013276 (1995)","journal-title":"Soc. Choice Welfare"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-35389-6_5","volume-title":"Web and Internet Economics","author":"ER Arunachaleswaran","year":"2019","unstructured":"Arunachaleswaran, E.R., Barman, S., Kumar, R., Rathi, N.: Fair and efficient cake division with connected pieces. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 57\u201370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_5"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H.: Achieving envy-freeness and equitability with monetary transfers (2020)","DOI":"10.1609\/aaai.v35i6.16645"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013427 (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-030-64946-3_25","volume-title":"Web and Internet Economics","author":"S Barman","year":"2020","unstructured":"Barman, S., Bhaskar, U., Shah, N.: Optimal bounds on the price of fairness for indivisible goods. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 356\u2013369. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_25"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S., Vaish, R.: Finding fair and efficient allocations. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 557\u2013574 (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"25_CR8","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., Yang, E.: Optimal proportional cake cutting with connected pieces. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Bei, X., Lu, X., Manurangsi, P., Suksompong, W.: The price of fairness for indivisible goods. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, pp. 81\u201387 (2019)","DOI":"10.24963\/ijcai.2019\/12"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-030-57980-7_3","volume-title":"Algorithmic Game Theory","author":"N Benabbou","year":"2020","unstructured":"Benabbou, N., Chakraborty, M., Igarashi, A., Zick, Y.: Finding fair and efficient allocations when valuations don\u2019t add up. In: Harks, T., Klimm, M. (eds.) SAGT 2020. LNCS, vol. 12283, pp. 32\u201346. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57980-7_3"},{"issue":"1","key":"25_CR11","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., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17\u201331 (2011)","journal-title":"Oper. Res."},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1995.11990526","volume":"102","author":"S Brams","year":"1995","unstructured":"Brams, S., Taylor, A.: An envy-free cake division protocol. Am. Math. Mon. 102(1), 9\u201318 (1995)","journal-title":"Am. Math. Mon."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Brustle, J., Dippel, J., Narayan, V., Suzuki, M., Vetta, A.: One dollar each eliminates envy. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 23\u201339 (2020)","DOI":"10.1145\/3391403.3399447"},{"issue":"6","key":"25_CR14","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_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-10841-9_45","volume-title":"Internet and Network Economics","author":"I Caragiannis","year":"2009","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 475\u2013482. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_45"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A., Shah, N., Wang, J.: The unreasonable fairness of maximum nash welfare. ACM Trans. Econ. Comput. 7(3), 12:1\u201332 (2019)","DOI":"10.1145\/3355902"},{"key":"25_CR17","unstructured":"Cohler, Y., Lai, J., Parkes, D., Procaccia, A.: Optimal envy-free cake cutting. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, 7\u201311 August 2011 (2011)"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"LE Dubins","year":"1961","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Mon. 68(1), 1\u201317 (1961)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"25_CR19","first-page":"45","volume":"7","author":"D Foley","year":"1967","unstructured":"Foley, D.: Resource allocation and the public sector. Yale Econ Essays 7(1), 45\u201398 (1967)","journal-title":"Yale Econ Essays"},{"key":"25_CR20","unstructured":"Gamow, G., Stern, M.: Puzzle-Math. Viking Press (1958)"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Ghodsi, M., Taghi Hajiaghayi, M., Seddighin, M., Seddighin, S., Yami, H.: Fair allocation of indivisible goods: improvements and generalizations. In: Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, 18\u201322 June 2018, pp. 539\u2013556 (2018)","DOI":"10.1145\/3219166.3219238"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Goko, H., et al.: Fair and truthful mechanism with limited subsidy (2021)","DOI":"10.2139\/ssrn.4100937"},{"issue":"4","key":"25_CR23","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s003550100149","volume":"19","author":"CJ Haake","year":"2002","unstructured":"Haake, C.J., Raith, M., Su, F.: 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"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-030-30473-7_25","volume-title":"Algorithmic Game Theory","author":"D Halpern","year":"2019","unstructured":"Halpern, D., Shah, N.: Fair division with subsidy. In: Fotakis, D., Markakis, E. (eds.) SAGT 2019. LNCS, vol. 11801, pp. 374\u2013389. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30473-7_25"},{"key":"25_CR25","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, 201\u2013215 (2000)","journal-title":"Soc. Choice Welfare"},{"issue":"2","key":"25_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3140756","volume":"65","author":"D Kurokawa","year":"2018","unstructured":"Kurokawa, D., Procaccia, A., Wang, J.: Fair enough: guaranteeing approximate maximin shares. J. ACM 65(2), 1\u201327 (2018)","journal-title":"J. ACM"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce (EC), pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Maskin, E.: On the fair allocation of indivisible goods, pp. 341\u2013349 (1987)","DOI":"10.1007\/978-1-349-07357-3_12"},{"issue":"1","key":"25_CR29","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"},{"issue":"8","key":"25_CR30","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1080\/00029890.1980.11995109","volume":"87","author":"W Stromquist","year":"1980","unstructured":"Stromquist, W.: How to cut a cake fairly. Am. Math. Mon. 87(8), 640\u2013644 (1980)","journal-title":"Am. Math. Mon."},{"issue":"10","key":"25_CR31","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"F Su","year":"1999","unstructured":"Su, F.: Rental harmony: Sperner\u2019s lemma in fair division. Am. Math. Mon. 106(10), 930\u2013942 (1999)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"25_CR32","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"},{"issue":"2","key":"25_CR33","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0165-4896(93)90047-M","volume":"25","author":"K Tadenuma","year":"1993","unstructured":"Tadenuma, K., Thomson, W.: The fair allocation of an indivisible good when monetary compensations are possible. Math. Soc. Sci. 25(2), 117\u2013132 (1993)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"25_CR34","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(1), 63\u201391 (1974)","journal-title":"J. Econ. Theory"},{"issue":"1","key":"25_CR35","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-247X(80)90225-5","volume":"78","author":"DR Woodall","year":"1980","unstructured":"Woodall, D.R.: Dividing a cake fairly. J. Math. Anal. Appl. 78(1), 233\u2013247 (1980)","journal-title":"J. Math. Anal. Appl."}],"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-85947-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T03:38:27Z","timestamp":1673235507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","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":"73","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":"36% - 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.5","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)"}},{"value":"4 abstracts of presented papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}