{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T08:27:15Z","timestamp":1759048035883,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_23","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"266-277","source":"Crossref","is-referenced-by-count":11,"title":["The Inverse Shapley Value Problem"],"prefix":"10.1007","author":[{"given":"Anindya","family":"De","sequence":"first","affiliation":[]},{"given":"Ilias","family":"Diakonikolas","sequence":"additional","affiliation":[]},{"given":"Rocco","family":"Servedio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Paterson, M., Leech, D.: Efficient algorithm for designing weighted voting games. In: IEEE Intl. Multitopic Conf., pp. 1\u20136 (2007)","DOI":"10.1109\/INMIC.2007.4557718"},{"key":"23_CR2","first-page":"317","volume":"19","author":"J. Banzhaf","year":"1965","unstructured":"Banzhaf, J.: Weighted voting doesn\u2019t work: A mathematical analysis. Rutgers Law Review\u00a019, 317\u2013343 (1965)","journal-title":"Rutgers Law Review"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02698830","volume":"90","author":"I. Benjamini","year":"1999","unstructured":"Benjamini, I., Kalai, G., Schramm, O.: Noise sensitivity of Boolean functions and applications to percolation. Inst. Hautes \u00c9tudes Sci. Publ. Math.\u00a090, 5\u201343 (1999)","journal-title":"Inst. Hautes \u00c9tudes Sci. Publ. Math."},{"issue":"2","key":"23_CR4","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. Autonomous Agents and Multi-Agent Systems\u00a020(2), 105\u2013122 (2010)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chow, C.K.: On the characterization of threshold functions. In: Proc. 2nd FOCS 1961, pp. 34\u201338 (1961)","DOI":"10.1109\/FOCS.1961.24"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"De, A., Diakonikolas, I., Feldman, V., Servedio, R.: Near-optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces. To appear in STOC (2012)","DOI":"10.1145\/2213977.2214043"},{"key":"23_CR7","unstructured":"de Keijzer, B.: A survey on the computation of power indices (2008), http:\/\/www.st.ewi.tudelft.nl\/~tomas\/theses\/DeKeijzerSurvey.pdf"},{"key":"23_CR8","unstructured":"de Keijzer, B., Klos, T., Zhang, Y.: Enumeration and exact design of weighted voting games. In: AAMAS 2010, pp. 391\u2013398 (2010)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01753239","volume":"7","author":"J. Deegan","year":"1978","unstructured":"Deegan, J., Packel, E.: A new index of power for simple n-person games. International Journal of Game Theory\u00a07, 113\u2013123 (1978)","journal-title":"International Journal of Game Theory"},{"key":"23_CR10","unstructured":"Elkind, E., Goldberg, L.A., Goldberg, P.W., Wooldridge, M.: Computational complexity of weighted voting games. In: AAAI 2007, pp. 718\u2013723 (2007)"},{"key":"23_CR11","unstructured":"Fatima, S., Wooldridge, M., Jennings, N.: An Anytime Approximation Method for the Inverse Shapley Value Problem. In: AAMAS 2008, pp. 935\u2013942 (2008)"},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/S0895480103426765","volume":"20","author":"P. Goldberg","year":"2006","unstructured":"Goldberg, P.: A Bound on the Precision Required to Estimate a Boolean Perceptron from its Average Satisfying Assignment. SIDMA\u00a020, 328\u2013343 (2006)","journal-title":"SIDMA"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1111\/j.1467-9248.1982.tb00537.x","volume":"30","author":"M.J. Holler","year":"1982","unstructured":"Holler, M.J.: Forming coalitions and measuring voting power. Political Studies\u00a030, 262\u2013271 (1982)","journal-title":"Political Studies"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: Proc. 36th FOCS 1995, pp. 538\u2013545 (1995)","DOI":"10.1109\/SFCS.1995.492584"},{"key":"23_CR15","unstructured":"Kalai, G., Safra, S.: Threshold phenomena and influence. In: Computational Complexity and Statistical Physics, pp. 25\u201360. Oxford University Press (2006)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Kurz, S.: On the inverse power index problem. Optimization (2011), doi:10.1080\/02331934.2011.587008","DOI":"10.1080\/02331934.2011.587008"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Leech, D.: Computing power indices for large voting games. Management Science\u00a049(6) (2003)","DOI":"10.1287\/mnsc.49.6.831.16024"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0016-0032(61)90702-5","volume":"271","author":"S. Muroga","year":"1961","unstructured":"Muroga, S., Toda, I., Takasu, S.: Theory of majority switching elements. J. Franklin Institute\u00a0271, 376\u2013418 (1961)","journal-title":"J. Franklin Institute"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R., Servedio, R.: The Chow Parameters Problem. In: Proc. 40th STOC 2008, pp. 517\u2013526 (2008)","DOI":"10.1145\/1374376.1374450"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Owen, G.: Multilinear extensions of games. Management Science\u00a018(5), 64\u201379 (1972); Part 2, Game theory and Gaming","DOI":"10.1287\/mnsc.18.5.64"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Roth, A.E. (ed.): The Shapley value. University of Cambridge Press (1988)","DOI":"10.1017\/CBO9780511528446"},{"key":"23_CR22","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. American Political Science Review\u00a048, 787\u2013792 (1954)","journal-title":"American Political Science Review"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Tulsiani, M., Vadhan, S.: Regularity, Boosting and Efficiently Simulating every High Entropy Distribution. Technical Report 103, ECCC, 2008. Conference version in Proc. CCC (2009)","DOI":"10.1109\/CCC.2009.41"},{"key":"23_CR24","unstructured":"Zuckerman, M., Faliszewski, P., Bachrach, Y., Elkind, E.: Manipulating the quota in weighted voting games. In: AAAI, pp. 215\u2013220 (2008)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T12:13:01Z","timestamp":1743595981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}