{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T12:29:03Z","timestamp":1751545743484,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030579791"},{"type":"electronic","value":"9783030579807"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-57980-7_3","type":"book-chapter","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:04:10Z","timestamp":1599519850000},"page":"32-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Finding Fair and Efficient Allocations When Valuations Don\u2019t Add Up"],"prefix":"10.1007","author":[{"given":"Nawal","family":"Benabbou","sequence":"first","affiliation":[]},{"given":"Mithun","family":"Chakraborty","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Igarashi","sequence":"additional","affiliation":[]},{"given":"Yair","family":"Zick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, F., Dickerson, J.P., Fuge, M.: Diverse weighted bipartite B-matching. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp. 35\u201341 (2017)","DOI":"10.24963\/ijcai.2017\/6"},{"key":"3_CR2","unstructured":"Aziz, H., Gaspers, S., Sun, Z., Walsh, T.: From matching with diversity constraints to matching with regional quotas. In: Proceedings of the 18th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 377\u2013385 (2019)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Rey, S.: Almost group envy-free allocation of indivisible goods and chores. CoRR abs\/1907.09279 (2019)","DOI":"10.24963\/ijcai.2020\/6"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Ye, C.: Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In: Proceedings of the 10th Conference on Web and Internet Economics (WINE), pp. 1\u201314 (2014)","DOI":"10.1007\/978-3-319-13129-0_1"},{"key":"3_CR5","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. CoRR abs\/2002.10704 (2020)"},{"key":"3_CR6","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. ACM (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"3_CR7","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":"3_CR8","doi-asserted-by":"crossref","unstructured":"Benabbou, N., Chakraborty, M., Elkind, E., Zick, Y.: Fairness towards groups of agents in the allocation of indivisible items. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 95\u2013101 (2019)","DOI":"10.24963\/ijcai.2019\/14"},{"key":"3_CR9","unstructured":"Benabbou, N., Chakraborty, M., Xuan, V.H., Sliwinski, J., Zick, Y.: Diversity constraints in public housing allocation. In: Proceedings of the 17th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 973\u2013981 (2018)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Biswas, A., Barman, S.: Fair division under cardinality constraints. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pp. 91\u201397 (2018)","DOI":"10.24963\/ijcai.2018\/13"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair allocation of indivisible goods. In: Felix, B., Vincent, C., Ulle, E., J\u00e9r\u00f4me, L., Procaccia, A.D. (ed.) Handbook of Computational Social Choice, Chap. 12, pp. 284\u2013310. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.013"},{"issue":"6","key":"3_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."},{"key":"3_CR13","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. ACM (2016)","DOI":"10.1145\/2940716.2940726"},{"issue":"2","key":"3_CR14","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":"3_CR15","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Sankararaman, K.A., Srinivasan, A., Xu, P.: Balancing relevance and diversity in online bipartite matching via submodularity. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), pp. 1877\u20131884 (2019)","DOI":"10.1609\/aaai.v33i01.33011877"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J Edmonds","year":"1979","unstructured":"Edmonds, J.: Matroid intersection. Ann. Discrete Math. 4, 39\u201349 (1979). Discrete Optimization I","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"3_CR17","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. Statist. 30(1), 165\u2013168 (1959)","journal-title":"Ann. Math. Statist."},{"key":"3_CR18","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"},{"key":"3_CR19","unstructured":"Frank, A., Murota, K.: Discrete decreasing minimization, Part III: Network Flows. arXiv e-prints arXiv:1907.02673v2, September 2019"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-57586-5_26","volume-title":"Algorithms and Complexity","author":"L Gourv\u00e8s","year":"2017","unstructured":"Gourv\u00e8s, L., Monnot, J.: Approximate maximin share allocations in Matroids. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 310\u2013321. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_26"},{"key":"3_CR21","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 (2020), unpublished Manuscript","DOI":"10.1007\/978-3-030-64946-3_26"},{"key":"3_CR22","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"B Korte","year":"2006","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics. Springer, Heidelberg (2006)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Lang, J., Skowron, P.K.: Multi-attribute proportional representation. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), pp. 530\u2013536 (2016)","DOI":"10.1609\/aaai.v30i1.10024"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.geb.2017.10.016","volume":"106","author":"RP Leme","year":"2017","unstructured":"Leme, R.P.: Gross substitutability: an algorithmic survey. Games Econ. Behav. 106, 294\u2013316 (2017)","journal-title":"Games Econ. Behav."},{"key":"3_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 (EC), pp. 125\u2013131. ACM (2004)","DOI":"10.1145\/988772.988792"},{"issue":"1","key":"3_CR27","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10472-012-9328-4","volume":"68","author":"TT Nguyen","year":"2013","unstructured":"Nguyen, T.T., Roos, M., Rothe, J.: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Ann. Math. Artif. Intell. 68(1), 65\u201390 (2013). https:\/\/doi.org\/10.1007\/s10472-012-9328-4","journal-title":"Ann. Math. Artif. Intell."},{"key":"3_CR29","volume-title":"Matroid Theory. Oxford Graduate Texts in Mathematics","author":"J Oxley","year":"2011","unstructured":"Oxley, J.: Matroid Theory. Oxford Graduate Texts in Mathematics, 2nd edn. Oxford Univerity Press, Oxford (2011)","edition":"2"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Ramezani, S., Endriss, U.: Nash social welfare in multiagent resource allocation. In: Proceedings of the 11th International Workshop on Agent-Mediated Electronic Commerce and Trading Agents Design and Analysis (AMEC\/TADA), pp. 117\u2013131 (2010)","DOI":"10.1007\/978-3-642-15117-0_9"},{"key":"3_CR31","volume-title":"Collective Choice and Social Welfare","author":"A Sen","year":"1970","unstructured":"Sen, A.: Collective Choice and Social Welfare. Holden Day, San Francisco (1970)"},{"key":"3_CR32","unstructured":"Shapley, L.S.: Complements and substitutes in the optimal assignment problem. ASTIA Document (1958)"},{"key":"3_CR33","unstructured":"Suzuki, T., Tamura, A., Yokoo, M.: Efficient allocation mechanism with endowments and distributional constraints. In: Proceedings of the 17th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 50\u201358 (2018)"},{"issue":"1","key":"3_CR34","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9(1), 63\u201391 (1974)","journal-title":"J. Econ. Theory"}],"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-57980-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T04:20:41Z","timestamp":1668658841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57980-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579791","9783030579807"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57980-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 September 2020","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":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-augsburg.de\/de\/fakultaet\/mntf\/math\/prof\/opt\/team\/harks\/sagt2020\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"21","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":"40% - 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":"8","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}