{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:02:44Z","timestamp":1762297364307},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_17","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"165-176","source":"Crossref","is-referenced-by-count":7,"title":["Copeland Voting Fully Resists Constructive Control"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Faliszewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edith","family":"Hemaspaandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lane A.","family":"Hemaspaandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare\u00a06(2), 157\u2013165 (1989)","journal-title":"Social Choice and Welfare"},{"issue":"8\/9","key":"17_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"J. Bartholdi III","year":"1992","unstructured":"Bartholdi III, J., Tovey, C., Trick, M.: How hard is it to control an election? Mathematical and Computer Modeling\u00a016(8\/9), 27\u201340 (1992)","journal-title":"Mathematical and Computer Modeling"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? Journal of the ACM\u00a054(3) (Article\u00a014)(2007)","DOI":"10.1145\/1236457.1236461"},{"key":"17_CR4","unstructured":"Copeland, A.: A \u201creasonable\u201d social welfare function. Mimeographed notes from a Seminar on Applications of Mathematics to the Social Sciences, University of Michigan (1951)"},{"key":"17_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"17_CR6","unstructured":"Erd\u00e9lyi, G., Hemaspaandra, L., Rothe, J., Spakowski, H.: Frequency of correctness versus average polynomial time and generalized juntas (manuscript, December 2007)"},{"key":"17_CR7","first-page":"641","volume-title":"Proc. AAAI 2006","author":"P. Faliszewski","year":"2006","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: The complexity of bribery in elections. In: Proc. AAAI 2006, pp. 641\u2013646. AAAI Press, Menlo Park (2006)"},{"key":"17_CR8","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Llull and Copeland voting computationally resist bribery and control. Technical report, Department of Computer Science, University of Rochester, Rochester, NY (in preparation)"},{"key":"17_CR9","first-page":"724","volume-title":"Proc. AAAI 2007","author":"P. Faliszewski","year":"2007","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Llull and Copeland voting broadly resist bribery and control. In: Proc. AAAI 2007, pp. 724\u2013730. AAAI Press, Menlo Park (2007)"},{"issue":"5-6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E. Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Anyone but him: The complexity of precluding an alternative. Artificial Intelligence\u00a0171(5-6), 255\u2013285 (2007)","journal-title":"Artificial Intelligence"},{"key":"17_CR11","first-page":"1308","volume-title":"Proc. IJCAI 2007","author":"E. Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Hybrid elections broaden complexity-theoretic resistance to control. In: Proc. IJCAI 2007, pp. 1308\u20131314. AAAI Press, Menlo Park (2007)"},{"key":"17_CR12","unstructured":"Homan, C., Hemaspaandra, L.: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Journal of Heuristics (to appear) Full version available as [13]"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Homan, C., Hemaspaandra, L.: Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. Technical Report TR-881, Department of Computer Science, University of Rochester, Rochester, NY, September 2005. Revised (June 2007)","DOI":"10.1007\/11821069_46"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. Lenstra Jr.","year":"1983","unstructured":"Lenstra Jr., H.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/jeth.1996.2205","volume":"72","author":"V. Merlin","year":"1997","unstructured":"Merlin, V., Saari, D.: Copeland method II: Manipulation, monotonicity, and paradoxes. Journal of Economic Theory\u00a072(1), 148\u2013172 (1997)","journal-title":"Journal of Economic Theory"},{"key":"17_CR16","first-page":"416","volume-title":"Proc. AAMAS 2007","author":"A. Procaccia","year":"2007","unstructured":"Procaccia, A., Rosenschein, J., Kaminka, G.: On the robustness of preference aggregation in noisy environments. In: Proc. AAMAS 2007, pp. 416\u2013422. ACM Press, New York (2007)"},{"key":"17_CR17","first-page":"1476","volume-title":"Proc. IJCAI 2007","author":"A. Procaccia","year":"2007","unstructured":"Procaccia, A., Rosenschein, J., Zohar, A.: Multi-winner elections: Complexity of manipulation, control, and winner-determination. In: Proc. IJCAI 2007, pp. 1476\u20131481. AAAI Press, Menlo Park (2007)"},{"issue":"1","key":"17_CR18","first-page":"51","volume":"8","author":"D. Saari","year":"1996","unstructured":"Saari, D., Merlin, V.: The Copeland method I: Relationships and the dictionary. Economic Theory\u00a08(1), 51\u201376 (1996)","journal-title":"Economic Theory"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/BF01180541","volume":"29","author":"E. Zermelo","year":"1929","unstructured":"Zermelo, E.: Die Berechnung der Turnier-Ergebnisse als ein Maximumproblem der Wahrscheinlichkeitsrechnung. Mathematische Zeitschrift\u00a029(1), 436\u2013460 (1929)","journal-title":"Mathematische Zeitschrift"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:00Z","timestamp":1620015420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}