{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T02:22:41Z","timestamp":1774146161694,"version":"3.50.1"},"publisher-location":"Cham","reference-count":137,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319919072","type":"print"},{"value":"9783319919089","type":"electronic"}],"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-319-91908-9_4","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T09:05:00Z","timestamp":1570179900000},"page":"48-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Computational Social Choice: The First Ten Years and Beyond"],"prefix":"10.1007","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[]},{"given":"Felix","family":"Brandt","sequence":"additional","affiliation":[]},{"given":"Edith","family":"Elkind","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Skowron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,5]]},"reference":[{"key":"4_CR1","first-page":"797","volume":"58","author":"E Anshelevich","year":"2017","unstructured":"Anshelevich, E., Postl, J.: Randomized social choice functions under metric preferences. J. AI Res. 58, 797\u2013827 (2017)","journal-title":"J. AI Res."},{"key":"4_CR2","volume-title":"Social Choice and Individual Values","author":"KJ Arrow","year":"1951","unstructured":"Arrow, K.J.: Social Choice and Individual Values, 1st edn. Cowles Foundation, New Haven (1951)","edition":"1"},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s00182-010-0251-9","volume":"40","author":"S Athanassoglou","year":"2011","unstructured":"Athanassoglou, S., Sethuraman, J.: House allocation with fractional endowments. Int. J. Game Theory 40(3), 481\u2013513 (2011)","journal-title":"Int. J. Game Theory"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H.: Maximal recursive rule: a new social decision scheme. In: Proceedings of 23rd IJCAI, pp. 34\u201340 (2013)","DOI":"10.1525\/aft.2013.40.4.34"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00355-017-1059-3","volume":"49","author":"H Aziz","year":"2017","unstructured":"Aziz, H., Kasajima, Y.: Impossibilities for probabilistic assignment. Soc. Choice Welf. 49(2), 255\u2013275 (2017)","journal-title":"Soc. Choice Welf."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: Proceedings of 57th FOCS, pp. 416\u2013427 (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.mathsocsci.2014.07.002","volume":"72","author":"H Aziz","year":"2014","unstructured":"Aziz, H., Mestre, J.: Parametrized algorithms for random serial dictatorship. Math. Soc. Sci. 72, 1\u20136 (2014)","journal-title":"Math. Soc. Sci."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Aziz, H., Stursberg, P.: A generalization of probabilistic serial to randomized social choice. In: Proceedings of 28th AAAI, pp. 559\u2013565 (2014)","DOI":"10.1609\/aaai.v28i1.8796"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-13129-0_1","volume-title":"Web and Internet Economics","author":"H Aziz","year":"2014","unstructured":"Aziz, H., Ye, C.: Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 1\u201314. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_1"},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.econlet.2013.09.006","volume":"121","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Brill, M.: The computational complexity of random serial dictatorship. Econ. Lett. 121(3), 341\u2013345 (2013)","journal-title":"Econ. Lett."},{"key":"4_CR11","unstructured":"Aziz, H., Brandt, F., Brill, M.: On the tradeoff between economic efficiency and strategyproofness in randomized social choice. In: Proceedings of 12th AAMAS, pp. 455\u2013462 (2013)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-41392-6_16","volume-title":"Algorithmic Game Theory","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Stursberg, P.: On popular random assignments. In: V\u00f6cking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 183\u2013194. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41392-6_16"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Aziz, H., Brandl, F., Brandt, F.: On the incompatibility of efficiency and strategyproofness in randomized social choice. In: Proceedings of 28th AAAI, pp. 545\u2013551 (2014)","DOI":"10.1609\/aaai.v28i1.8825"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jmateco.2015.06.014","volume":"60","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Brandl, F., Brandt, F.: Universal Pareto dominance and welfare for plausible utility functions. J. Math. Econ. 60, 123\u2013133 (2015)","journal-title":"J. Math. Econ."},{"key":"4_CR15","unstructured":"Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., Walsh, T.: Computational aspects of multi-winner approval voting. In: Proceedings of 14th AAMAS, pp. 107\u2013115 (2015)"},{"key":"4_CR16","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Narodytska, N., Walsh, T.: Manipulating the probabilistic serial rule. In: Proceedings of 14th AAMAS, pp. 1451\u20131459 (2015)"},{"key":"4_CR17","unstructured":"Aziz, H., Mackenzie, S., Xia, L., Ye, C.: Ex post efficiency of random assignments. In: Proceedings of 14th AAMAS, pp. 1639\u20131640 (2015)"},{"key":"4_CR18","unstructured":"Aziz, H., Chen, J., Filos-Ratsikas, A., Mackenzie, S., Mattei, N.: Egalitarianism of random assignment mechanisms. In: Proceedings of 15th AAMAS, pp. 1267\u20131268 (2016)"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00355-016-1019-3","volume":"48","author":"H Aziz","year":"2017","unstructured":"Aziz, H., Brill, M., Conitzer, V., Elkind, E., Freeman, R., Walsh, T.: Justified representation in approval-based committee voting. Soc. Choice Welf. 48(2), 461\u2013485 (2017)","journal-title":"Soc. Choice Welf."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Aziz, H., Elkind, E., Faliszewski, P., Lackner, M., Skowron, P.: The Condorcet principle for multiwinner elections: from shortlisting to proportionality. In: Proceedings of 26th IJCAI, pp. 84\u201390 (2017)","DOI":"10.24963\/ijcai.2017\/13"},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00355-010-0476-3","volume":"36","author":"MA Ballester","year":"2011","unstructured":"Ballester, M.A., Haeringer, G.: A characterization of the single-peaked domain. Soc. Choice Welf. 36(2), 305\u2013322 (2011)","journal-title":"Soc. Choice Welf."},{"issue":"1","key":"4_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00355-007-0268-6","volume":"31","author":"S Barber\u00e0","year":"2008","unstructured":"Barber\u00e0, S., Coelho, D.: How to choose a non-controversial list with $$k$$ names. Soc. Choice Welf. 31(1), 79\u201396 (2008)","journal-title":"Soc. Choice Welf."},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"key":"4_CR24","first-page":"475","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. J. AI Res. 47, 475\u2013519 (2013)","journal-title":"J. AI Res."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Birrell, E., Pass, R.: Approximately strategy-proof voting. In: Proceedings of 22nd IJCAI, pp. 67\u201372 (2011)","DOI":"10.21236\/ADA582553"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D.: On the rationale of group decision-making. J. Polit. Econ. 56(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"key":"4_CR27","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jet.2015.04.008","volume":"158","author":"A Bogomolnaia","year":"2015","unstructured":"Bogomolnaia, A.: Random assignment: redefining the serial rule. J. Econ. Theory 158, 308\u2013318 (2015)","journal-title":"J. Econ. Theory"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"2072","DOI":"10.1016\/j.jet.2012.05.013","volume":"147","author":"A Bogomolnaia","year":"2012","unstructured":"Bogomolnaia, A., Heo, E.J.: Probabilistic assignment of objects: characterizing the serial rule. J. Econ. Theory 147, 2072\u20132082 (2012)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"4_CR29","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"},{"key":"4_CR30","unstructured":"Brandl, F., Brandt, F., Geist, C., Hofbauer, J.: Strategic abstention based on preference extensions: positive results and computer-generated impossibilities. In: Proceedings of 24th IJCAI, pp. 18\u201324 (2015)"},{"key":"4_CR31","unstructured":"Brandl, F., Brandt, F., Hofbauer, J.: Incentives for participation and abstention in probabilistic social choice. In: Proceedings of 14th AAMAS, pp. 1411\u20131419 (2015)"},{"key":"4_CR32","unstructured":"Brandl, F., Brandt, F., Geist, C.: Proving the incompatibility of efficiency and strategyproofness via SMT solving. In: Proceedings of 25th IJCAI, pp. 116\u2013122 (2016)"},{"issue":"5","key":"4_CR33","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.3982\/ECTA13337","volume":"84","author":"F Brandl","year":"2016","unstructured":"Brandl, F., Brandt, F., Seedig, H.G.: Consistent probabilistic social choice. Econometrica 84(5), 1839\u20131880 (2016)","journal-title":"Econometrica"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.econlet.2016.01.028","volume":"141","author":"F Brandl","year":"2016","unstructured":"Brandl, F., Brandt, F., Suksompong, W.: The impossibility of extending random dictatorship to weak preferences. Econ. Lett. 141, 44\u201347 (2016)","journal-title":"Econ. Lett."},{"key":"4_CR35","unstructured":"Brandl, F., Brandt, F., Hofbauer, J.: Random assignment with optional participation. In: Proceedings of 16th AAMAS, pp. 326\u2013334 (2017)"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Brandt, F.: Rolling the dice: recent results in probabilistic social choice. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access (2017)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"4_CR37","first-page":"565","volume":"55","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Geist, C.: Finding strategyproof social choice functions via SAT solving. J. AI Res. 55, 565\u2013602 (2016)","journal-title":"J. AI Res."},{"key":"4_CR38","first-page":"213","volume-title":"Multiagent Systems","author":"F Brandt","year":"2013","unstructured":"Brandt, F., Conitzer, V., Endriss, U.: Computational social choice. In: Wei\u00df, G. (ed.) Multiagent Systems, 2nd edn, pp. 213\u2013283. MIT Press, Cambridge (2013)","edition":"2"},{"key":"4_CR39","first-page":"439","volume":"53","author":"F Brandt","year":"2015","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.: Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates. J. AI Res. 53, 439\u2013496 (2015)","journal-title":"J. AI Res."},{"key":"4_CR40","volume-title":"Handbook of Computational Social Choice","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.): Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"key":"4_CR41","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.mathsocsci.2016.09.003","volume":"90","author":"F Brandt","year":"2017","unstructured":"Brandt, F., Geist, C., Peters, D.: Optimal bounds for the no-show paradox via SAT solving. Math. Soc. Sci. 90, 18\u201327 (2017)","journal-title":"Math. Soc. Sci."},{"key":"4_CR42","unstructured":"Brandt, F., Hofbauer, J., Suderland, M.: Majority graphs of assignment problems and properties of popular random assignments. In: Proceedings of 16th AAMAS, pp. 335\u2013343 (2017)"},{"key":"4_CR43","unstructured":"Brandt, F., Saile, C., Stricker, C.: Voting with ties: strong impossibilities via SAT solving. In: Proceedings of 17th AAMAS. IFAAMAS (2018)"},{"issue":"1","key":"4_CR44","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00355-012-0717-8","volume":"41","author":"R Bredereck","year":"2013","unstructured":"Bredereck, R., Chen, J., Woeginger, G.J.: A characterization of the single-crossing domain. Soc. Choice Welf. 41(1), 989\u2013998 (2013)","journal-title":"Soc. Choice Welf."},{"key":"4_CR45","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.mathsocsci.2015.11.002","volume":"79","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Chen, J., Woeginger, G.: Are there any nicely structured preference profiles nearby? Math. Soc. Sci. 79, 61\u201373 (2016)","journal-title":"Math. Soc. Sci."},{"key":"4_CR46","doi-asserted-by":"crossref","unstructured":"Brill, M., Laslier, J.F., Skowron, P.: Multiwinner approval rules as apportionment methods. In: Proceedings of 31st AAAI, pp. 414\u2013420 (2017)","DOI":"10.1609\/aaai.v31i1.10600"},{"issue":"2","key":"4_CR47","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1257\/aer.103.2.585","volume":"103","author":"E Budish","year":"2013","unstructured":"Budish, E., Che, Y.-K., Kojima, F., Milgrom, P.: Designing random allocation mechanisms: theory and applications. Am. Econ. Rev. 103(2), 585\u2013623 (2013)","journal-title":"Am. Econ. Rev."},{"key":"4_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-13129-0_15","volume-title":"Web and Internet Economics","author":"J Byrka","year":"2014","unstructured":"Byrka, J., Sornat, K.: PTAS for minimax approval voting. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 203\u2013217. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_15"},{"key":"4_CR49","first-page":"123","volume":"58","author":"I Caragiannis","year":"2017","unstructured":"Caragiannis, I., Nath, S., Procaccia, A.D., Shah, N.: Subset selection via implicit utilitarian voting. J. AI Res. 58, 123\u2013152 (2017)","journal-title":"J. AI Res."},{"issue":"3","key":"4_CR50","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"JR Chamberlin","year":"1983","unstructured":"Chamberlin, J.R., Courant, P.N.: Representative deliberations and representative decisions: proportional representation and the Borda rule. Am. Polit. Sci. Rev. 77(3), 718\u2013733 (1983)","journal-title":"Am. Polit. Sci. Rev."},{"key":"4_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-69507-3_4","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"Y Chevaleyre","year":"2007","unstructured":"Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: A short introduction to computational social choice. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 51\u201369. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69507-3_4"},{"key":"4_CR52","first-page":"161","volume":"35","author":"V Conitzer","year":"2009","unstructured":"Conitzer, V.: Eliciting single-peaked preferences using comparison queries. J. AI Res. 35, 161\u2013191 (2009)","journal-title":"J. AI Res."},{"issue":"3","key":"4_CR53","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1666420.1666442","volume":"53","author":"V Conitzer","year":"2010","unstructured":"Conitzer, V.: Making decisions based on the preferences of multiple agents. Commun. ACM 53(3), 84\u201394 (2010)","journal-title":"Commun. ACM"},{"key":"4_CR54","unstructured":"Conitzer, V., Sandholm, T.: Universal voting protocol tweaks to make manipulation hard. In: Proceedings of 18th IJCAI, pp. 781\u2013788 (2003)"},{"key":"4_CR55","volume-title":"Handbook of Computational Social Choice","author":"V Conitzer","year":"2016","unstructured":"Conitzer, V., Walsh, T.: Barriers to manipulation in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"key":"4_CR56","unstructured":"Cornaz, D., Galand, L., Spaajaard, O.: Bounded single-peaked width and proportional representation. In: Proceedings of 20th ECAI, pp. 270\u2013275 (2012)"},{"key":"4_CR57","unstructured":"Cornaz, D., Galand, L., Spaajaard, O.: Kemeny elections with bounded single-peaked or single-crossing width. In: Proceedings of 23th IJCAI, pp. 76\u201382 (2013)"},{"key":"4_CR58","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Elkind, E.: Equilibria of plurality voting with abstentions. In: Proceedings of 11th ACM-EC, pp. 347\u2013356 (2010)","DOI":"10.1145\/1807342.1807398"},{"issue":"2","key":"4_CR59","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"J Doignon","year":"1994","unstructured":"Doignon, J., Falmagne, J.: A polynomial time algorithm for unidimensional unfolding representations. J. Algorithms 16(2), 218\u2013233 (1994)","journal-title":"J. Algorithms"},{"key":"4_CR60","unstructured":"Elkind, E., Lackner, M.: Structure in dichotomous preferences. In: Proceedings of 24th IJCAI, pp. 2019\u20132025 (2015)"},{"issue":"3","key":"4_CR61","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00355-014-0853-4","volume":"44","author":"E Elkind","year":"2015","unstructured":"Elkind, E., Lang, J., Saffidine, A.: Condorcet winning sets. Soc. Choice Welf. 44(3), 493\u2013517 (2015)","journal-title":"Soc. Choice Welf."},{"key":"4_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-662-48433-3_9","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2015","unstructured":"Elkind, E., Markakis, E., Obraztsova, S., Skowron, P.: Equilibria of plurality voting: lazy and truth-biased voters. In: Hoefer, M. (ed.) SAGT 2015. LNCS, vol. 9347, pp. 110\u2013122. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48433-3_9"},{"key":"4_CR63","unstructured":"Elkind, E., Markakis, E., Obraztsova, S., Skowron, P.: Complexity of finding equilibria of plurality voting under structured preferences. In: Proceedings of 15th AAMAS, pp. 394\u2013401 (2016)"},{"key":"4_CR64","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Laslier, J., Skowron, P., Slinko, A., Talmon, N.: What do multiwinner voting rules do? An experiment over the two-dimensional Euclidean domain. In: Proceedings of 31st AAAI, pp. 494\u2013501 (2017)","DOI":"10.1609\/aaai.v31i1.10612"},{"issue":"3","key":"4_CR65","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00355-017-1026-z","volume":"48","author":"E Elkind","year":"2017","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. Soc. Choice Welf. 48(3), 599\u2013632 (2017)","journal-title":"Soc. Choice Welf."},{"key":"4_CR66","unstructured":"Elkind, E. Lackner, M., Peters, D.: Structured preferences. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access (2017)"},{"key":"4_CR67","unstructured":"Endriss, U. (ed.): Trends in Computational Social Choice. AI Access (2017)"},{"key":"4_CR68","unstructured":"Endriss, U., Obraztsova, S., Polukarov, M., Rosenschein, J.S.: Strategic voting with incomplete information. In: Proceedings of 25th IJCAI, pp. 236\u2013242 (2016)"},{"key":"4_CR69","first-page":"297","volume":"58","author":"G Erd\u00e9lyi","year":"2017","unstructured":"Erd\u00e9lyi, G., Lackner, M., Pfandler, A.: Computational aspects of nearly single-peaked electorates. J. AI Res. 58, 297\u2013337 (2017)","journal-title":"J. AI Res."},{"issue":"4","key":"4_CR70","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v31i4.2314","volume":"31","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Procaccia, A.D.: AI\u2019s war on manipulation: are we winning? AI Mag. 31(4), 53\u201364 (2010)","journal-title":"AI Mag."},{"key":"4_CR71","volume-title":"Handbook of Computational Social Choice","author":"P Faliszewski","year":"2016","unstructured":"Faliszewski, P., Rothe, J.: Control and bribery in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"key":"4_CR72","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-9688-4_14","volume-title":"Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: A richer understanding of the complexity of election systems. In: Ravi, S., Shukla, S. (eds.) Fundamental Problems in Computing: Essays in Honor of Professor Daniel J. Rosenkrantz. Springer, Dordrecht (2009). https:\/\/doi.org\/10.1007\/978-1-4020-9688-4_14"},{"issue":"11","key":"4_CR73","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1839676.1839696","volume":"53","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Using complexity to protect elections. Commun. ACM 53(11), 74\u201382 (2010)","journal-title":"Commun. ACM"},{"issue":"2","key":"4_CR74","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ic.2010.09.001","volume":"209","author":"P Faliszewski","year":"2011","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: The shield that never was: societies with single-peaked preferences are more open to manipulation and control. Inf. Comput. 209(2), 89\u2013107 (2011)","journal-title":"Inf. Comput."},{"key":"4_CR75","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.artint.2013.11.004","volume":"207","author":"P Faliszewski","year":"2014","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207, 69\u201399 (2014)","journal-title":"Artif. Intell."},{"key":"4_CR76","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Committee scoring rules: axiomatic classification and hierarchy. In: Proceedings of 25th IJCAI, pp. 250\u2013256 (2016)"},{"key":"4_CR77","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner analogues of the plurality rule: axiomatic and algorithmic views. In: Proceedings of 30th AAAI, pp. 482\u2013488 (2016)","DOI":"10.1609\/aaai.v30i1.10031"},{"key":"4_CR78","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Multiwinner voting: a new challenge for social choice theory. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access (2017)"},{"key":"4_CR79","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44803-8_1","volume-title":"Algorithmic Game Theory","author":"A Filos-Ratsikas","year":"2014","unstructured":"Filos-Ratsikas, A., Frederiksen, S.K.S., Zhang, J.: Social welfare in one-sided matchings: random priority and beyond. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 1\u201312. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44803-8_1"},{"issue":"3","key":"4_CR80","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0165-4896(85)90043-5","volume":"10","author":"WV Gehrlein","year":"1985","unstructured":"Gehrlein, W.V.: The Condorcet criterion and committee selection. Math. Soc. Sci. 10(3), 199\u2013209 (1985)","journal-title":"Math. Soc. Sci."},{"key":"4_CR81","unstructured":"Geist, C., Peters, D.: Computer-aided methods for social choice theory. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access (2017)"},{"issue":"4","key":"4_CR82","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"issue":"4","key":"4_CR83","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10992-012-9240-8","volume":"42","author":"U Grandi","year":"2013","unstructured":"Grandi, U., Endriss, U.: First-order logic formalisation of impossibility theorems in preference aggregation. J. Philos. Logic 42(4), 595\u2013618 (2013)","journal-title":"J. Philos. Logic"},{"key":"4_CR84","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-41575-3_14","volume-title":"Algorithmic Decision Theory","author":"U Grandi","year":"2013","unstructured":"Grandi, U., Loreggia, A., Rossi, F., Venable, K.B., Walsh, T.: Restricted manipulation in iterative voting: condorcet efficiency and borda score. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS (LNAI), vol. 8176, pp. 181\u2013192. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41575-3_14"},{"issue":"3","key":"4_CR85","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theoret. Comput. Sci. 349(3), 382\u2013391 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR86","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jmateco.2014.08.003","volume":"54","author":"EJ Heo","year":"2014","unstructured":"Heo, E.J.: Probabilistic assignment with multiple demands: a generalization of the serial rule and and its characterization. J. Math. Econ. 54, 40\u201347 (2014)","journal-title":"J. Math. Econ."},{"key":"4_CR87","unstructured":"Hosseini, H., Larson, K., Cohen, R.: Investigating the characteristics of one-sided matching mechanisms. In: Proceedings of 15th AAMAS, pp. 1443\u20131444 (2016)"},{"issue":"1","key":"4_CR88","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.jet.2005.05.001","volume":"131","author":"A-K Katta","year":"2006","unstructured":"Katta, A.-K., Sethuraman, J.: A solution to the random assignment problem on the full preference domain. J. Econ. Theory 131(1), 231\u2013250 (2006)","journal-title":"J. Econ. Theory"},{"issue":"24","key":"4_CR89","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1016\/j.tcs.2010.03.028","volume":"412","author":"T Kavitha","year":"2011","unstructured":"Kavitha, T., Mestre, J., Nasre, M.: Popular mixed matchings. Theoret. Comput. Sci. 412(24), 2679\u20132690 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"4_CR90","doi-asserted-by":"publisher","first-page":"543","DOI":"10.3982\/TE1558","volume":"10","author":"O Kesten","year":"2015","unstructured":"Kesten, O., Unver, U.: A theory of school choice lotteries. Theor. Econ. 10(2), 543\u2013595 (2015)","journal-title":"Theor. Econ."},{"issue":"1","key":"4_CR91","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.mathsocsci.2008.07.003","volume":"57","author":"F Kojima","year":"2009","unstructured":"Kojima, F.: Random assignment of multiple indivisible objects. Math. Soc. Sci. 57(1), 134\u2013142 (2009)","journal-title":"Math. Soc. Sci."},{"key":"4_CR92","doi-asserted-by":"crossref","unstructured":"LeGrand, R., Markakis, E., Mehta, A.: Some results on approximating the minimax solution in approval voting. In: Proceedings of 6th AAMAS, pp. 1193\u20131195 (2007)","DOI":"10.1145\/1329125.1329365"},{"key":"4_CR93","first-page":"573","volume":"57","author":"O Lev","year":"2016","unstructured":"Lev, O., Rosenschein, J.S.: Convergence of iterative scoring rules. J. AI Res. 57, 573\u2013591 (2016)","journal-title":"J. AI Res."},{"key":"4_CR94","unstructured":"Lu, T., Boutilier, C.: Budgeted social choice: from consensus to personalized decision making. In: Proceedings of 22nd IJCAI, pp. 280\u2013286 (2011)"},{"key":"4_CR95","unstructured":"Magiera, K., Faliszewski, P.: How hard is control in single-crossing elections? In: Proceedings of 21st ECAI, pp. 579\u2013584 (2014)"},{"key":"4_CR96","unstructured":"Meir, R.: Iterative voting. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access (2017)"},{"key":"4_CR97","doi-asserted-by":"crossref","unstructured":"Meir, R., Polukarov, M., Rosenschein, J.S., Jennings, N.R.: Convergence to equilibria in plurality voting. In: Proceedings of 24th AAAI, pp. 823\u2013828 (2010)","DOI":"10.1609\/aaai.v24i1.7624"},{"key":"4_CR98","doi-asserted-by":"crossref","unstructured":"Meir, R., Lev, O., Rosenschein, J.S.: A local-dominance theory of voting equilibria. In: Proceedings of 15th ACM-EC, pp. 313\u2013330 (2014)","DOI":"10.1145\/2600057.2602860"},{"key":"4_CR99","doi-asserted-by":"crossref","unstructured":"Mennle, T., Seuken, S.: An axiomatic approach to characterizing and relaxing strategyproofness of one-sided matching mechanisms. In: Proceedings of 15th ACM-EC, pp. 37\u201338 (2014)","DOI":"10.1145\/2600057.2602885"},{"issue":"4","key":"4_CR100","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Public Choice 35(4), 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"4_CR101","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10817-009-9147-4","volume":"43","author":"T Nipkow","year":"2009","unstructured":"Nipkow, T.: Social choice theory in HOL: Arrow and Gibbard-Satterthwaite. J. Automated Reason. 43, 289\u2013304 (2009)","journal-title":"J. Automated Reason."},{"key":"4_CR102","unstructured":"Obraztsova, S., Elkind, E.: On the complexity of voting manipulation under randomized tie-breaking. In: Proceedings of 22nd IJCAI, pp. 319\u2013324 (2011)"},{"key":"4_CR103","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-41392-6_3","volume-title":"Algorithmic Game Theory","author":"S Obraztsova","year":"2013","unstructured":"Obraztsova, S., Markakis, E., Thompson, D.R.M.: Plurality voting with truth-biased agents. In: V\u00f6cking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 26\u201337. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41392-6_3"},{"key":"4_CR104","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-319-23114-3_27","volume-title":"Algorithmic Decision Theory","author":"Svetlana Obraztsova","year":"2015","unstructured":"Obraztsova, S., Lev, O., Markakis, E., Rabinovich, Z., Rosenschein, J.S.: Beyond plurality: truth-bias in binary scoring rules. In: Proceedings of 14th AAMAS, pp. 1733\u20131734 (2015)"},{"key":"4_CR105","doi-asserted-by":"crossref","unstructured":"Obraztsova, S., Markakis, E., Polukarov, M., Rabinovich, Z., Jennings, N.R.: On the convergence of iterative voting: how restrictive should restricted dynamics be? In: Proceedings of 29th AAAI, pp. 993\u2013999 (2015)","DOI":"10.1609\/aaai.v29i1.9331"},{"key":"4_CR106","unstructured":"Obraztsova, S., Rabinovich, Z., Elkind, E., Polukarov, M., Jennings, N.R.: Trembling hand equilibria of plurality voting. In: Proceedings of 25th IJCAI, pp. 440\u2013446 (2016)"},{"key":"4_CR107","doi-asserted-by":"crossref","unstructured":"Peters, D.: Recognising multidimensional Euclidean preferences. In: Proceedings of 31st AAAI, pp. 642\u2013648 (2017)","DOI":"10.1609\/aaai.v31i1.10616"},{"key":"4_CR108","doi-asserted-by":"crossref","unstructured":"Peters, D.: Single-peakedness and total unimodularity: new polynomial-time algorithms for multi-winner elections. In: Proceedings of 32nd AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11460"},{"key":"4_CR109","doi-asserted-by":"crossref","unstructured":"Peters, D., Elkind, E.: Preferences single-peaked on nice trees. In: Proceedings of 30th AAAI, pp. 594\u2013600 (2016)","DOI":"10.1609\/aaai.v30i1.10049"},{"key":"4_CR110","doi-asserted-by":"crossref","unstructured":"Peters, D., Lackner, M.: Preferences single-peaked on a circle. In: Proceedings of 31st AAAI, pp. 649\u2013655 (2017)","DOI":"10.1609\/aaai.v31i1.10615"},{"key":"4_CR111","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D.: Can approximation circumvent Gibbard-Satterthwaite? In: Proceedings of 24th AAAI, pp. 836\u2013841 (2010)","DOI":"10.1609\/aaai.v24i1.7619"},{"key":"4_CR112","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"AD Procaccia","year":"2008","unstructured":"Procaccia, A.D., Rosenschein, J.S., Zohar, A.: On the complexity of achieving proportional representation. Soc. Choice Welf. 30, 353\u2013362 (2008)","journal-title":"Soc. Choice Welf."},{"key":"4_CR113","doi-asserted-by":"crossref","unstructured":"Rabinovich, Z., Obraztsova, S., Lev, O., Markakis, E., Rosenschein, J.S.: Analysis of equilibria in iterative voting schemes. In: Proceedings of 29th AAAI, pp. 1007\u20131013 (2015)","DOI":"10.1609\/aaai.v29i1.9328"},{"issue":"3","key":"4_CR114","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s00355-003-0209-y","volume":"21","author":"TC Ratliff","year":"2003","unstructured":"Ratliff, T.C.: Some startling inconsistencies when electing committees. Soc. Choice Welf. 21(3), 433\u2013454 (2003)","journal-title":"Soc. Choice Welf."},{"key":"4_CR115","unstructured":"Reijngoud, A., Endriss, U.: Voter response to iterated poll information. In: Proceedings of 11th AAMAS, pp. 635\u2013644 (2012)"},{"key":"4_CR116","unstructured":"Reyhani, R., Wilson, M.C.: Best reply dynamics for scoring rules. In: Proceedings of 20th ECAI, pp. 672\u2013677 (2012)"},{"key":"4_CR117","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47904-9","volume-title":"Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division","year":"2015","unstructured":"Rothe, J. (ed.): Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47904-9"},{"issue":"4","key":"4_CR118","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1287\/moor.2014.0707","volume":"40","author":"D Saban","year":"2015","unstructured":"Saban, D., Sethuraman, J.: The complexity of computing the random priority allocation matrix. Math. Oper. Res. 40(4), 1005\u20131014 (2015)","journal-title":"Math. Oper. Res."},{"key":"4_CR119","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Fern\u00e1ndez, L., Elkind, E., Lackner, M., Fern\u00e1ndez, N., Fisteus, J.A., Basanta Val, P., Skowron, P.: Proportional justified representation. In: Proceedings of 31st AAAI, pp. 670\u2013676 (2017)","DOI":"10.1609\/aaai.v31i1.10611"},{"issue":"2","key":"4_CR120","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"MA Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.A.: Strategy-proofness and Arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theory 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. Theory"},{"key":"4_CR121","unstructured":"Schulman, L.J., Vazirani, V.V.: Allocation of divisible goods under lexicographic preferences. In: Proceedings of 35th FSTTCS, pp. 543\u2013559 (2015)"},{"key":"4_CR122","unstructured":"Service, T.C., Adams, J.A.: Strategyproof approximations of distance rationalizable voting rules. In: Proceedings of 11th AAMAS, pp. 569\u2013576 (2012)"},{"key":"4_CR123","unstructured":"Skowron, P.: What do we elect committees for? A voting committee model for multi-winner rules. In: Proceedings of 24th IJCAI, pp. 1141\u20131148 (2015)"},{"key":"4_CR124","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.artint.2015.01.003","volume":"222","author":"P Skowron","year":"2015","unstructured":"Skowron, P., Faliszewski, P., Slinko, A.: Achieving fully proportional representation: approximability result. Artif. Intell. 222, 67\u2013103 (2015)","journal-title":"Artif. Intell."},{"key":"4_CR125","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2014.12.012","volume":"569","author":"P Skowron","year":"2015","unstructured":"Skowron, P., Yu, L., Faliszewski, P., Elkind, E.: The complexity of fully proportional representation for single-crossing electorates. Theoret. Comput. Sci. 569, 43\u201357 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR126","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.artint.2016.09.003","volume":"241","author":"P Skowron","year":"2016","unstructured":"Skowron, P., Faliszewski, P., Lang, J.: Finding a collective set of items: from proportional multirepresentation to group recommendation. Artif. Intell. 241, 191\u2013216 (2016)","journal-title":"Artif. Intell."},{"key":"4_CR127","unstructured":"Skowron, P., Faliszewski, P., Slinko, A.: Axiomatic characterization of committee scoring rules. In: Proceedings of 6th COMSOC (2016)"},{"issue":"11","key":"4_CR128","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.artint.2009.02.005","volume":"173","author":"P Tang","year":"2009","unstructured":"Tang, P., Lin, F.: Computer-aided proofs of Arrow\u2019s and other impossibility theorems. Artif. Intell. 173(11), 1041\u20131053 (2009)","journal-title":"Artif. Intell."},{"key":"4_CR129","unstructured":"Thomson, D.R.M., Lev, O., Leyton-Brown, K., Rosenschein, J.: Empirical analysis of plurality election equilibria. In: Proceedings of 12th AAMAS, pp. 391\u2013398 (2013)"},{"issue":"3","key":"4_CR130","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0165-4896(89)90060-7","volume":"17","author":"MA Trick","year":"1989","unstructured":"Trick, M.A.: Recognizing single-peaked preferences on a tree. Math. Soc. Sci. 17(3), 329\u2013334 (1989)","journal-title":"Math. Soc. Sci."},{"key":"4_CR131","doi-asserted-by":"publisher","first-page":"253","DOI":"10.3982\/TE1010","volume":"9","author":"MU \u00dcnver","year":"2014","unstructured":"\u00dcnver, M.U., Kesten, O., Kurino, M., Hashimoto, T., Hirata, D.: Two axiomatic approaches to the probabilistic serial mechanism. Theor. Econ. 9, 253\u2013277 (2014)","journal-title":"Theor. Econ."},{"key":"4_CR132","unstructured":"Walsh, T., Xia, L.: Lot-based voting rules. In: Proceedings of 11th AAMAS, pp. 603\u2013610 (2012)"},{"key":"4_CR133","doi-asserted-by":"crossref","unstructured":"Xia, L., Conitzer, V.: Stackelberg voting games: computational aspects and paradoxes. In: Proceedings of 24th AAAI, pp. 921\u2013926 (2010)","DOI":"10.1609\/aaai.v24i1.7626"},{"key":"4_CR134","unstructured":"Yang, Y., Guo, J.: The control complexity of $$r$$ -approval: from the single-peaked case to the general case. In: Proceedings of 13th AAMAS, pp. 621\u2013628 (2014)"},{"issue":"1","key":"4_CR135","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.geb.2008.04.017","volume":"66","author":"O Yilmaz","year":"2009","unstructured":"Yilmaz, O.: Random assignment under weak preferences. Games Econ. Behav. 66(1), 546\u2013558 (2009)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"4_CR136","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/0128067","volume":"28","author":"HP Young","year":"1975","unstructured":"Young, H.P.: Social choice scoring functions. SIAM J. Appl. Math. 28(4), 824\u2013838 (1975)","journal-title":"SIAM J. Appl. Math."},{"key":"4_CR137","unstructured":"Yu, L., Chan, H., Elkind, E.: Multiwinner elections under preferences that are single-peaked on a tree. In: Proceedings of 23rd IJCAI, pp. 425\u2013431 (2013)"}],"container-title":["Lecture Notes in Computer Science","Computing and Software Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91908-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:22:55Z","timestamp":1664583775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91908-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783319919072","9783319919089"],"references-count":137,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91908-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}