{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T22:14:31Z","timestamp":1778883271482,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,8,2]],"date-time":"2016-08-02T00:00:00Z","timestamp":1470096000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RO 1202\/14-1"],"award-info":[{"award-number":["RO 1202\/14-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RO 1202\/14-2"],"award-info":[{"award-number":["RO 1202\/14-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["RO 1202\/15-1"],"award-info":[{"award-number":["RO 1202\/15-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10458-016-9340-x","type":"journal-article","created":{"date-parts":[[2016,8,2]],"date-time":"2016-08-02T02:21:39Z","timestamp":1470104499000},"page":"628-655","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Positional scoring-based allocation of indivisible goods"],"prefix":"10.1007","volume":"31","author":[{"given":"Dorothea","family":"Baumeister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Bouveret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0407-4851","authenticated-orcid":false,"given":"Nhan-Tam","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trung Thanh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdallah","family":"Saffidine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,2]]},"reference":[{"key":"9340_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.artint.2015.06.002","volume":"227","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., & Walsh, T. (2015). Fair assignment of indivisible objects under ordinal preferences. Artificial Intelligence, 227, 71\u201392.","journal-title":"Artificial Intelligence"},{"key":"9340_CR2","unstructured":"Aziz, H., Walsh, T., & Xia, L. (2015). Possible and necessary allocations via sequential mechanisms. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (pp. 468\u2013474). AAAI Press\/IJCAI."},{"key":"9340_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, N., & Sviridenko, M. (2006). The Santa Claus problem. In Proceedings of the 38th ACM Symposium on Theory of Computing (pp. 31\u201340). ACM Press","DOI":"10.1145\/1132516.1132522"},{"key":"9340_CR4","first-page":"197","volume-title":"Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division, chap 4","author":"D Baumeister","year":"2015","unstructured":"Baumeister, D., & Rothe, J. (2015). Preference aggregation by voting. In J. Rothe (Ed.), Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division, chap 4 (pp. 197\u2013325). Berlin: Springer."},{"key":"9340_CR5","volume-title":"Proceedings of the 5th international workshop on computational social choice","author":"D Baumeister","year":"2014","unstructured":"Baumeister, D., Bouveret, S., Lang, J., Nguyen, N., Nguyen, T., Rothe, J., et al. (2014). Axiomatic and computational aspects of scoring allocation rules for indivisible goods. In A. Procaccia & T. Walsh (Eds.), Proceedings of the 5th international workshop on computational social choice. Pittsburgh, PA: Carnegie Mellon University."},{"key":"9340_CR6","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Bouveret, S., Lang, J., Nguyen, T., Nguyen, N., & Rothe, J. (2014). Scoring rules for the allocation of indivisible goods. In Proceedings of the 21st European conference on artificial intelligence (pp. 75\u201380). IOS Press","DOI":"10.3233\/978-1-61499-419-0-75"},{"key":"9340_CR7","unstructured":"Bouveret, S., & Lang, J. (2011). A general elicitation-free protocol for allocating indivisible goods. In Proceedings of the 22nd international joint conference on artificial intelligence (pp 73\u201378). AAAI Press\/IJCAI."},{"issue":"2","key":"9340_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10458-015-9287-3","volume":"30","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., & Lema\u00eetre, M. (2016). Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Journal of Autonomous Agents and Multi-Agent Systems, 30(2), 259\u2013290.","journal-title":"Journal of Autonomous Agents and Multi-Agent Systems"},{"key":"9340_CR9","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Endriss, U., & Lang, J. (2010). Fair division under ordinal preferences: Computing envy-free allocations of indivisible goods. In Proceedings of the 19th European conference on artificial intelligence (pp. 387\u2013392). IOS Press.","DOI":"10.3233\/978-1-60750-606-5-387"},{"key":"9340_CR10","volume-title":"Handbook of computational social choice chap 12","author":"S Bouveret","year":"2016","unstructured":"Bouveret, S., Chevaleyre, Y., & Maudet, N. (2016). Fair allocation of indivisible goods. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. Procaccia (Eds.), Handbook of computational social choice chap 12. Cambridge: Cambridge University Press."},{"key":"9340_CR11","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S1574-0110(02)80008-X","volume-title":"Handbook of social choice and welfare chap 4","author":"S Brams","year":"2002","unstructured":"Brams, S., & Fishburn, P. (2002). Voting procedures. In K. Arrow, A. Sen, & K. Suzumura (Eds.), Handbook of social choice and welfare chap 4 (pp. 173\u2013236). Amsterdam: North-Holland."},{"issue":"4","key":"9340_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1177\/1043463105058317","volume":"17","author":"S Brams","year":"2005","unstructured":"Brams, S., & King, D. (2005). Efficient fair division\u2014help the worst off or avoid envy? Rationality and Society, 17(4), 387\u2013421.","journal-title":"Rationality and Society"},{"key":"9340_CR13","doi-asserted-by":"publisher","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: Cambridge University Press."},{"issue":"2","key":"9340_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/B:THEO.0000024421.85722.0a","volume":"5","author":"S Brams","year":"2004","unstructured":"Brams, S., Edelman, P., & Fishburn, P. (2004). Fair division of indivisible items. Theory and Decision, 5(2), 147\u2013180.","journal-title":"Theory and Decision"},{"issue":"6","key":"9340_CR15","doi-asserted-by":"publisher","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. Journal of Political Economy, 119(6), 1061\u20131103.","journal-title":"Journal of Political Economy"},{"issue":"5","key":"9340_CR16","doi-asserted-by":"publisher","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. The American Economic Review, 102(5), 2237\u20132271.","journal-title":"The American Economic Review"},{"issue":"9\u201310","key":"9340_CR17","doi-asserted-by":"publisher","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. Artificial Intelligence, 175(9\u201310), 1655\u20131671.","journal-title":"Artificial Intelligence"},{"key":"9340_CR18","doi-asserted-by":"publisher","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A., Shah, N., & Wang, J. (2016). The unreasonable fairness of maximum Nash welfare. In Proceedings of the 17th ACM conference on economics and computation.","DOI":"10.1145\/2940716.2940726"},{"key":"9340_CR19","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. (2015). Maximizing Nash product social welfare in allocating indivisible goods. European Journal of Operational Research, 247, 548\u2013559.","journal-title":"European Journal of Operational Research"},{"key":"9340_CR20","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., & Slinko, A. (2014). Properties of multiwinner voting rules. In Proceedings of the 13th international conference on autonomous agents and multiagent systems (pp. 53\u201360). IFAAMAS."},{"issue":"1","key":"9340_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2008.09.034","volume":"410","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., & Hemaspaandra, L. (2009). The complexity of power-index comparison. Theoretical Computer Science, 410(1), 101\u2013107.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9340_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1287\/mnsc.20.3.331","volume":"20","author":"P Gardenfors","year":"1973","unstructured":"Gardenfors, P. (1973). Assignment problem based on ordinal preferences. Management Science, 20(3), 331\u2013340.","journal-title":"Management Science"},{"issue":"3","key":"9340_CR23","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M Garey","year":"1978","unstructured":"Garey, M., & Johnson, D. (1978). \u201cStrong\u201d NP-completeness results: Motivation, examples, and implications. Journal of ACM, 25(3), 499\u2013508.","journal-title":"Journal of ACM"},{"key":"9340_CR24","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W. H. Freeman and Company."},{"issue":"1","key":"9340_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00453-009-9386-0","volume":"58","author":"N Garg","year":"2010","unstructured":"Garg, N., Kavitha, T., Kumar, A., Mehlhorn, K., & Mestre, J. (2010). Assigning papers to referees. Algorithmica, 58(1), 119\u2013136.","journal-title":"Algorithmica"},{"key":"9340_CR26","unstructured":"Golovin, D. (2005). Max-min fair allocation of indivisible goods. Tech. Rep. CMU-CS-05-144, School of Computer Science. Carnegie Mellon University."},{"issue":"1","key":"9340_CR27","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jcss.2006.09.002","volume":"73","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., & Hemaspaandra, L. (2007). Dichotomy for voting systems. Journal of Computer and System Sciences, 73(1), 73\u201383.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"9340_CR28","doi-asserted-by":"publisher","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. Social Choice and Welfare, 19(2), 415\u2013430.","journal-title":"Social Choice and Welfare"},{"issue":"2","key":"9340_CR29","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/opre.19.2.270","volume":"19","author":"D Kohler","year":"1971","unstructured":"Kohler, D., & Chandrasekaran, R. (1971). A class of sequential games. Operations Research, 19(2), 270\u2013277.","journal-title":"Operations Research"},{"key":"9340_CR30","first-page":"493","volume-title":"Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division chap 8","author":"J Lang","year":"2015","unstructured":"Lang, J., & Rothe, J. (2015). Fair division of indivisible goods. In J. Rothe (Ed.), Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division chap 8 (pp. 493\u2013550). Berlin: Springer."},{"key":"9340_CR31","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of matching under preferences. Series on theoretical computer science","author":"D Manlove","year":"2013","unstructured":"Manlove, D. (2013). Algorithmics of matching under preferences. Series on theoretical computer science. Singapore: World Scientific Publishing."},{"key":"9340_CR32","doi-asserted-by":"crossref","DOI":"10.1515\/9781400864140","volume-title":"Cooperative microeconomics: A game-theoretic introduction","author":"H Moulin","year":"1995","unstructured":"Moulin, H. (1995). Cooperative microeconomics: A game-theoretic introduction. Upper Saddle River, NJ: Prentice Hall."},{"key":"9340_CR33","volume-title":"Fair division and collective welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H. (2004). Fair division and collective welfare. Cambridge, MA: MIT Press."},{"key":"9340_CR34","unstructured":"Nguyen, N., Baumeister, D., & Rothe, J. (2015). Strategy-proofness of scoring allocation correspondences for indivisible goods. In Proceedings of the 24th international joint conference on artificial intelligence (pp. 1127\u20131133). AAAI Press\/IJCAI."},{"key":"9340_CR35","doi-asserted-by":"publisher","unstructured":"Pruhs, K., & Woeginger, G. (2012). Divorcing made easy. In: Proceedings of the 6th international conference on fun with algorithms (pp. 305\u2013314). Springer.","DOI":"10.1007\/978-3-642-30347-0_30"},{"key":"9340_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-sided matching: A study in game-theoretic modeling and analysis. Econometric society monographs","author":"A Roth","year":"1990","unstructured":"Roth, A., & Sotomayor, M. (1990). Two-sided matching: A study in game-theoretic modeling and analysis. Econometric society monographs. Cambridge: Cambridge University Press."},{"key":"9340_CR37","unstructured":"Skowron, P., Faliszewski, P., & Slinko, A. (2013). Fully proportional representation as resource allocation: Approximability results. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 353\u2013359). AAAI Press\/IJCAI."},{"issue":"4","key":"9340_CR38","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10058-011-0109-z","volume":"15","author":"W Thomson","year":"2011","unstructured":"Thomson, W. (2011). Consistency and its converse: An introduction. Review of Economic Design, 15(4), 257\u2013291.","journal-title":"Review of Economic Design"},{"key":"9340_CR39","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1057\/jors.1977.106","volume":"28","author":"L Wilson","year":"1977","unstructured":"Wilson, L. (1977). Assignment using choice lists. Operational Research Quarterly, 28, 569\u2013578.","journal-title":"Operational Research Quarterly"},{"key":"9340_CR40","volume-title":"Handbook of computational social choice chap 2","author":"W Zwicker","year":"2016","unstructured":"Zwicker, W. (2016). Introduction to the theory of voting. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, & A. Procaccia (Eds.), Handbook of computational social choice chap 2. Cambridge: Cambridge University Press."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9340-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-016-9340-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9340-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-016-9340-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T10:53:58Z","timestamp":1749034438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-016-9340-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,2]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9340"],"URL":"https:\/\/doi.org\/10.1007\/s10458-016-9340-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,2]]}}}