{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:39:25Z","timestamp":1757543965293,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662533536"},{"type":"electronic","value":"9783662533543"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-662-53354-3_14","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T22:43:34Z","timestamp":1472942614000},"page":"169-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Analyzing Power in Weighted Voting Games with Super-Increasing Weights"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Filmus","sequence":"additional","affiliation":[]},{"given":"Joel","family":"Oren","sequence":"additional","affiliation":[]},{"given":"Yair","family":"Zick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"issue":"1\u20132","key":"14_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(00)00251-6","volume":"263","author":"Y Matsui","year":"2001","unstructured":"Matsui, Y., Matsui, T.: $$\\mathit{NP}$$ -completeness for calculating power indices of weighted majority games. Theor. Comput. Sci. 263(1\u20132), 305\u2013310 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR2","unstructured":"Aziz, H., Paterson, M.: Computing voting power in easy weighted voting games. CoRR abs\/0811.2497 (2008)"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0165-4896(99)00050-5","volume":"40","author":"N Chakravarty","year":"2000","unstructured":"Chakravarty, N., Goel, A., Sastry, T.: Easy weighted majority games. Math. Soc. Sci. 40(2), 227\u2013235 (2000)","journal-title":"Math. Soc. Sci."},{"key":"14_CR4","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. Artif. Intell. 180\u2013181, 1\u201319 (2012)","journal-title":"Artif. Intell."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Shapley, L.: A value for $$n$$ -person games. In: Contributions to the Theory of Games, vol. 2. Annals of Mathematics Studies, vol. 28, pp. 307\u2013317. Princeton University Press, Princeton (1953)","DOI":"10.1515\/9781400881970-018"},{"issue":"3","key":"14_CR6","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 for evaluating the distribution of power in a committee system. Am. Polit. Sci. Rev. 48(3), 787\u2013792 (1954)","journal-title":"Am. Polit. Sci. Rev."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Morgan and Claypool (2011)","DOI":"10.2200\/S00355ED1V01Y201107AIM016"},{"key":"14_CR8","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. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.017"},{"key":"14_CR9","unstructured":"Elkind, E., Goldberg, L., Goldberg, P., Wooldridge, M.: Computational complexity of weighted threshold games. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 718\u2013723 (2007)"},{"key":"14_CR10","unstructured":"See, A., Bachrach, Y., Kohli, P.: The cost of principles: analyzing power in compatibility weighted voting games. In: AAMAS (2014)"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10458-009-9078-9","volume":"20","author":"Y Bachrach","year":"2010","unstructured":"Bachrach, Y., Markakis, E., Resnick, E., Procaccia, A., Rosenschein, J., Saberi, A.: Approximating power indices: theoretical and empirical analysis. Auton. Agent. Multi-Agent Syst. 20(2), 105\u2013122 (2010)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"14_CR12","unstructured":"Fatima, S., Wooldridge, M., Jennings, N.: An approximation method for power indices for voting games. In: Proceedings of the 2nd International Workshop on Agent-Based Complex Automated Negotiations (ACAN 2009), pp. 72\u201386 (2009)"},{"key":"14_CR13","unstructured":"Maleki, S., Tran-Thanh, L., Hines, G., Rahwan, T., Rogers, A.: Bounding the estimation error of sampling-based shapley value approximation with\/without stratifying. CoRR abs\/1306.4265 (2013)"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X Deng","year":"1994","unstructured":"Deng, X., Papadimitriou, C.: On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2), 257\u2013266 (1994)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1287\/mnsc.20.3.370","volume":"20","author":"SC Littlechild","year":"1973","unstructured":"Littlechild, S.C., Owen, G.: A simple expression for the shapely value in a special case. Manage. Sci. 20(3), 370\u2013372 (1973)","journal-title":"Manage. Sci."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.artint.2015.11.001","volume":"231","author":"P Szczepa\u0144ski","year":"2016","unstructured":"Szczepa\u0144ski, P., Michalak, T., Rahwan, T.: Efficient algorithms for game-theoretic betweenness centrality. Artif. Intell. 231, 39\u201363 (2016)","journal-title":"Artif. Intell."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2013.07.005","volume":"204","author":"Y Bachrach","year":"2013","unstructured":"Bachrach, Y., Parkes, D.C., Rosenschein, J.S.: Computing cooperative solution concepts in coalitional skill games. Artif. Intell. 204, 1\u201321 (2013)","journal-title":"Artif. Intell."},{"key":"14_CR18","unstructured":"Blocq, G., Bachrach, Y., Key, P.: The shared assignment game and applications to pricing in cloud computing. In: AAMAS (2014)"},{"key":"14_CR19","unstructured":"Bachrach, Y.: Honor among thieves: collusion in multi-unit auctions. In: AAMAS (2010)"},{"key":"14_CR20","unstructured":"Bachrach, Y., Lev, O., Lovett, S., Rosenschein, J.S., Zadimoghaddam, M.: Cooperative weakest link games. In: AAMAS (2014)"},{"key":"14_CR21","unstructured":"Bachrach, Y., Graepel, T., Kasneci, G., Kosinski, M., Van Gael, J.: Crowd IQ: aggregating opinions to boost performance. In: AAMAS (2012)"},{"key":"14_CR22","unstructured":"Elkind, E., Pasechnik, D., Zick, Y.: Dynamic weighted voting games. In: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems, International Foundation for Autonomous Agents and Multiagent Systems, pp. 515\u2013522 (2013)"},{"key":"14_CR23","unstructured":"Bachrach, Y., Kohli, P., Graepel, T.: Rip-off: playing the cooperative negotiation game. In: AAMAS, pp. 1179\u20131180 (2011)"},{"key":"14_CR24","unstructured":"Bachrach, Y., Elkind, E., Faliszewski, P.: Coalitional voting manipulation: a game-theoretic perspective (2011)"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10472-012-9323-9","volume":"67","author":"Y Bachrach","year":"2013","unstructured":"Bachrach, Y., Zuckerman, M., Wooldridge, M., Rosenschein, J.S.: Proof systems and transformation games. Ann. Math. Artif. Intell. 67(1), 1\u201330 (2013)","journal-title":"Ann. Math. Artif. Intell."},{"key":"14_CR26","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1613\/jair.3841","volume":"47","author":"Y Bachrach","year":"2013","unstructured":"Bachrach, Y., Porat, E.P., Rosenschein, J.S.: Sharing rewards in cooperative connectivity games. J. Artif. Intell. Res. 47, 281\u2013311 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"14_CR27","unstructured":"Bachrach, Y., Meir, R., Feldman, M., Tennenholtz, M.: Solving cooperative reliability games. In: UAI (2012)"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-41392-6_4","volume-title":"Algorithmic Game Theory","author":"Y Bachrach","year":"2013","unstructured":"Bachrach, Y., Shah, N.: Reliability weighted voting games. In: V\u00f6cking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 38\u201349. Springer, Heidelberg (2013)"},{"key":"14_CR29","first-page":"432","volume":"13","author":"Y Zick","year":"2013","unstructured":"Zick, Y.: On random quotas and proportional representation in weighted voting Games. IJCAI 13, 432\u2013438 (2013)","journal-title":"IJCAI"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-35311-6_2","volume-title":"Internet and Network Economics","author":"Y Bachrach","year":"2012","unstructured":"Bachrach, Y., Kash, I., Shah, N.: Agent failures in totally balanced games and convex games. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 15\u201329. Springer, Heidelberg (2012)"},{"key":"14_CR31","unstructured":"Bachrach, Y., Savani, R., Shah, N.: Cooperative max games and agent failures. In: AAMAS (2014)"},{"key":"14_CR32","doi-asserted-by":"crossref","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. J. Artif. Intell. Res. 40, 57\u201393 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"14_CR33","series-title":"Communications in Computer and Information Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/978-3-642-36907-0_24","volume-title":"Agents and Artificial Intelligence","author":"RO Lasisi","year":"2013","unstructured":"Lasisi, R.O., Allan, V.H.: Manipulation of weighted voting games via annexation and merging. In: Filipe, J., Fred, A. (eds.) ICAART 2012. CCIS, vol. 358, pp. 364\u2013378. Springer, Heidelberg (2013)"},{"key":"14_CR34","unstructured":"Lasisi, R., Allan, V.: New bounds on false-name manipulation in weighted voting games. In: Proceedings of the 27th International Florida Artificial Intelligence Research Society Conference (FLAIRS 2014), pp. 57\u201362 (2014)"},{"key":"14_CR35","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53354-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T18:50:32Z","timestamp":1657219832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53354-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662533536","9783662533543"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53354-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Liverpool","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}