{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T07:16:10Z","timestamp":1765178170723,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031432538"},{"type":"electronic","value":"9783031432545"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43254-5_16","type":"book-chapter","created":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T23:04:03Z","timestamp":1693782243000},"page":"271-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Price of\u00a0Equity with\u00a0Binary Valuations and\u00a0Few Agent Types"],"prefix":"10.1007","author":[{"given":"Umang","family":"Bhaskar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditi","family":"Sethia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Vaish","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,4]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2021.02.020","volume":"863","author":"G Amanatidis","year":"2021","unstructured":"Amanatidis, G., Birmpas, G., Filos-Ratsikas, A., Hollender, A., Voudouris, A.A.: Maximum nash welfare and other stories about EFX. Theoret. Comput. Sci. 863, 69\u201385 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Rey, S.: Almost group envy-free allocation of indivisible goods and chores. In: Proceedings of the 29th International Conference on International Joint Conferences on Artificial Intelligence, pp. 39\u201345 (2021)","DOI":"10.24963\/ijcai.2020\/6"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence, vol. 35, pp. 5119\u20135126 (2021)","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Barman, S., Bhaskar, U., Shah, N.: Optimal bounds on the price of fairness for indivisible goods. In: Proceedings of the 16th International Conference on Web and Internet Economics, pp. 356\u2013369 (2020)","DOI":"10.1007\/978-3-030-64946-3_25"},{"issue":"7","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1007\/s00224-021-10039-8","volume":"65","author":"X Bei","year":"2021","unstructured":"Bei, X., Lu, X., Manurangsi, P., Suksompong, W.: The price of fairness for indivisible goods. Theory Comput. Syst. 65(7), 1069\u20131093 (2021). https:\/\/doi.org\/10.1007\/s00224-021-10039-8","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3485006","volume":"9","author":"N Benabbou","year":"2021","unstructured":"Benabbou, N., Chakraborty, M., Igarashi, A., Zick, Y.: Finding fair and efficient allocations for matroid rank valuations. ACM Trans. Econ. Comput. 9(4), 1\u201341 (2021)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"1","key":"16_CR8","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.F., Trichakis, N.: The price of fairness. Oper. Res. 59(1), 17\u201331 (2011)","journal-title":"Oper. Res."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Bhaskar, U., Misra, N., Sethia, A., Vaish, R.: The Price of Equity with Binary Valuations and Few Agent Types. arXiv preprint arXiv:2307.06726 (2023)","DOI":"10.1007\/978-3-031-43254-5_16"},{"key":"16_CR10","unstructured":"Bliem, B., Bredereck, R., Niedermeier, R.: Complexity of efficient and envy-free resource allocation: few agents, resources, or utility levels. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp. 102\u2013108 (2016)"},{"key":"16_CR11","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, pp. 135\u2013141 (2017)","DOI":"10.24963\/ijcai.2017\/20"},{"key":"16_CR12","unstructured":"Br\u00e2nzei, S., Lv, Y., Mehta, R.: To give or not to give: fair division for single minded valuations. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, pp. 123\u2013129 (2016)"},{"issue":"6","key":"16_CR13","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":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50(4), 589\u2013610 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"16_CR15","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. 7(3), 1\u201332 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"2","key":"16_CR16","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":"16_CR17","doi-asserted-by":"crossref","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Mon. 68(1P1), 1\u201317 (1961)","DOI":"10.1080\/00029890.1961.11989615"},{"issue":"1","key":"16_CR18","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":"16_CR19","unstructured":"Foley, D.: Resource Allocation and the Public Sector. Yale Economic Essays, pp. 45\u201398 (1967)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Freeman, R., Sikdar, S., Vaish, R., Xia, L.: Equitable allocations of indivisible goods. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 280\u2013286 (2019)","DOI":"10.24963\/ijcai.2019\/40"},{"key":"16_CR21","unstructured":"Gamow, G., Stern, M.: Puzzle-Math (1958)"},{"key":"16_CR22","unstructured":"Garg, J., Kulkarni, P., Murhekar, A.: On fair and efficient allocations of indivisible public goods. In: Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 213, pp. 22:1\u201322:19 (2021)"},{"key":"16_CR23","unstructured":"Gourv\u00e8s, L., Monnot, J., Tlilane, L.: Near fairness in matroids. In: Proceedings of the 21st European Conference on Artificial Intelligence, pp. 393\u2013398 (2014)"},{"issue":"2","key":"16_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.tcs.2020.07.008","volume":"841","author":"M Kyropoulou","year":"2020","unstructured":"Kyropoulou, M., Suksompong, W., Voudouris, A.A.: Almost envy-freeness in group resource allocation. Theoret. Comput. Sci. 841, 110\u2013123 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR26","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":"16_CR27","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2004)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Nash Jr., J.F.: The bargaining problem. Econometrica 155\u2013162 (1950)","DOI":"10.2307\/1907266"},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.mathsocsci.2019.11.003","volume":"103","author":"J Ortega","year":"2020","unstructured":"Ortega, J.: Multi-unit assignment under dichotomous preferences. Math. Soc. Sci. 103, 15\u201324 (2020)","journal-title":"Math. Soc. Sci."},{"key":"16_CR30","unstructured":"Roos, M., Rothe, J.: Complexity of social welfare optimization in multiagent resource allocation. In: Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, pp. 641\u2013648 (2010)"},{"issue":"2","key":"16_CR31","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"16_CR32","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1998)"},{"issue":"1","key":"16_CR33","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"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Sun, A., Chen, B., Doan, X.V.: Equitability and welfare maximization for allocating indivisible items. Auton. Agents Multi-Agent Syst. 37(8) (2023)","DOI":"10.1007\/s10458-023-09618-5"},{"key":"16_CR35","unstructured":"Sun, A., Chen, B., Vinh Doan, X.: Connections between fairness criteria and efficiency for allocating indivisible chores. In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1281\u20131289 (2021)"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Viswanathan, V., Zick, Y.: A general framework for fair allocation with matroid rank valuations. In: Proceedings of the 24th ACM Conference on Economics and Computation, pp. 1129\u20131152 (2023)","DOI":"10.1145\/3580507.3597675"}],"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-031-43254-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T22:41:08Z","timestamp":1703112068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43254-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031432538","9783031432545"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43254-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"4 September 2023","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":"Egham","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2023","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":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59","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":"44% - 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":"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)"}}]}}