{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:31:22Z","timestamp":1726043482464},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030302436"},{"type":"electronic","value":"9783030302443"}],"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-30244-3_49","type":"book-chapter","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T07:05:29Z","timestamp":1567494329000},"page":"593-605","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fair Division Minimizing Inequality"],"prefix":"10.1007","author":[{"given":"Martin","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cunjing","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"key":"49_CR1","unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., Walsh, T.: Online fair division: analysing a food bank problem. In: Proceedings of the Twenty-Fourth IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 2540\u20132546 (2015)"},{"issue":"3","key":"49_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0531(70)90039-6","volume":"2","author":"A Atkinson","year":"1970","unstructured":"Atkinson, A.: On the measurement of inequality. J. Econ. Theory 2(3), 244\u2013263 (1970)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"49_CR3","first-page":"195","volume":"3","author":"C Bevi\u00e1","year":"1998","unstructured":"Bevi\u00e1, C.: Fair allocation in a general model with indivisible goods. Rev. Econ. Des. 3(3), 195\u2013213 (1998)","journal-title":"Rev. Econ. Des."},{"issue":"2","key":"49_CR4","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":"2","key":"49_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00355-017-1082-4","volume":"50","author":"K Bosmans","year":"2018","unstructured":"Bosmans, K., \u00d6zt\u00fcrk, Z.E.: An axiomatic approach to the measurement of envy. Soc. Choice Welf. 50(2), 247\u2013264 (2018)","journal-title":"Soc. Choice Welf."},{"key":"49_CR6","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. (JAIR) 32, 525\u2013564 (2008). \n                      https:\/\/doi.org\/10.1613\/jair.2467","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"2","key":"49_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/B:THEO.0000024421.85722.0a","volume":"55","author":"SJ Brams","year":"2003","unstructured":"Brams, S.J., Edelman, P.H., Fishburn, P.C.: Fair division of indivisible items. Theor. Decis. 55(2), 147\u2013180 (2003)","journal-title":"Theor. Decis."},{"issue":"6","key":"49_CR8","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":"1","key":"49_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10479-008-0335-0","volume":"163","author":"Y Chevaleyre","year":"2008","unstructured":"Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation in k-additive domains: preference representation and complexity. Ann. Oper. Res. 163(1), 49\u201362 (2008)","journal-title":"Ann. Oper. Res."},{"key":"49_CR10","unstructured":"Endriss, U.: Reduction of economic inequality in combinatorial domains. In: Gini, M., Shehory, O., Ito, T., Jonker, C. (eds.) International conference on Autonomous Agents and Multi-Agent Systems, AAMAS 2013, IFAAMAS, pp. 175\u2013182 (2013)"},{"issue":"6","key":"49_CR11","first-page":"995","volume":"64","author":"AM Feldman","year":"1974","unstructured":"Feldman, A.M., Kirman, A.: Fairness and envy. Am. Econ. Rev. 64(6), 995\u20131005 (1974)","journal-title":"Am. Econ. Rev."},{"key":"49_CR12","unstructured":"Gini, C.: Variabilit\u00e0 e mutabilit\u00e0. C. Cuppini, Bologna (1912)"},{"issue":"4","key":"49_CR13","doi-asserted-by":"publisher","first-page":"162","DOI":"10.2307\/1927875","volume":"18","author":"EM Hoover","year":"1936","unstructured":"Hoover, E.M.: The measurement of industrial localization. Rev. Econ. Stat. 18(4), 162\u2013171 (1936)","journal-title":"Rev. Econ. Stat."},{"key":"49_CR14","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: Proceedings of the First ADT International Conference, Venice, Italy, 20\u201323 October 2009, pp. 98\u2013110 (2009)","DOI":"10.1007\/978-3-642-04428-1_9"},{"key":"49_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"key":"49_CR16","unstructured":"Lesca, J., Perny, P.: LP solvable models for multiagent fair allocation problems. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 393\u2013398. IOS Press (2010)"},{"issue":"4","key":"49_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265\u2013368 (2013)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Procaccia, A., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Babaioff, M., Conitzer, V., Easley, D. (eds.) ACM EC 2014, pp. 675\u2013692 (2014)","DOI":"10.1145\/2600057.2602835"},{"key":"49_CR19","unstructured":"Sanchez-Perez, J., Plata-Perez, L., Sanchez-Sanchez, F.: An elementary characterization of the Gini index. MPRA Paper, University Library of Munich, Germany (2012)"},{"key":"49_CR20","unstructured":"Schneckenburger, S., Dorn, B., Endriss, U.: The Atkinson inequality index in multiagent resource allocation. In: Larson, K., Winikoff, M., Das, S., Durfee, E. (eds.) Proceedings of the 16th AAMAS 2017, pp. 272\u2013280. ACM (2017)"},{"issue":"2","key":"49_CR21","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30244-3_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T07:13:02Z","timestamp":1567494782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30244-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030302436","9783030302443"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30244-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vila Real","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2019.utad.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"252","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":"119","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":"6","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.32","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":"1.86","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)"}}]}}