{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:43:50Z","timestamp":1768873430018,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,3,10]],"date-time":"2012-03-10T00:00:00Z","timestamp":1331337600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10479-012-1108-3","type":"journal-article","created":{"date-parts":[[2012,3,9]],"date-time":"2012-03-09T14:19:25Z","timestamp":1331302765000},"page":"361-369","source":"Crossref","is-referenced-by-count":46,"title":["On minimum sum representations for weighted voting games"],"prefix":"10.1007","volume":"196","author":[{"given":"Sascha","family":"Kurz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,10]]},"reference":[{"issue":"3","key":"1108_CR1","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00355-009-0402-8","volume":"34","author":"N. Alon","year":"2010","unstructured":"Alon, N., & Edelman, P. H. (2010). The inverse Banzhaf problem. Social Choice and Welfare, 34(3), 371\u2013377.","journal-title":"Social Choice and Welfare"},{"key":"1108_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0165-4896(96)00815-3","volume":"32","author":"F. Carreras","year":"1996","unstructured":"Carreras, F., & Freixas, J. (1996). Complete simple games. Mathematical Social Sciences, 32, 139\u2013155.","journal-title":"Mathematical Social Sciences"},{"key":"1108_CR3","unstructured":"de Keijzer, B. (2009). On the design and synthesis of voting games. Master\u2019s thesis, Delft University of Technology."},{"key":"1108_CR4","first-page":"391","volume-title":"Proceedings of the 9th international conference on autonomous agents and multiagent systems","author":"B. Keijzer de","year":"2010","unstructured":"de Keijzer, B., Klos, T., & Zhang, Y. (2010). Enumeration and exact design of weighted voting games. In Proceedings of the 9th international conference on autonomous agents and multiagent systems (Vol.\u00a01, pp. 391\u2013398)."},{"key":"1108_CR5","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10479-008-0422-2","volume":"166","author":"J. Freixas","year":"2009","unstructured":"Freixas, J., & Molinero, X. (2009). On the existence of a minimum integer representation for weighted voting games. Annals of Operations Research, 166, 243\u2013260.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1108_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/10556780903057333","volume":"25","author":"J. Freixas","year":"2010","unstructured":"Freixas, J., & Molinero, X. (2010). Weighted games without a unique minimal representation in integers. Optimization Methods & Software, 25(2), 203\u2013215.","journal-title":"Optimization Methods & Software"},{"key":"1108_CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1215\/S0012-7094-58-02537-7","volume":"25","author":"J. Isbell","year":"1958","unstructured":"Isbell, J. (1958). A class of simple games. Duke Mathematical Journal, 25, 423\u2013439.","journal-title":"Duke Mathematical Journal"},{"key":"1108_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.2307\/2002191","volume":"13","author":"J. Isbell","year":"1959","unstructured":"Isbell, J. (1959). On the enumeration of majority games. Mathematical Tables and Other Aids To Computation, 13, 21\u201328.","journal-title":"Mathematical Tables and Other Aids To Computation"},{"issue":"2","key":"1108_CR9","first-page":"189","volume":"42","author":"I. Krohn","year":"1995","unstructured":"Krohn, I., & Sudh\u00f6lter, P. (1995). Directed and weighted majority games. ZOR. Zeitschrift F\u00fcr Operations-Research, 42(2), 189\u2013216.","journal-title":"ZOR. Zeitschrift F\u00fcr Operations-Research"},{"key":"1108_CR10","author":"S. Kurz","year":"2012","unstructured":"Kurz, S. (2012). On the inverse power index problem. Optimization. doi: 10.1080\/02331934.2011.587008 . 21\u00a0pp.","journal-title":"Optimization"},{"key":"1108_CR11","doi-asserted-by":"crossref","unstructured":"Kurz, S., & Tautenhahn, N. (2012, accepted). On Dedekind\u2019s problem for complete simple games. International Journal on Game Theory, 25 p.","DOI":"10.1007\/s00182-012-0327-9"},{"key":"1108_CR12","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1090\/S0025-5718-62-99195-0","volume":"16","author":"S. Muroga","year":"1962","unstructured":"Muroga, S., Toda, I., & Kondo, M. (1962). Majority decision functions of up to six variables. Mathematics of Computation, 16, 459\u2013472.","journal-title":"Mathematics of Computation"},{"key":"1108_CR13","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/T-C.1970.223046","volume":"19","author":"S. Muroga","year":"1970","unstructured":"Muroga, S., Tsuboi, T., & Baugh, C. R. (1970). Enumeration of threshold functions of eight variables. IEEE Transactions on Computers, 19, 818\u2013825.","journal-title":"IEEE Transactions on Computers"},{"key":"1108_CR14","unstructured":"Niskanen, S., & \u00d6sterg\u00e5rd, P. (2003). Cliquer user\u2019s guide, version 1.0 (Tech. Rep. T48). Communications Laboratory, Helsinki University of Technology."},{"issue":"1\u20133","key":"1108_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P. R. J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P. R. J. (2002). A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120(1\u20133), 197\u2013207.","journal-title":"Discrete Applied Mathematics"},{"key":"1108_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(85)90040-X","volume":"12","author":"U. N. Peled","year":"1985","unstructured":"Peled, U. N., & Simeone, B. (1985). Polynomial-time algorithms for regular set-covering and threshold synthesis. Discrete Applied Mathematics, 12, 57\u201369.","journal-title":"Discrete Applied Mathematics"},{"key":"1108_CR17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","volume":"2","author":"R. C. Read","year":"1978","unstructured":"Read, R. C. (1978). Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Annals of Discrete Mathematics, 2, 107\u2013120.","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"1108_CR18","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1287\/moor.21.3.734","volume":"21","author":"P. Sudh\u00f6lter","year":"1996","unstructured":"Sudh\u00f6lter, P. (1996). The modified nucleolus as canonical representation of weighted majority games. Mathematics of Operations Research, 21(3), 734\u2013756.","journal-title":"Mathematics of Operations Research"},{"key":"1108_CR19","unstructured":"Tautenhahn, N. (2008). Enumeration einfacher Spiele mit Anwendungen in der Stimmgewichtsverteilung. Master\u2019s thesis, Bayreuth, 269 pages, in German."},{"key":"1108_CR20","volume-title":"Simple games. Desirability relations, trading, pseudoweightings","author":"A. D. Taylor","year":"1999","unstructured":"Taylor, A. D., & Zwicker, W. S. (1999). Simple games. Desirability relations, trading, pseudoweightings. New Jersey: Princeton University Press. 246 p."},{"key":"1108_CR21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/PGEC.1965.264136","volume":"14","author":"R. O. Winder","year":"1965","unstructured":"Winder, R. O. (1965). Enumeration of seven-argument threshold functions. IEEE Transactions on Electronic Computers, 14, 315\u2013325.","journal-title":"IEEE Transactions on Electronic Computers"}],"updated-by":[{"DOI":"10.1007\/s10479-018-2893-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T00:00:00Z","timestamp":1527724800000}}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1108-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1108-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1108-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T03:55:15Z","timestamp":1561434915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1108-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,10]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1108"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1108-3","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10479-018-2893-0","asserted-by":"object"}]},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,10]]}}}