{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:40:43Z","timestamp":1725885643737},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319574172"},{"type":"electronic","value":"9783319574189"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57418-9_13","type":"book-chapter","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T07:11:16Z","timestamp":1493017876000},"page":"209-225","source":"Crossref","is-referenced-by-count":2,"title":["Aggregation of Votes with Multiple Positions on Each Issue"],"prefix":"10.1007","author":[{"given":"Lefteris","family":"Kirousis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phokion G.","family":"Kolaitis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Livieratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,25]]},"reference":[{"key":"13_CR1","volume-title":"Social Choice and Individual Values","author":"KJ Arrow","year":"1951","unstructured":"Arrow, K.J.: Social Choice and Individual Values. Wiley, New York (1951)"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Barto, L.: The dichotomy for conservative constraint satisfaction problems revisited. In: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 301\u2013310. IEEE (2011)","DOI":"10.1109\/LICS.2011.25"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Bulatov, A.A.: Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Logic (TOCL) 12(4) (2011). Article No. 24","DOI":"10.1145\/1970398.1970400"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.jcss.2015.07.004","volume":"82","author":"AA Bulatov","year":"2016","unstructured":"Bulatov, A.A.: Conservative constraint satisfaction re-revisited. J. Comput. Syst. Sci. 82(2), 347\u2013356 (2016)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-45193-8_13","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"AA Bulatov","year":"2003","unstructured":"Bulatov, A.A., Jeavons, P.: An algebraic approach to multi-sorted constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 183\u2013198. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-45193-8_13"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-92800-3_4","volume-title":"Complexity of Constraints: An Overview of Current Research Themes","author":"AA Bulatov","year":"2008","unstructured":"Bulatov, A.A., Valeriote, M.A.: Recent results on the algebraic approach to the CSP. In: Creignou, N., Kolaitis, P.G., Vollmer, H. (eds.) Complexity of Constraints: An Overview of Current Research Themes. LNCS, vol. 5250, pp. 68\u201392. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-92800-3_4"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jet.2007.10.004","volume":"145","author":"E Dokow","year":"2010","unstructured":"Dokow, E., Holzman, R.: Aggregation of binary evaluations. J. Econ. Theory 145(2), 495\u2013511 (2010)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.aam.2010.02.005","volume":"45","author":"E Dokow","year":"2010","unstructured":"Dokow, E., Holzman, R.: Aggregation of non-binary evaluations. Adv. Appl. Math. 45(4), 487\u2013504 (2010)","journal-title":"Adv. Appl. Math."},{"key":"13_CR9","unstructured":"Kirousis, L.M., Kolaitis, P.G., Livieratos, J.: Aggregation of votes with multiple positions on each issue. CoRR, abs\/1505.07737v2 (2016)"},{"key":"13_CR10","unstructured":"Nehring, K., Puppe, C.: Strategy-proof social choice on single-peaked domains: possibility, impossibility and the space between (2002). University of California at Davis. \nhttp:\/\/vwl1.ets.kit.edu\/puppe.php"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1305\/ndjfl\/1093635508","volume":"31","author":"FJ Pelletier","year":"1990","unstructured":"Pelletier, F.J., Martin, N.M.: Post\u2019s functional completeness theorem. Notre Dame J. Formal Logic 31(2), 462\u2013475 (1990)","journal-title":"Notre Dame J. Formal Logic"},{"key":"13_CR12","series-title":"Annals of Mathematics Studies","volume-title":"The Two-Valued Iterative Systems of Mathematical Logic","author":"EL Post","year":"1941","unstructured":"Post, E.L.: The Two-Valued Iterative Systems of Mathematical Logic. Annals of Mathematics Studies, vol. 5. Princeton University Press, Princeton (1941)"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM (1978)","DOI":"10.1145\/800133.804350"},{"key":"13_CR14","unstructured":"Szegedy, M., Xu, Y.: Impossibility theorems and the universal algebraic toolkit. CoRR, abs\/1506.01315 (2015)"},{"key":"13_CR15","volume-title":"Clones in Universal Algebra","author":"\u00c1 Szendrei","year":"1986","unstructured":"Szendrei, \u00c1.: Clones in Universal Algebra, vol. 99. Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1986)"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0022-0531(75)90062-9","volume":"10","author":"R Wilson","year":"1975","unstructured":"Wilson, R.: On the theory of aggregation. J. Econ. Theory 10(1), 89\u201399 (1975)","journal-title":"J. Econ. Theory"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57418-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T07:15:07Z","timestamp":1493018107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57418-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319574172","9783319574189"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57418-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}