{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:44:44Z","timestamp":1762101884306,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T00:00:00Z","timestamp":1469491200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund (AT)","doi-asserted-by":"publisher","award":["P 23724-G11"],"award-info":[{"award-number":["P 23724-G11"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc Choice Welf"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00355-016-0982-z","type":"journal-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T08:02:25Z","timestamp":1469520145000},"page":"543-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Proportional Borda allocations"],"prefix":"10.1007","volume":"47","author":[{"given":"Andreas","family":"Darmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1225-5943","authenticated-orcid":false,"given":"Christian","family":"Klamler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,26]]},"reference":[{"key":"982_CR1","unstructured":"Aziz H, Gaspers S, Mackenzie S, Walsh T (2014) Fair assignment of indivisible objects under ordinal preferences. In: Proceedings of International conference on autonomous agents and multi-agentsystems, AAMAS \u201914, Paris, France, pp 1305\u20131312"},{"key":"982_CR2","unstructured":"Baumeister D, Bouveret S, Lang J, Nguyen T, Rothe J, Saffidine A (2013) Positional scoring rules for the allocation of indivisiblegoods. In: Proceedings of 11th European workshop on multi-agentsystems (EUMAS), Toulouse, France, pp 1\u201314"},{"key":"982_CR3","unstructured":"Bouveret S, Lang J (2011) A general elicitation-free protocol for allocating indivisible goods. In: Proceedings of IJCAI 2011, pp 73\u201378 (IJCAI\/AAAI)"},{"key":"982_CR4","unstructured":"Bouveret S, Lema\u00eetre M (2014) Characterizing conflicts in fair division of indivisible goods using a scale of criteria. In: Proceedings of International conference on autonomous agents and multi-agent systems, AAMAS \u201914, Paris, France, May 5\u20139, 2014, pp 1321\u20131328"},{"key":"982_CR5","volume-title":"Handbook of computational social choice, chapter 12","author":"S Bouveret","year":"2016","unstructured":"Bouveret S, Chevaleyre Y, Maudet N (2016) Fair division of indivisible goods. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia A (eds) Handbook of computational social choice, chapter 12. Cambridge University Press, New York"},{"issue":"4","key":"982_CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1177\/1043463105058317","volume":"17","author":"S Brams","year":"2005","unstructured":"Brams S, King D (2005) Efficient fair division: help the worst off or avoid envy? Ration Soc 17(4):387\u2013421","journal-title":"Ration Soc"},{"key":"982_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair division: from cake-cutting to dispute resolution","author":"S Brams","year":"1996","unstructured":"Brams S, Taylor A (1996) Fair division: from cake-cutting to dispute resolution. Cambridge University Press, New York"},{"key":"982_CR8","volume-title":"The win\u2013win solution: guaranteeing fair shares to everybody","author":"S Brams","year":"2000","unstructured":"Brams S, Taylor A (2000) The win\u2013win solution: guaranteeing fair shares to everybody. W. W. Norton & Company, New York"},{"issue":"6","key":"982_CR9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.2307\/2678433","volume":"98","author":"S Brams","year":"2001","unstructured":"Brams S, Edelman P, Fishburn P (2001) Paradoxes of fair division. J Philos 98(6):300\u2013314","journal-title":"J Philos"},{"issue":"2","key":"982_CR10","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s00355-011-0599-1","volume":"39","author":"S Brams","year":"2012","unstructured":"Brams S, Kilgour M, Klamler C (2012) The undercut procedure: an algorithm for the envy-free division of indivisible items. Soc Choice Welf 39(2):615\u2013631","journal-title":"Soc Choice Welf"},{"issue":"2","key":"982_CR11","first-page":"130","volume":"61","author":"S Brams","year":"2014","unstructured":"Brams S, Kilgour M, Klamler C (2014) Two-person fair division of indivisible items: an efficient, envy-free algorithm. Not AMS 61(2):130\u2013141","journal-title":"Not AMS"},{"issue":"6","key":"982_CR12","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish E (2011) The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J Political Econ 119(6):1061\u20131103","journal-title":"J Political Econ"},{"issue":"5","key":"982_CR13","doi-asserted-by":"crossref","first-page":"2237","DOI":"10.1257\/aer.102.5.2237","volume":"102","author":"E Budish","year":"2012","unstructured":"Budish E, Cantillon E (2012) The multi-unit assignment problem: theory and evidence from course allocation at harvard. Am Econ Rev 102(5):2237\u20132271","journal-title":"Am Econ Rev"},{"issue":"9\u201310","key":"982_CR14","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1016\/j.artint.2011.03.005","volume":"175","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis I, Procaccia A (2011) Voting almost maximizes social welfare despite limited communication. Artif Intel 175(9\u201310):1655\u20131671","journal-title":"Artif Intel"},{"key":"982_CR15","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1007\/978-1-4020-7964-1_8","volume-title":"Handbook of utility theory: volume 2 extensions, chapter interpersonally comparable utility","author":"M Fleurbaey","year":"2004","unstructured":"Fleurbaey M, Hammond P (2004) Handbook of utility theory: volume 2 extensions, chapter interpersonally comparable utility. Springer, Boston, pp 1179\u20131285"},{"issue":"2","key":"982_CR16","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s003550100119","volume":"19","author":"D Herreiner","year":"2002","unstructured":"Herreiner D, Puppe C (2002) A simple procedure for finding equitable allocations of indivisible goods. Soc Choice Welf 19(2):415\u2013430","journal-title":"Soc Choice Welf"},{"issue":"2","key":"982_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1086\/260757","volume":"87","author":"A Hylland","year":"1979","unstructured":"Hylland A, Zeckhauser R (1979) The efficient allocation of individuals to positions. J Polit Econ 87(2):293\u2013314","journal-title":"J Polit Econ"},{"key":"982_CR18","unstructured":"Kalinowski T, Narodytska N, Walsh T (2013) A social welfare optimal sequential allocation procedure. In: IJCAI 2013, Proceedings of the 23rd international joint conference on artificial intelligence, Beijing,"},{"key":"982_CR19","doi-asserted-by":"crossref","unstructured":"Procaccia A, Wang J (2014) Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, EC \u201914, New York, NY, USA, 2014, pp 675\u2013692 (ACM)","DOI":"10.1145\/2600057.2602835"},{"key":"982_CR20","doi-asserted-by":"crossref","unstructured":"Saari D(1995) Basic geometry of voting. Springer, Berlin","DOI":"10.1007\/978-3-642-57748-2"},{"key":"982_CR21","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus H (1948) The problem of fair division. Econometrica 16:101\u2013104","journal-title":"Econometrica"},{"key":"982_CR22","volume-title":"Handbook of computational social choice, chapter 11","author":"W Thomson","year":"2016","unstructured":"Thomson W (2016) Introduction to the theory of fair allocation. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia A (eds) Handbook of computational social choice, chapter 11. Cambridge University Press, New York"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-016-0982-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00355-016-0982-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-016-0982-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:11:31Z","timestamp":1498317091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00355-016-0982-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,26]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["982"],"URL":"https:\/\/doi.org\/10.1007\/s00355-016-0982-z","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"type":"print","value":"0176-1714"},{"type":"electronic","value":"1432-217X"}],"subject":[],"published":{"date-parts":[[2016,7,26]]}}}