{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:30Z","timestamp":1740099210672,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030021481"},{"type":"electronic","value":"9783030021498"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-02149-8_21","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T21:25:34Z","timestamp":1538774734000},"page":"350-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Computational Complexity of Non-dictatorial Aggregation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4912-8959","authenticated-orcid":false,"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6409-4286","authenticated-orcid":false,"given":"John","family":"Livieratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"21_CR1","unstructured":"Arrow, K.J.: Social Choice and Individual Values. Wiley, New York (1951)"},{"key":"21_CR2","unstructured":"Bessiere, C., Carbonnel, C., Hebrard, E., Katsirelos, G., Walsh, T.: Detecting and exploiting subproblem tractability. In: IJCAI, pp. 468\u2013474 (2013)"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1120582.1120584","volume":"53","author":"AA Bulatov","year":"2006","unstructured":"Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM (JACM) 53(1), 66\u2013120 (2006)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/1970398.1970400","volume":"12","author":"AA Bulatov","year":"2011","unstructured":"Bulatov, A.A.: Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Logic (TOCL) 12(4), 24 (2011)","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-319-44953-1_9","volume-title":"Principles and Practice of Constraint Programming","author":"C Carbonnel","year":"2016","unstructured":"Carbonnel, C.: The dichotomy for conservative constraint satisfaction is polynomially decidable. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 130\u2013146. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_9"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Carbonnel, C.: The meta-problem for conservative Mal\u2019tsev constraints. In: Thirtieth AAAI Conference on Artificial Intelligence (AAAI-2016) (2016)","DOI":"10.1609\/aaai.v30i1.10432"},{"issue":"2","key":"21_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":"21_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":"21_CR9","doi-asserted-by":"crossref","unstructured":"Endriss, U.: Judgment aggregation. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.), Handbook of Computational Social Choice, pp. 399\u2013426. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.018"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-57418-9_13","volume-title":"Relational and Algebraic Methods in Computer Science","author":"L Kirousis","year":"2017","unstructured":"Kirousis, L., Kolaitis, P.G., Livieratos, J.: Aggregation of votes with multiple positions on each issue. In: H\u00f6fner, P., Pous, D., Struth, G. (eds.) RAMICS 2017. LNCS, vol. 10226, pp. 209\u2013225. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57418-9_13"},{"key":"21_CR11","unstructured":"Larose, B.: Algebra and the complexity of digraph CSPs: a survey. In: Dagstuhl Follow-Ups, vol. 7. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"List, C., Puppe, C.: Judgment Aggregation: A Survey (2009)","DOI":"10.1093\/acprof:oso\/9780199290420.003.0020"},{"key":"21_CR13","unstructured":"Nehring, K., Puppe, C.: Strategy-proof social choice on single-peaked domains: possibility, impossibility and the space between. University of California at Davis (2002). http:\/\/vwl1.ets.kit.edu\/puppe.php"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0898-1221(81)90008-0","volume":"7","author":"M Sharir","year":"1981","unstructured":"Sharir, M.: A strong-connectivity algorithm and its applications in data flow analysis. Comput. Math. Appl. 7(1), 67\u201372 (1981)","journal-title":"Comput. Math. Appl."},{"key":"21_CR16","unstructured":"Szegedy, M., Xu, Y.: Impossibility theorems and the universal algebraic toolkit. CoRR, abs\/1506.01315 (2015)"},{"key":"21_CR17","unstructured":"Szendrei, \u00c1.: Clones in Universal Algebra, vol. 99. Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montreal (1986)"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"RE Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"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-030-02149-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T12:17:14Z","timestamp":1662207434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02149-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030021481","9783030021498"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02149-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ramics-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.06","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1 full invited talk","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}