{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:38:42Z","timestamp":1726083522111},"publisher-location":"Cham","reference-count":121,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030061630"},{"type":"electronic","value":"9783030061647"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-06164-7_18","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T02:03:20Z","timestamp":1588903400000},"page":"587-627","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Collective Decision Making"],"prefix":"10.1007","author":[{"given":"Sylvain","family":"Bouveret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Lema\u00eetre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ailon N, Charikar M, Newman A (2005) Aggregating inconsistent information: ranking and clustering. In: Proceedings of ACM Symposium on Theory of Computing (STOC\u201905)","key":"18_CR1","DOI":"10.1145\/1060590.1060692"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N Alon","year":"2006","unstructured":"Alon N (2006) Ranking tournaments. SIAM J Discret Math 20(1):137\u2013142","journal-title":"SIAM J Discret Math"},{"doi-asserted-by":"crossref","unstructured":"Amanatidis G, Markakis E, Nikzad A, Saberi A (2015) Approximation algorithms for computing maximin share allocations. In: ICALP (1). Lecture notes in computer science, vol 9134. Springer, Berlin, pp 39\u201351","key":"18_CR3","DOI":"10.1007\/978-3-662-47672-7_4"},{"unstructured":"Arrow K (1951) Social choice and individual values, 2nd edn (1963). Wiley, New Jersey","key":"18_CR4"},{"doi-asserted-by":"crossref","unstructured":"Asadpour A, Saberi A (2007) An approximation algorithm for max-min fair allocation of indivisible goods. In: Proceedings of ACM Symposium on Theory of Computing (STOC\u201907), pp 114\u2013121","key":"18_CR5","DOI":"10.1145\/1250790.1250808"},{"doi-asserted-by":"crossref","unstructured":"Aziz H (2015) Competitive equilibrium with equal incomes for allocation of indivisible objects. Oper Res Lett 43(6):622\u2013624","key":"18_CR6","DOI":"10.1016\/j.orl.2015.10.001"},{"doi-asserted-by":"crossref","unstructured":"Aziz H, Mackenzie S (2016) A discrete and bounded envy-free cake cutting protocol for any number of agents. In: 2016 IEEE 57th annual symposium on foundations of computer science (FOCS). IEEE, pp 416\u2013427","key":"18_CR7","DOI":"10.1109\/FOCS.2016.52"},{"doi-asserted-by":"crossref","unstructured":"Aziz H, Gaspers S, Mackenzie S, Walsh T (2015) Fair assignment of indivisible objects under ordinal preferences. Artif Intell 227:71\u201392","key":"18_CR8","DOI":"10.1016\/j.artint.2015.06.002"},{"doi-asserted-by":"crossref","unstructured":"Bachrach Y, Betzler N, Faliszewski P (2010) Probabilistic possible-winner determination. In: Proceedings of AAAI conference on artificial intelligence (AAAI\u201910)","key":"18_CR9","DOI":"10.1609\/aaai.v24i1.7609"},{"unstructured":"Balinski ML, Young HP (2001) Fair representation : meeting the ideal of one man one vote, 2nd edn. Brookings Institution Press, USA","key":"18_CR10"},{"doi-asserted-by":"crossref","unstructured":"Bansal N, Sviridenko M (2006) The Santa Claus problem. In: Proceedings of ACM Symposium on Theory of Computing (STOC\u201906), pp 31\u201340","key":"18_CR11","DOI":"10.1145\/1132516.1132522"},{"doi-asserted-by":"crossref","unstructured":"Bartholdi J, Orlin J (1991) Single transferable vote resists strategic voting. Soc Choice Welf 8(4):341\u2013354","key":"18_CR12","DOI":"10.1007\/BF00183045"},{"doi-asserted-by":"crossref","unstructured":"Bartholdi J, Tovey C, Trick M (1989a) The computational difficulty of manipulating an election. Soc Choice Welf 6(3):227\u2013241","key":"18_CR13","DOI":"10.1007\/BF00295861"},{"doi-asserted-by":"crossref","unstructured":"Bartholdi J, Tovey C, Trick M (1989b) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welf 6(3):157\u2013165","key":"18_CR14","DOI":"10.1007\/BF00303169"},{"issue":"8\/9","key":"18_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J Bartholdi","year":"1992","unstructured":"Bartholdi J, Tovey C, Trick M (1992) How hard is it to control an election? Math Comput Model 16(8\/9):27\u201340","journal-title":"Math Comput Model"},{"unstructured":"Betzler N, Niedermeier R, Woeginger GJ (2011) Unweighted coalitional manipulation under the Borda rule is NP-hard. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201911)","key":"18_CR16"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I Bez\u00e1kov\u00e1","year":"2005","unstructured":"Bez\u00e1kov\u00e1 I, Dani V (2005) Allocating indivisible goods. SIGecom Exch 5(3):11\u201318","journal-title":"SIGecom Exch"},{"unstructured":"Boutilier C, Hoos HH (2001) Bidding languages for combinatorial auctions. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201901), pp 1211\u20131217","key":"18_CR18"},{"doi-asserted-by":"crossref","unstructured":"Boutilier C, Rosenschein J (2016) Incomplete information and communication in voting. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR19","DOI":"10.1017\/CBO9781107446984.011"},{"unstructured":"Bouveret S, Endriss U, Lang J (2009) Conditional importance networks: a graphical language for representing ordinal, monotonic preferences over sets of goods. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201909), pp 67\u201372","key":"18_CR20"},{"unstructured":"Bouveret S, Endriss U, Lang J (2010) Fair division under ordinal preferences: computing envy-free allocations of indivisible goods. In: Proceedings of European Conference on Artificial Intelligence (ECAI\u201910)","key":"18_CR21"},{"doi-asserted-by":"crossref","unstructured":"Bouveret S, Fargier H, Lang J, Lema\u00eetre M (2005) Allocation of indivisible goods: a general model and some complexity results. In: Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201905)","key":"18_CR22","DOI":"10.1145\/1082473.1082747"},{"doi-asserted-by":"crossref","unstructured":"Bouveret S, Lang J (2008) Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. J Artif Intell Res 32:525\u2013564","key":"18_CR23","DOI":"10.1613\/jair.2467"},{"doi-asserted-by":"crossref","unstructured":"Bouveret S, Lema\u00eetre M (2009) Computing leximin-optimal solutions in constraint networks. Artif Intell 173(2):343\u2013364","key":"18_CR24","DOI":"10.1016\/j.artint.2008.10.010"},{"doi-asserted-by":"crossref","unstructured":"Bouveret S, Lema\u00eetre M (2016) Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton Agents Multi-Agent Syst 30(2):259\u2013290","key":"18_CR25","DOI":"10.1007\/s10458-015-9287-3"},{"unstructured":"Brams SJ, Fishburn P (2004) Voting procedures. In: Arrow K, Sen A, Suzumura K (eds) Handbook of Social Choice and Welfare, Elsevier, Amsterdam","key":"18_CR26"},{"unstructured":"Brams SJ, Taylor AD (1995) An envy-free cake division protocol. Am Math Mon 102(1):9\u201318","key":"18_CR27"},{"doi-asserted-by":"crossref","unstructured":"Brams SJ, Taylor AD (1996) Fair division \u2013 from cake-cutting to dispute resolution. Cambridge University Press, Cambridge","key":"18_CR28","DOI":"10.1017\/CBO9780511598975"},{"unstructured":"Brams SJ, Taylor AD (2000) The win-win solution. Guaranteeing fair shares to everybody. W. W. Norton, New York","key":"18_CR29"},{"unstructured":"Brams SJ, Jones MA, Klamler C (2006) Better ways to cut a cake. Not Am Math Soc 53(11):1314\u20131321","key":"18_CR30"},{"doi-asserted-by":"crossref","unstructured":"Brams SJ, Kilgour DM, Zwicker W (1998) The paradox of multiple elections. Soc Choice Welf 15:211\u2013236","key":"18_CR31","DOI":"10.1007\/s003550050101"},{"doi-asserted-by":"crossref","unstructured":"Brams SJ, Kilgour M, Sanver R (2007) A minimax procedure for electing committees. Public Choice 3\u20134(132):401\u2013420","key":"18_CR32","DOI":"10.1007\/s11127-007-9165-x"},{"doi-asserted-by":"crossref","unstructured":"Brandt F, Brill M, Harrenstein P (2016a) Tournament solutions. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR33","DOI":"10.1017\/CBO9781107446984.002"},{"doi-asserted-by":"crossref","unstructured":"Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (2016b) Handbook of Computational Social Choice. Cambridge University Press, Cambridge","key":"18_CR34","DOI":"10.1017\/CBO9781107446984.002"},{"doi-asserted-by":"crossref","unstructured":"Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (2016c) Introduction to computational social choice. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR35","DOI":"10.1017\/CBO9781107446984.002"},{"doi-asserted-by":"crossref","unstructured":"Br\u00e2nzei S, Caragiannis I, Kurokawa D, Procaccia AD (2016) An algorithmic framework for strategic fair division. In: AAAI, pp 418\u2013424","key":"18_CR36","DOI":"10.1609\/aaai.v30i1.10042"},{"doi-asserted-by":"crossref","unstructured":"Br\u00e2nzei S, Hosseini H, Miltersen PB (2015) Characterization and computation of equilibria for indivisible goods. In: International symposium on algorithmic game theory. Springer, Berlin, pp 244\u2013255","key":"18_CR37","DOI":"10.1007\/978-3-662-48433-3_19"},{"doi-asserted-by":"crossref","unstructured":"Budish E (2011) The combinatorial assignment problem : approximate competitive equilibrium from equal incomes. J Polit Econ 119(6)","key":"18_CR38","DOI":"10.1086\/664613"},{"doi-asserted-by":"crossref","unstructured":"Caragiannis I, Covey JA, Feldman M, Homan CM, Kaklamanis C, Karanikolas N, Procaccia AD, Rosenschein JS (2009) On the approximability of Dodgson and Young elections. In: ACM-SIAM symposium on discrete algorithms (SODA\u201909), pp 1058\u20131067","key":"18_CR39","DOI":"10.1137\/1.9781611973068.115"},{"doi-asserted-by":"crossref","unstructured":"Caragiannis I, Hemaspaandra E, Hemaspaandra LA (2016a) Dodgson\u2019s rule and Young\u2019s rule. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR40","DOI":"10.1017\/CBO9781107446984.006"},{"doi-asserted-by":"crossref","unstructured":"Caragiannis I, Kurokawa D, Moulin H, Procaccia AD, Shah N, Wang J (2016b) The unreasonable fairness of maximum Nash welfare. In: Proceedings of the 2016 ACM Conference on Economics and Computation. ACM, pp 305\u2013322","key":"18_CR41","DOI":"10.1145\/2940716.2940726"},{"unstructured":"Chevaleyre Y, Endriss U, Estivie S, Maudet N (2004) Multiagent resource allocation with $$k$$-additive utility functions. In: Proceedings of DIMACS-LAMSADE Workshop on Computer Science and Decision Theory, vol\u00a03, pp 83\u2013100","key":"18_CR42"},{"unstructured":"Chevaleyre Y, Endriss U, Maudet N (2007) Allocating goods on a graph to eliminate envy. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI\u201907)","key":"18_CR43"},{"doi-asserted-by":"crossref","unstructured":"Chevaleyre Y, Endriss U, Maudet N (2017) Distributed fair allocation of indivisible goods. Artif Intell 242:1\u201322","key":"18_CR44","DOI":"10.1016\/j.artint.2016.09.005"},{"doi-asserted-by":"crossref","unstructured":"Chevaleyre Y, Lang J, Maudet N, Monnot J (2010) Possible winners when new candidates are added: the case of scoring rules. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI\u201910)","key":"18_CR45","DOI":"10.1609\/aaai.v24i1.7640"},{"unstructured":"Chevaleyre Y, Lang J, Maudet N, Ravilly-Abadie G (2009) Compiling the votes of a subelectorate. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201909), pp 97\u2013102","key":"18_CR46"},{"unstructured":"Condorcet N (1735) Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. Imprimerie Royale, Paris","key":"18_CR47"},{"unstructured":"Conitzer V (2006) Computing Slater rankings using similarities among candidates. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI\u201906)","key":"18_CR48"},{"unstructured":"Conitzer V, Rognlie M, Xia L (2009) Preference functions that score rankings and maximum likelihood estimation. In: Proceedings of IJCAI-09, pp 109\u2013115","key":"18_CR49"},{"unstructured":"Conitzer V, Sandholm T (2002a) Complexity of manipulating elections with few candidates. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI\u201998)","key":"18_CR50"},{"unstructured":"Conitzer V, Sandholm T (2002b) Vote elicitation: complexity and strategy-proofness. In: Proceedings of AAAI conference on artificial intelligence (AAAI\u201998), pp 392\u2013397","key":"18_CR51"},{"doi-asserted-by":"crossref","unstructured":"Conitzer V, Sandholm T (2005) Communication complexity of common votiong rules. In: Proceedings of ACM conference on electronic commerce (EC\u201905)","key":"18_CR52","DOI":"10.1145\/1064009.1064018"},{"doi-asserted-by":"crossref","unstructured":"Conitzer V, Walsh T (2016) Barriers to manipulation. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR53","DOI":"10.1017\/CBO9781107446984.007"},{"doi-asserted-by":"crossref","unstructured":"Cramton P (2006) Simultaneous ascending auctions. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions. MIT Press, Cambridge","key":"18_CR54","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"doi-asserted-by":"crossref","unstructured":"Cramton P, Shoham Y, Steinberg R (eds) (2006) Combinatorial auctions. MIT Press, Cambridge","key":"18_CR55","DOI":"10.7551\/mitpress\/9780262033428.001.0001"},{"doi-asserted-by":"crossref","unstructured":"Darmann A, Klamler C, Pferschy U (2009) Maximizing the minimum voter satisfaction on spanning trees. Math Soc Sci 58(2):238\u2013250","key":"18_CR56","DOI":"10.1016\/j.mathsocsci.2009.05.002"},{"doi-asserted-by":"crossref","unstructured":"Davies J, Katsirelos G, Narodystka N, Walsh T (2011) Complexity of and algorithms for Borda manipulation. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI\u201911)","key":"18_CR57","DOI":"10.1609\/aaai.v25i1.7873"},{"doi-asserted-by":"crossref","unstructured":"de\u00a0Keijzer B, Bouveret S, Klos T, Zhang Y (2009) On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences. In: Proceedings of International Conference on Algorithmic Decision Theory (ADT\u201909)","key":"18_CR58","DOI":"10.1007\/978-3-642-04428-1_9"},{"doi-asserted-by":"crossref","unstructured":"Dickerson JP, Goldman JR, Karp J, Procaccia AD, Sandholm T (2014) The computational rise and fall of fairness. In: AAAI, vol 14, pp 1405\u20131411","key":"18_CR59","DOI":"10.1609\/aaai.v28i1.8884"},{"doi-asserted-by":"crossref","unstructured":"Dunne PE (2005) Multiagent resource allocation in the presence of externalities. In: Proceedings of International Central and Eastern European Conference on Multi-Agent Systems (CEEMAS\u20192005), pp 408\u2013417","key":"18_CR60","DOI":"10.1007\/11559221_41"},{"issue":"1\u20132","key":"18_CR61","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.artint.2005.01.006","volume":"164","author":"PE Dunne","year":"2005","unstructured":"Dunne PE, Wooldridge M, Laurence M (2005) The complexity of contract negotiation. Artif Intell 164(1\u20132):23\u201346","journal-title":"Artif Intell"},{"doi-asserted-by":"crossref","unstructured":"Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. In: International World Wide Web conference (WWW10), pp 613\u2013622","key":"18_CR62","DOI":"10.1145\/371920.372165"},{"doi-asserted-by":"crossref","unstructured":"Elkind E, Faliszewski P, Slinko AM (2010) Cloning in elections. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI\u201910)","key":"18_CR63","DOI":"10.1609\/aaai.v24i1.7606"},{"doi-asserted-by":"crossref","unstructured":"Elkind E, Slinko A (2016) Rationalizations of voting rules. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR64","DOI":"10.1017\/CBO9781107446984.009"},{"unstructured":"Endriss U (ed) (2017) Trends in computational social choice. AI Access, to appear","key":"18_CR65"},{"doi-asserted-by":"crossref","unstructured":"Endriss U, Maudet N (2005) On the communication complexity of multilateral trading: extend report. J Auton Agents Multi-Agent Syst 11(1):91\u2013107","key":"18_CR66","DOI":"10.1007\/s10458-005-1080-2"},{"unstructured":"Ephrati E, Rosenschein JS (1993) Multi-agent planning as a dynamic search for social consensus. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201993), pp 423\u2013431","key":"18_CR67"},{"issue":"2","key":"18_CR68","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/s10458-011-9188-z","volume":"26","author":"B Escoffier","year":"2013","unstructured":"Escoffier B, Gourv\u00e8s L, Monnot J (2013) Fair solutions for some multiagent optimization problems. Auton Agents Multi-Agent Syst 26(2):184\u2013201","journal-title":"Auton Agents Multi-Agent Syst"},{"doi-asserted-by":"crossref","unstructured":"Faliszewski P, Rothe J (2016) Control and bribery in voting. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR69","DOI":"10.1017\/CBO9781107446984.008"},{"doi-asserted-by":"crossref","unstructured":"Fischer F, Hudry O, Niedermeier R (2016) Weighted tournament solutions. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR70","DOI":"10.1017\/CBO9781107446984.005"},{"unstructured":"Fujishima Y, Leyton-Brown K, Shoam Y (1999) Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201999)","key":"18_CR71"},{"unstructured":"Galand L, Perny P (2006) Search for compromise solutions in multiobjective state space graphs. In: Proceedings of European Conference on Artificial Intelligence (ECAI\u201906), pp 93\u201397","key":"18_CR72"},{"key":"18_CR73","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard A (1973) Manipulation of voting schemes: a general result. Econometrica 41:587\u2013601","journal-title":"Econometrica"},{"unstructured":"Golden B, Perny P (2010) Infinite order Lorenz dominance for fair multiagent optimization. In: Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201910), pp 383\u2013390","key":"18_CR74"},{"doi-asserted-by":"crossref","unstructured":"Harsanyi JC (1955) Cardinal welfare, individualistic ethics, and interpersonal comparisons of utility. J Polit Econ 63:309\u2013321","key":"18_CR75","DOI":"10.1086\/257678"},{"doi-asserted-by":"crossref","unstructured":"Hemaspaandra E, Hemaspaandra LA, Rothe J (1997) Exact analysis of Dodgson elections: Lewis Carroll\u2019s 1876 system is complete for parallel access to NP. J ACM 44(6):806\u2013825","key":"18_CR76","DOI":"10.1145\/268999.269002"},{"unstructured":"Hudry O (2004a) Computation of median orders: complexity results. In: Proceedings of DIMACS-LAMSADE Workshop on Computer Science and Decision Theory, vol\u00a03, pp 179\u2013214","key":"18_CR77"},{"doi-asserted-by":"crossref","unstructured":"Hudry O (2004b) A note on banks winners in tournaments are difficult to recognize by Woeginger GJ. Soc Choice Welf 23(1):113\u2013114","key":"18_CR78","DOI":"10.1007\/s00355-003-0241-y"},{"doi-asserted-by":"crossref","unstructured":"Klamler C, Pferschy U (2007) The travelling group problem. Soc Choice Welf 3(29):429\u2013452","key":"18_CR79","DOI":"10.1007\/s00355-006-0214-z"},{"unstructured":"Konczak K, Lang J (2005) Voting procedures with incomplete preferences. In: Proceedings of IJCAI\u201905 Multidisciplinary Workshop on Advances in Preference Handling","key":"18_CR80"},{"doi-asserted-by":"crossref","unstructured":"Kurokawa D, Procaccia AD, Wang J (2015) When can the maximin share guarantee be guaranteed? Technical report, Carnegie Mellon University","key":"18_CR81","DOI":"10.1609\/aaai.v30i1.10041"},{"doi-asserted-by":"crossref","unstructured":"Lacy D, Niou E (2000) A problem with referenda. J Theor Polit 12(1):5\u201331","key":"18_CR82","DOI":"10.1177\/0951692800012001001"},{"doi-asserted-by":"crossref","unstructured":"Lang J, Xia L (2009) Sequential composition of voting rules in multi-issue domains. Math Soc Sci 57(3):304\u2013324","key":"18_CR83","DOI":"10.1016\/j.mathsocsci.2008.12.010"},{"doi-asserted-by":"crossref","unstructured":"Lang J, Xia L (2016) Voting in combinatorial domains. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR84","DOI":"10.1017\/CBO9781107446984.010"},{"doi-asserted-by":"crossref","unstructured":"Laslier JF, Sanver MR (eds) (2010) Handbook on approval voting. Studies in Choice and Welfare. Springer, Berlin","key":"18_CR85","DOI":"10.1007\/978-3-642-02839-7"},{"doi-asserted-by":"crossref","unstructured":"Lehmann D, Mller R, Sandholm TW (2006) The winner determination problem. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions. MIT Press, Cambridge","key":"18_CR86","DOI":"10.7551\/mitpress\/9780262033428.003.0013"},{"unstructured":"Lema\u00eetre M, Verfaillie G, Bataille N (1999) Exploiting a common property resource under a fairness constraint: a case study. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201999), pp 206\u2013211","key":"18_CR87"},{"unstructured":"Lesca J, Perny P (2010) LP solvable models for multiagent fair allocation problems. In: Proceedings of European Conference on Artificial Intelligence (ECAI\u201910), pp 387\u2013392","key":"18_CR88"},{"doi-asserted-by":"crossref","unstructured":"Lipton R, Markakis E, Mossel E, Saberi A (2004) On approximately fair allocations of divisible goods. In: Proceedings of ACM Conference on Electronic Commerce (EC\u201904)","key":"18_CR89","DOI":"10.1145\/988772.988792"},{"doi-asserted-by":"crossref","unstructured":"Luss H (1999) On equitable resource allocation problems: a lexicographic minimax approach. Oper Res 47(3):361\u2013378","key":"18_CR90","DOI":"10.1287\/opre.47.3.361"},{"doi-asserted-by":"crossref","unstructured":"May K (1952) A set of independent necessary and sufficient conditions for simple majority decisions. Econometrica 20:680\u2013684","key":"18_CR91","DOI":"10.2307\/1907651"},{"doi-asserted-by":"crossref","unstructured":"McCabe-Dansted J, Pritchard G, Slinko A (2008) Approximability of Dodgson\u2019s rule. Soc Choice Welf 31(2):311\u2013330","key":"18_CR92","DOI":"10.1007\/s00355-007-0282-8"},{"doi-asserted-by":"crossref","unstructured":"Moulin H (1988) Axioms of cooperative decision making. Cambridge University Press, Cambridge","key":"18_CR93","DOI":"10.1017\/CCOL0521360552"},{"doi-asserted-by":"crossref","unstructured":"Moulin H (2003) Fair division and collective welfare. MIT Press, Cambridge","key":"18_CR94","DOI":"10.7551\/mitpress\/2954.001.0001"},{"doi-asserted-by":"crossref","unstructured":"Nguyen NT, Nguyen TT, Roos M, Rothe J (2014) Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Auton Agents Multi-Agent Syst 28(2):256\u2013289","key":"18_CR95","DOI":"10.1007\/s10458-013-9224-2"},{"doi-asserted-by":"crossref","unstructured":"Nisan N (2006) Bidding languages for combinatorial auctions. In: Cramton P, Shoham Y, Steinberg R (eds) Combinatorial auctions. MIT Press, Cambridge","key":"18_CR96","DOI":"10.7551\/mitpress\/9780262033428.003.0010"},{"doi-asserted-by":"crossref","unstructured":"Ogryczak W (1997) On the lexicographic minimax approach to location problems. Eur J Oper Res 100:566\u2013585","key":"18_CR97","DOI":"10.1016\/S0377-2217(96)00154-3"},{"unstructured":"Procaccia AD (2009) Thou shalt covet thy neighbors cake. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201909), pp 239\u2013244","key":"18_CR98"},{"doi-asserted-by":"crossref","unstructured":"Procaccia AD (2016) Cake cutting algorithms. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR99","DOI":"10.1017\/CBO9781107446984.014"},{"doi-asserted-by":"crossref","unstructured":"Procaccia AD, Rosenschein JS (2007) Junta distributions and the average-case complexity of manipulating elections. J Artif Intell Res 28:157\u2013181","key":"18_CR100","DOI":"10.1613\/jair.2148"},{"doi-asserted-by":"crossref","unstructured":"Procaccia AD, Wang J (2014) Fair enough: guaranteeing approximate maximin shares. In: Proceedings of 14th ACM conference on economics and computation (EC\u201914)","key":"18_CR101","DOI":"10.1145\/2600057.2602835"},{"doi-asserted-by":"crossref","unstructured":"Rassenti S, Smith VL, Bulfin RL (1982) A combinatorial auction mechanisms for airport time slot allocation. Bell J Econ 402\u2013417","key":"18_CR102","DOI":"10.2307\/3003463"},{"doi-asserted-by":"crossref","unstructured":"Rawls J (1971) A theory of justice. Harvard University Press, Cambridge","key":"18_CR103","DOI":"10.4159\/9780674042605"},{"doi-asserted-by":"crossref","unstructured":"Robertson J, Webb W (1998) Cake-cutting algorithms: be fair if you can. AK Peters Ltd, USA","key":"18_CR104","DOI":"10.1201\/9781439863855"},{"doi-asserted-by":"crossref","unstructured":"Rothe J, Rothe I (2015) Economics and computation: an introduction to algorithmic game theory, computational social choice, and fair division. Springer, Berlin","key":"18_CR105","DOI":"10.1007\/978-3-662-47904-9"},{"doi-asserted-by":"crossref","unstructured":"Rothe J, Spakowski H, Vogel J (2003) Exact complexity of the winner for Young elections. Theory Comput Syst 36(4):375\u2013386","key":"18_CR106","DOI":"10.1007\/s00224-002-1093-z"},{"doi-asserted-by":"crossref","unstructured":"Rothkopf MH, Peke\u010d A, Harstad RM (1998) Computationally manageable combinatorial auctions. Manag Sci 44(8):1131\u20131147","key":"18_CR107","DOI":"10.1287\/mnsc.44.8.1131"},{"unstructured":"Sandholm TW (1998) Contract types for satisficing task allocation: I. Theoretical results. In: Proceedings of AAAI Spring symposium: satisficing models, pp 68\u201375","key":"18_CR108"},{"unstructured":"Sandholm TW (1999) An algorithm for optimal winner determination in combinatorial auctions. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI\u201999), pp 452\u2013547","key":"18_CR109"},{"doi-asserted-by":"crossref","unstructured":"Sandholm TW (2002) Algorithm for optimal winner determination in combinatorial auctions. Artif Intell 134:1\u201354","key":"18_CR110","DOI":"10.1016\/S0004-3702(01)00159-X"},{"doi-asserted-by":"crossref","unstructured":"Satterthwaite MA (1975) Strategy-proofness and arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J Econ Theory 10(2):187\u2013217","key":"18_CR111","DOI":"10.1016\/0022-0531(75)90050-2"},{"unstructured":"Sen AK (1970) Collective choice and social welfare. North-Holland, Amsterdam","key":"18_CR112"},{"doi-asserted-by":"crossref","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Financ 16:8\u201337","key":"18_CR113","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"unstructured":"Walsh T (2008) Complexity of terminating preference elicitation. In: Proceedings of International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201908), pp 967\u2013974","key":"18_CR114"},{"unstructured":"Walsh T (2010) Online cake cutting. In: Third international workshop on computational social choice","key":"18_CR115"},{"doi-asserted-by":"crossref","unstructured":"Woeginger GJ (2003) Banks winners in tournaments are difficult to recognize. Soc Choice Welf 20(3):523\u2013528","key":"18_CR116","DOI":"10.1007\/s003550200197"},{"unstructured":"Xia L, Conitzer V (2008) Determining possible and necessary winners under common voting rules given partial orders. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI\u201908), pp 196\u2013201","key":"18_CR117"},{"doi-asserted-by":"crossref","unstructured":"Xia L, Conitzer V (2010) Compilation complexity of common voting rules. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI\u201910)","key":"18_CR118","DOI":"10.1609\/aaai.v24i1.7627"},{"doi-asserted-by":"crossref","unstructured":"Yager RR (1988) On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans Syst Man Cybern 18:183\u2013190","key":"18_CR119","DOI":"10.1109\/21.87068"},{"unstructured":"Young HP (1994) Equity in theory and practice. Princeton University Press, Princeton","key":"18_CR120"},{"unstructured":"Zwicker WS (2016) Introduction to the theory of voting. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of Computational Social Choice, Cambridge University Press, Cambridge","key":"18_CR121"}],"container-title":["A Guided Tour of Artificial Intelligence Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-06164-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T20:40:52Z","timestamp":1696106452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-06164-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030061630","9783030061647"],"references-count":121,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-06164-7_18","relation":{},"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}