{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:21:21Z","timestamp":1742984481203,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415746"},{"type":"electronic","value":"9783642415753"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41575-3_3","type":"book-chapter","created":{"date-parts":[[2013,10,28]],"date-time":"2013-10-28T01:37:47Z","timestamp":1382924267000},"page":"30-44","source":"Crossref","is-referenced-by-count":0,"title":["How to Put through Your Agenda in Collective Binary Decisions"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Robert","family":"Bredereck","sequence":"additional","affiliation":[]},{"given":"Jiehua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0097-3165(86)90026-9","volume":"43","author":"N. Alon","year":"1986","unstructured":"Alon, N., Berman, K.A.: Regular hypergraphs, Gordon\u2019s lemma, Steinitz\u2019 lemma and invariant theory. J.\u00a0Combin. Theory Ser.\u00a0A\u00a043(1), 91\u201397 (1986)","journal-title":"J.\u00a0Combin. Theory Ser.\u00a0A"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Falik, D., Meir, R., Tennenholtz, M.: Bundling attacks in judgment aggregation. In: Proc. 27th AAAI. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8611"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1006\/jcta.1997.2780","volume":"79","author":"N. Alon","year":"1997","unstructured":"Alon, N., Vu, V.H.: Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs. J.\u00a0Combin. Theory Ser.\u00a0A\u00a079(1), 133\u2013160 (1997)","journal-title":"J.\u00a0Combin. Theory Ser.\u00a0A"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Proc. 2nd ADT","author":"D. Baumeister","year":"2011","unstructured":"Baumeister, D., Erd\u00e9lyi, G., Rothe, J.: How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation. In: Brafman, R. (ed.) ADT 2011. LNCS, vol.\u00a06992, pp. 1\u201315. Springer, Heidelberg (2011)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-30891-8_16","volume-title":"The Multivariate Algorithmic Revolution and Beyond","author":"N. Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Chen, J., Niedermeier, R.: Studies in computational aspects of voting\u2014a parameterized complexity perspective. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) Fellows Festschrift 2012. LNCS, vol.\u00a07370, pp. 318\u2013363. Springer, Heidelberg (2012)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: New upper and lower bound techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 17\u201337. Springer, Heidelberg (2009)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Such\u00fd, O.: A multivariate complexity analysis of lobbying in multiple referenda. In: Proc. 26th AAAI, pp. 1292\u20131298. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8248"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s11238-011-9286-z","volume":"72","author":"T. \u00c7uhadaro\u01e7lu","year":"2012","unstructured":"\u00c7uhadaro\u01e7lu, T., Lain\u00e9, J.: Pareto efficiency in multiple referendum. Theory Dec.\u00a072(4), 525\u2013536 (2012)","journal-title":"Theory Dec."},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10058-007-0028-1","volume":"11","author":"R. Christian","year":"2007","unstructured":"Christian, R., Fellows, M., Rosamond, F., Slinko, A.: On complexity of lobbying in multiple referenda. Rev. Econ. Design\u00a011(3), 217\u2013224 (2007)","journal-title":"Rev. Econ. Design"},{"key":"3_CR10","unstructured":"Conitzer, V., Lang, J., Xia, L.: How hard is it to control sequential elections via the agenda? In: Proc. 21st IJCAI, pp. 103\u2013108. AAAI Press (2009)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"Automata, Languages and Programming","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 378\u2013389. Springer, Heidelberg (2009)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"3_CR13","unstructured":"Elkind, E., Lang, J., Saffidine, A.: Choosing collectively optimal sets of alternatives based on the Condorcet criterion. In: Proc. 22nd IJCAI, pp. 186\u2013191. AAAI Press (2011)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1613\/jair.3708","volume":"45","author":"U. Endriss","year":"2012","unstructured":"Endriss, U., Grandi, U., Porello, D.: Complexity of judgment aggregation. J. Artif. Intell. Res.\u00a045, 481\u2013514 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-04428-1_8","volume-title":"Algorithmic Decision Theory","author":"G. Erd\u00e9lyi","year":"2009","unstructured":"Erd\u00e9lyi, G., Fernau, H., Goldsmith, J., Mattei, N., Raible, D., Rothe, J.: The complexity of probabilistic lobbying. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS, vol.\u00a05783, pp. 86\u201397. Springer, Heidelberg (2009)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-540-74240-1_26","volume-title":"Fundamentals of Computation Theory","author":"G. Erd\u00e9lyi","year":"2007","unstructured":"Erd\u00e9lyi, G., Hemaspaandra, L.A., Rothe, J., Spakowski, H.: On approximating optimal weighted lobbying, and\u00a0frequency\u00a0of\u00a0correctness versus average-case\u00a0polynomial\u00a0time. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 300\u2013311. Springer, Heidelberg (2007)"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00224-008-9138-6","volume":"46","author":"M.R. Fellows","year":"2010","unstructured":"Fellows, M.R., Flum, J., Hermelin, D., M\u00fcller, M., Rosamond, F.A.: W-hierarchies defined by symmetric gates. Theory Comput. Syst.\u00a046(2), 311\u2013339 (2010)","journal-title":"Theory Comput. Syst."},{"key":"3_CR18","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica\u00a07(1), 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"3_CR20","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability\u2014A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"key":"3_CR21","unstructured":"Graver, J.E.: A survey of the maximum depth problem for indecomposable exact covers. In: Infinite and Finite Sets, Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol.\u00a010, pp. 731\u2013743. North-Holland (1973)"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"key":"3_CR23","unstructured":"Hermelin, D., Kratsch, S., Soltys, K., Wahlstr\u00f6m, M., Wu, X.: Hierarchies of inefficient kernelizability. In: CoRR, abs\/1110.0976 (2011)"},{"issue":"3","key":"3_CR24","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res.\u00a012(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00355-008-0325-9","volume":"32","author":"G. Laffond","year":"2009","unstructured":"Laffond, G., Lain\u00e9, J.: Condorcet choice and the Ostrogorski paradox. Soc. Choice Welf.\u00a032(2), 317\u2013333 (2009)","journal-title":"Soc. Choice Welf."},{"issue":"4","key":"3_CR26","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10726-010-9226-2","volume":"21","author":"G. Laffond","year":"2012","unstructured":"Laffond, G., Lain\u00e9, J.: Searching for a compromise in multiple referendum. Group Decis. and Negot.\u00a021(4), 551\u2013569 (2012)","journal-title":"Group Decis. and Negot."},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"A.D. Procaccia","year":"2008","unstructured":"Procaccia, A.D., Rosenschein, J.S., Zohar, A.: On the complexity of achieving proportional representation. Soc. Choice Welf.\u00a030(3), 353\u2013362 (2008)","journal-title":"Soc. Choice Welf."},{"key":"3_CR29","first-page":"66","volume":"32","author":"S.V. Sevastyanov","year":"1978","unstructured":"Sevastyanov, S.V.: On approximate solutions of scheduling problems. Metody Discretnogo Analiza\u00a032, 66\u201375 (1978) (in Russian)","journal-title":"Metody Discretnogo Analiza"}],"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-642-41575-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T17:22:34Z","timestamp":1688577754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41575-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415746","9783642415753"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41575-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}