{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:27:58Z","timestamp":1742912878951,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_13","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"194-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games"],"prefix":"10.1007","author":[{"given":"Joanna","family":"Kaczmarek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0589-3616","authenticated-orcid":false,"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1613\/jair.3166","volume":"40","author":"H Aziz","year":"2011","unstructured":"Aziz, H., Bachrach, Y., Elkind, E., Paterson, M.: False-name manipulations in weighted voting games. Journal of Artificial Intelligence Research 40, 57\u201393 (2011)","journal-title":"Journal of Artificial Intelligence Research"},{"unstructured":"Banzhaf, J., III.: Weighted voting doesn\u2019t work: a mathematical analysis. Rutgers Law Rev. 19, 317\u2013343 (1965)","key":"13_CR2"},{"key":"13_CR3","first-page":"1","volume":"5","author":"G Chalkiadakis","year":"2011","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational aspects of cooperative game theory. Synth. Lect. Artif. Intell. Mach. Learn. 5, 1\u2013168 (2011)","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Wooldridge, M.: Weighted voting games. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, chap. 16, pp. 377\u2013395. Cambridge University Press (2016)","key":"13_CR4","DOI":"10.1017\/CBO9781107446984.017"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/moor.4.2.99","volume":"4","author":"P Dubey","year":"1979","unstructured":"Dubey, P., Shapley, L.: Mathematical properties of the Banzhaf power index. Mathematics of Operations Research 4(2), 99\u2013131 (1979)","journal-title":"Mathematics of Operations Research"},{"doi-asserted-by":"publisher","unstructured":"Elkind, E., Rothe, J.: Cooperative game theory. In: Rothe, J. (ed.) Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, chap. 3, pp. 135-193. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-662-47904-9_3","key":"13_CR6","DOI":"10.1007\/978-3-662-47904-9_3"},{"key":"13_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/moor.2.3.225","volume":"2","author":"R Myerson","year":"1977","unstructured":"Myerson, R.: Graphs and cooperation in games. Mathematics of Operations Research 2(3), 225\u2013229 (1977)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.mathsocsci.2012.05.008","volume":"64","author":"S Napel","year":"2012","unstructured":"Napel, S., Nohn, A., Alonso-Meijide, J.: Monotonicity of power in weighted voting games with restricted communication. Mathematical Social Sciences 64(3), 247\u2013257 (2012)","journal-title":"Mathematical Social Sciences"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"C Papadimitriou","year":"1984","unstructured":"Papadimitriou, C., Yannakakis, M.: The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences 28(2), 244\u2013259 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/2981392","volume":"109","author":"L Penrose","year":"1946","unstructured":"Penrose, L.: The elementary statistics of majority voting. Journal of the Royal Statistical Society 109(1), 53\u201357 (1946)","journal-title":"Journal of the Royal Statistical Society"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1613\/jair.4293","volume":"50","author":"A Rey","year":"2014","unstructured":"Rey, A., Rothe, J.: False-name manipulation in weighted voting games is hard for probabilistic polynomial time. J. Artif. Intell. Res. 50, 573\u2013601 (2014)","journal-title":"J. Artif. Intell. Res."},{"doi-asserted-by":"crossref","unstructured":"Rey, A., Rothe, J.: Structural control in weighted voting games. B.E. J. Theor. Econ. 18(2), 1\u201315 (2018)","key":"13_CR13","DOI":"10.1515\/bejte-2016-0169"},{"issue":"5","key":"13_CR14","first-page":"551","volume":"12","author":"T Riege","year":"2006","unstructured":"Riege, T., Rothe, J.: Completeness in the boolean hierarchy: Exact-Four-Colorability, minimal graph uncolorability, and exact domatic number problems - a survey. Journal of Universal Computer Science 12(5), 551\u2013578 (2006)","journal-title":"Journal of Universal Computer Science"},{"doi-asserted-by":"publisher","unstructured":"Riege, T., Rothe, J.: Complexity of the exact domatic number problem and of the exact conveyor flow shop problem. Theor. Comput. Syst. 39(5), 635\u2013668 (2006). https:\/\/doi.org\/10.1007\/s00224-004-1209-8","key":"13_CR15","DOI":"10.1007\/s00224-004-1209-8"},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(03)00229-1","volume":"87","author":"J Rothe","year":"2003","unstructured":"Rothe, J.: Exact complexity of Exact-Four-Colorability. Information Processing Letters 87(1), 7\u201312 (2003)","journal-title":"Information Processing Letters"},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"787","DOI":"10.2307\/1951053","volume":"48","author":"L Shapley","year":"1954","unstructured":"Shapley, L., Shubik, M.: A method of evaluating the distribution of power in a committee system. The American Political Science Review 48(3), 787\u2013792 (1954)","journal-title":"The American Political Science Review"},{"unstructured":"Skibski, O., Michalak, T., Sakurai, Y., Yokoo, M.: A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence, pp. 631\u2013637. AAAI Press\/IJCAI, July 2015","key":"13_CR18"},{"key":"13_CR19","volume-title":"Simple Games: Desirability Relations, Trading, Pseudoweightings","author":"A Taylor","year":"1999","unstructured":"Taylor, A., Zwicker, W.: Simple Games: Desirability Relations, Trading, Pseudoweightings. Princeton University Press, Princeton (1999)"},{"issue":"1\u20132","key":"13_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","volume":"51","author":"K Wagner","year":"1987","unstructured":"Wagner, K.: More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science 51(1\u20132), 53\u201380 (1987)","journal-title":"Theoretical Computer Science"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2011.12.003","volume":"180\u2013181","author":"M Zuckerman","year":"2012","unstructured":"Zuckerman, M., Faliszewski, P., Bachrach, Y., Elkind, E.: Manipulating the quota in weighted voting games. Artificial Intelligence 180\u2013181, 1\u201319 (2012)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:08:13Z","timestamp":1635289693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","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":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"27","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":"0","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":"47% - 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":"7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}