{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:39:59Z","timestamp":1768268399979,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031228315","type":"print"},{"value":"9783031228322","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22832-2_14","type":"book-chapter","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T09:05:33Z","timestamp":1670490333000},"page":"237-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On Best-of-Both-Worlds Fair-Share Allocations"],"prefix":"10.1007","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[]},{"given":"Tomer","family":"Ezra","sequence":"additional","affiliation":[]},{"given":"Uriel","family":"Feige","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,9]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Christodoulou, G., Markakis, E.: Truthful allocation mechanisms without payments: Characterization and implications on fairness. In: Proceedings of the 2017 ACM Conference on Economics and Computation, EC 2017, pp. 545\u2013562 (2017)","DOI":"10.1145\/3033274.3085147"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3147173","volume":"13","author":"G Amanatidis","year":"2017","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms (TALG) 13(4), 1\u201328 (2017)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-64946-3_24","volume-title":"Web and Internet Economics","author":"H Aziz","year":"2020","unstructured":"Aziz, H.: Simultaneously achieving ex-ante and ex-post fairness. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 341\u2013355. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_24"},{"key":"14_CR4","unstructured":"Aziz, H., Bir\u00f3, P., Lang, J., Lesca, J., Monnot, J.: Optimal reallocation under additive and ordinal preferences. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 402\u2013410. ACM (2016)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Best-of-both-worlds fair-share allocations. arXiv preprint arXiv:2102.04909 (2021)","DOI":"10.1007\/978-3-031-22832-2_14"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. In: Thirty-Fifth AAAI Conference on Artificial Intelligence, pp. 5119\u20135126. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair-share allocations for agents with arbitrary entitlements. In: EC \u201921: The 22nd ACM Conference on Economics and Computation, p. 127. ACM (2021)","DOI":"10.1145\/3465456.3467559"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K.: On the proximity of markets with integral equilibria. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI, pp. 1748\u20131755 (2019)","DOI":"10.1609\/aaai.v33i01.33011748"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3381525","volume":"8","author":"S Barman","year":"2020","unstructured":"Barman, S., Krishnamurthy, S.K.: Approximation algorithms for maximin fair division. ACM Trans. Econ. Comput. (TEAC) 8(1), 1\u201328 (2020)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I Bez\u00e1kov\u00e1","year":"2005","unstructured":"Bez\u00e1kov\u00e1, I., Dani, V.: Allocating indivisible goods. ACM SIGecom Exchanges 5(3), 11\u201318 (2005)","journal-title":"Allocating indivisible goods. ACM SIGecom Exchanges"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295\u2013328 (2001)","journal-title":"J. Econ. Theory"},{"issue":"6","key":"14_CR12","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."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1257\/aer.103.2.585","volume":"103","author":"E Budish","year":"2013","unstructured":"Budish, E., Che, Y.K., Kojima, F., Milgrom, P.: Designing random allocation mechanisms: theory and applications. Am. Econ. Rev. 103(2), 585\u2013623 (2013)","journal-title":"Am. Econ. Rev."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","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. (TEAC) 7(3), 1\u201332 (2019)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Freeman, R., Shah, N.: Fair public decision making. In: Proceedings of the 2017 ACM Conference on Economics and Computation, pp. 629\u2013646 (2017)","DOI":"10.1145\/3033274.3085125"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"De Keijzer, B., Bouveret, S., Klos, T., Zhang, Y.: On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In: International Conference on Algorithmic Decision Theory, pp. 98\u2013110 (2009)","DOI":"10.1007\/978-3-642-04428-1_9"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-030-94676-0_20","volume-title":"Web and Internet Economics","author":"U Feige","year":"2022","unstructured":"Feige, U., Sapir, A., Tauber, L.: A tight negative example for\u00a0MMS fair allocations. In: Feldman, M., Fu, H., Talgam-Cohen, I. (eds.) WINE 2021. LNCS, vol. 13112, pp. 355\u2013372. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94676-0_20"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Freeman, R., Shah, N., Vaish, R.: Best of both worlds: ex-ante and ex-post fairness in resource allocation. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 21\u201322 (2020)","DOI":"10.1145\/3391403.3399537"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Garg, J., McGlaughlin, P., Taki, S.: Approximating maximin share allocations. Open access series in informatics 69 (2019)","DOI":"10.1613\/jair.1.11702"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Garg, J., Taki, S.: An improved approximation algorithm for maximin shares. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 379\u2013380 (2020)","DOI":"10.1145\/3391403.3399526"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Ghodsi, M., Hajiaghayi, M.T., 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, pp. 539\u2013556. ACM (2018)","DOI":"10.1145\/3219166.3219238"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Halpern, D., Procaccia, A.D., Psomas, A., Shah, N.: Fair division with binary valuations: One rule to rule them all. In: Web and Internet Economics - 16th International Conference (2020)","DOI":"10.1007\/978-3-030-64946-3_26"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: Fair enough: Guaranteeing approximate maximin shares. J. ACM 65(2), 8:1\u20138:27 (2018)","DOI":"10.1145\/3140756"},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1), 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"14_CR25","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":"14_CR26","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Budgeted allocations in the full-information setting. In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, pp. 247\u2013253. Springer (2008)","DOI":"10.1007\/978-3-540-85363-3_20"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22832-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:48:01Z","timestamp":1710269281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22832-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228315","9783031228322"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22832-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Troy, NY","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","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":"wine2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.rpi.edu\/wine2022\/","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":"126","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":"19","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":"15% - 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":"6","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":"19 abstracts in the back matter","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)"}}]}}