{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:00:53Z","timestamp":1743156053108,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231136"},{"type":"electronic","value":"9783319231143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","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":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_23","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"379-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Complexity of Optimal Lobbying in Threshold Aggregation"],"prefix":"10.1007","author":[{"given":"Ilan","family":"Nehama","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1016\/j.jet.2012.01.010","volume":"147","author":"M Babaioff","year":"2012","unstructured":"Babaioff, M., Feldman, M., Nisan, N., Winter, E.: Combinatorial agency. J. Econ. Theor. 147, 999\u20131034 (2012)","journal-title":"J. Econ. Theor."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF00183045","volume":"8","author":"JJ Bartholdi","year":"1991","unstructured":"Bartholdi, J.J., Orlin, J.B.: Single transferable vote resists strategic voting. Soc. Choice Welf. 8, 341\u2013354 (1991)","journal-title":"Soc. Choice Welf."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"JJ Bartholdi","year":"1989","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6, 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"JJ Bartholdi","year":"1992","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Model. 16, 27\u201340 (1992)","journal-title":"Math. Comput. Model."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-24873-3_1","volume-title":"Algorithmic Decision Theory","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. 6992, pp. 1\u201315. Springer, Heidelberg (2011)"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1613\/jair.4285","volume":"50","author":"R Bredereck","year":"2014","unstructured":"Bredereck, R., Chen, J., Hartung, S., Kratsch, S., Niedermeier, R., Such\u00fd, O., Woeginger, G.J.: A multivariate complexity analysis of lobbying in multiple referenda. J. Artif. Intell. Res. 50(1), 409\u2013446 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Chen, J., Hartung, S., Niedermeier, R., Such\u1ef3, O., Kratsch, S.: A multivariate complexity analysis of lobbying in multiple referenda. In: Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (2012)","DOI":"10.1609\/aaai.v26i1.8248"},{"key":"23_CR8","first-page":"217","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. Des. 11, 217\u2013224 (2007)","journal-title":"Rev. Econ. Des."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1006\/jagm.2001.1199","volume":"41","author":"M Dawande","year":"2001","unstructured":"Dawande, M., Keskinocak, P., Swaminathan, J.M., Tayur, S.: On bipartite and multipartite clique problems. J. Algorithms 41, 388\u2013403 (2001)","journal-title":"J. Algorithms"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1177\/0951629807080775","volume":"19","author":"F Dietrich","year":"2007","unstructured":"Dietrich, F., List, C.: Judgment aggregation by quota rules. J. Theor. Polit. 19, 391\u2013424 (2007)","journal-title":"J. Theor. Polit."},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","volume":"64","author":"B Dorn","year":"2012","unstructured":"Dorn, B., Schlotter, I.: Multivariate complexity analysis of swap bribery. Algorithmica 64, 126\u2013151 (2012)","journal-title":"Algorithmica"},{"key":"23_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer-Verlag New York, Inc., New York (1999)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-04645-2_27","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2009","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 299\u2013310. Springer, Heidelberg (2009)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1613\/jair.2676","volume":"35","author":"P Faliszewski","year":"2009","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: How hard is bribery in elections? J. Artif. Intell. Res. 35, 485\u2013532 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"11","key":"23_CR15","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1839676.1839696","volume":"53","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: Using complexity to protect elections. Commun. ACM 53(11), 74\u201382 (2010)","journal-title":"Commun. ACM"},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v31i4.2314","volume":"31","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Procaccia, A.D.: AI\u2019s war on manipulation: Are we winning? AI Mag. 31(4), 53\u201364 (2010)","journal-title":"AI Mag."},{"key":"23_CR17","series-title":"Texts in Theoretical Computer Science","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Heidelberg (2006)"},{"key":"23_CR18","series-title":"Series of Books in the Mathematical Sciences","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W.H. Freeman, New York (1979)"},{"issue":"3","key":"23_CR19","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1093\/oep\/gpm045","volume":"60","author":"GW Harrison","year":"2008","unstructured":"Harrison, G.W., McDaniel, T.: Voting games and computational complexity. Oxf. Econ. Pap. 60(3), 546\u2013565 (2008)","journal-title":"Oxf. Econ. Pap."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"324","DOI":"10.2307\/3003457","volume":"13","author":"B Holmstrom","year":"1982","unstructured":"Holmstrom, B.: Moral hazard in teams. Bell J. Econ. 13, 324\u2013340 (1982)","journal-title":"Bell J. Econ."},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR22","volume-title":"Philosophy of Economics","author":"C List","year":"2012","unstructured":"List, C.: Judgment aggregation: a short introduction. In: Gabbay, D.M., Thagard, P., Woods, J., M\u00e4ki, U. (eds.) Philosophy of Economics. Elsevier, Amsterdam (2012)"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.jet.2010.02.001","volume":"145","author":"C List","year":"2010","unstructured":"List, C., Polak, B.: Introduction to judgment aggregation. J. Econ. Theor. 145, 441\u2013466 (2010)","journal-title":"J. Econ. Theor."},{"key":"23_CR24","volume-title":"The Handbook of Rational and Social Choice","author":"C List","year":"2009","unstructured":"List, C., Puppe, C.: Judgement aggregation: a survey. In: Pattanaik, P., Anand, P., Puppe, C. (eds.) The Handbook of Rational and Social Choice. Oxford University Press, Oxford (2009)"},{"key":"23_CR25","unstructured":"Nehama, I.: Complexity of optimal lobbying in threshold aggregation. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2013, pp. 1197\u20131198 (2013)"},{"key":"23_CR26","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)"},{"key":"23_CR27","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"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-319-23114-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T12:52:04Z","timestamp":1691931124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}