{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:46:37Z","timestamp":1725536797158},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_12","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"124-136","source":"Crossref","is-referenced-by-count":7,"title":["Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules"],"prefix":"10.1007","author":[{"given":"Nadja","family":"Betzler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Britta","family":"Dorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Betzler, N., Hemmann, S., Niedermeier, R.: A multivariate complexity analysis of determining possible winners given incomplete votes. In: Proc. of 21st IJCAI 2009 (2009)"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V. Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? Journal of the ACM\u00a054(3), 1\u201333 (2007)","journal-title":"Journal of the ACM"},{"key":"12_CR3","unstructured":"Faliszewski, P.: Nonuniform bribery (short paper). In: Proc. 7th AAMAS 2008, pp. 1569\u20131572 (2008)"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. TCS\u00a0410(1), 53\u201361 (2009)","journal-title":"TCS"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jcss.2006.09.002","volume":"73","author":"E. Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L.A.: Dichotomy for voting systems. J. Comput. Syst. Sci.\u00a073(1), 73\u201383 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR6","unstructured":"Konczak, K., Lang, J.: Voting procedures with incomplete preferences. In: Proc. of IJCAI 2005 Multidisciplinary Workshop on Advances in Preference Handling (2005)"},{"key":"12_CR7","unstructured":"Lang, J., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Winner determination in sequential majority voting. In: Proc. of 20th IJCAI 2007, pp. 1372\u20131377 (2007)"},{"key":"12_CR8","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Incompleteness and incomparability in preference aggregation. In: Proc. of 20th IJCAI 2007, pp. 1464\u20131469 (2007)"},{"key":"12_CR9","first-page":"3","volume-title":"Proc. of 22nd AAAI 2007","author":"T. Walsh","year":"2007","unstructured":"Walsh, T.: Uncertainty in preference elicitation and aggregation. In: Proc. of 22nd AAAI 2007, pp. 3\u20138. AAAI Press, Menlo Park (2007)"},{"key":"12_CR10","first-page":"196","volume-title":"Proc. of 23rd AAAI 2008","author":"L. Xia","year":"2008","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners under common voting rules given partial orders. In: Proc. of 23rd AAAI 2008, pp. 196\u2013201. AAAI Press, Menlo Park (2008)"},{"key":"12_CR11","unstructured":"Xia, L., Zuckerman, M., Procaccia, A.D., Conitzer, V., Rosenschein, J.S.: Complexity of unweighted coalitional manipulation under some common voting rules. In: Proc. 21st IJCAI 2009 (2009)"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.artint.2008.11.005","volume":"173","author":"M. Zuckerman","year":"2009","unstructured":"Zuckerman, M., Procaccia, A.D., Rosenschein, J.S.: Algorithms for the coalitional manipulation problem. Artificial Intelligence\u00a0173(2), 392\u2013412 (2009)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:44:31Z","timestamp":1552117471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}