{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:37:17Z","timestamp":1743125837245,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030314880"},{"type":"electronic","value":"9783030314897"}],"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-030-31489-7_8","type":"book-chapter","created":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T23:04:53Z","timestamp":1570662293000},"page":"112-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Parameterized Complexity of Party Nominations"],"prefix":"10.1007","author":[{"given":"Neeldhara","family":"Misra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,10]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-662-48971-0_28","volume-title":"Algorithms and Computation","author":"EM Arkin","year":"2015","unstructured":"Arkin, E.M., Banik, A., Carmi, P., Citovsky, G., Katz, M.J., Mitchell, J.S.B., Simakov, M.: Choice is hard. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 318\u2013328. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_28"},{"key":"8_CR2","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 , 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.: Handbook of Computational Social Choice (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00355-016-1011-y","volume":"48","author":"J Chen","year":"2017","unstructured":"Chen, J., Pruhs, K., Woeginger, G.J.: The one-dimensional euclidean domain: finitely many obstructions are not enough. Soc. Choice Welf. 48 (2), 409\u2013432 (2017)","journal-title":"Soc. Choice Welf."},{"key":"8_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-662-44803-8_13","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2014","unstructured":"Elkind, E., Faliszewski, P.: Recognizing 1-euclidean preferences: an alternative approach. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 146\u2013157. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44803-8_13"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Skowron, P.: A characterization of the single-peaked single-crossing domain. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 654\u2013660 (2014)","DOI":"10.1609\/aaai.v28i1.8821"},{"key":"8_CR8","unstructured":"Elkind, E., Lackner, M., Peters, D.: Structured preferences. Trends Comput. Soc. Choice, 187\u2013207 (2017)"},{"key":"8_CR9","unstructured":"Escoffier, B., Lang, J., \u00d6zt\u00fcrk, M.: Single-peaked consistency and its complexity. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI), pp. 366\u2013370 (2008)"},{"key":"8_CR10","unstructured":"Faliszewski, P., Gourv\u00e8s, L., Lang, J., Lesca, J., Monnot, J.: How hard is it for a party to nominate an election winner? In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI, pp. 257\u2013263. IJCAI\/AAAI Press (2016)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmateco.2009.05.007","volume":"46","author":"V Knoblauch","year":"2010","unstructured":"Knoblauch, V.: Recognizing one-dimensional euclidean preference profiles. J. Math. Econ. 46 (1), 1\u20135 (2010)","journal-title":"J. Math. Econ."},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2296779","volume":"38","author":"JA Mirrlees","year":"1971","unstructured":"Mirrlees, J.A.: An exploration in the theory of optimum income taxation. Rev. Econ. Stud. 38 (2), 175\u2013208 (1971)","journal-title":"Rev. Econ. Stud."},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-67504-6_9","volume-title":"Algorithmic Decision Theory","author":"N Misra","year":"2017","unstructured":"Misra, N., Sonar, C., Vaidyanathan, P.R.: On the complexity of chamberlin-courant on\u00a0almost structured profiles. In: Rothe, J. (ed.) ADT 2017. LNCS (LNAI), vol. 10576, pp. 124\u2013138. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67504-6_9"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0047-2727(77)90005-6","volume":"8","author":"KWS Roberts","year":"1977","unstructured":"Roberts, K.W.S.: Voting over income tax schedules. J. Public Econ. 8 (3), 329\u2013340 (1977)","journal-title":"J. Public Econ."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31489-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T08:59:17Z","timestamp":1664614757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31489-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030314880","9783030314897"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31489-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham, NC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.fuqua.duke.edu\/adt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}