{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:11Z","timestamp":1740107051367,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T00:00:00Z","timestamp":1569628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T00:00:00Z","timestamp":1569628800000},"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":["Soc Choice Welf"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s00355-019-01221-6","type":"journal-article","created":{"date-parts":[[2019,9,28]],"date-time":"2019-09-28T17:35:36Z","timestamp":1569692136000},"page":"609-621","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simple games versus weighted voting games: bounding the critical threshold value"],"prefix":"10.1007","volume":"54","author":[{"given":"Frits","family":"Hof","sequence":"first","affiliation":[]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4597-2041","authenticated-orcid":false,"given":"Sascha","family":"Kurz","sequence":"additional","affiliation":[]},{"given":"Kanstantsin","family":"Pashkovich","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5945-9287","authenticated-orcid":false,"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,28]]},"reference":[{"key":"1221_CR1","unstructured":"Abdi A (2018) Ideal clutters. Ph.D. thesis, University of Waterloo"},{"key":"1221_CR2","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00355-009-0408-2","volume":"34","author":"M Axenovich","year":"2010","unstructured":"Axenovich M, Roy S (2010) On the structure of minimal winning coalitions in simple voting games. Soc Choice Welf 34:429\u2013440","journal-title":"Soc Choice Welf"},{"key":"1221_CR3","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1613\/jair.1.11270","volume":"63","author":"Y Bachrach","year":"2018","unstructured":"Bachrach Y, Elkind E, Malizia E, Meir R, Pasechnik D, Rosenschein J, Rothe J, Zuckerman M (2018) Bounds on the cost of stabilizing a cooperative game. J Artif Intell Res 63:987\u20131023","journal-title":"J Artif Intell Res"},{"key":"1221_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230190206","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas E, Yu CS (1989) On graphs with polynomially solvable maximum-weight clique problem. Networks 19:247\u2013253","journal-title":"Networks"},{"key":"1221_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0377-2217(01)00334-4","volume":"143","author":"JM Bilbao","year":"2002","unstructured":"Bilbao JM, Garc\u00eda JRF, Jim\u00e9nez N, L\u00f3pez JJ (2002) Voting power in the European Union enlargement. Eur J Oper Res 143:181\u2013196","journal-title":"Eur J Oper Res"},{"key":"1221_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00182-011-0273-y","volume":"41","author":"P Biro","year":"2012","unstructured":"Biro P, Kern W, Paulusma D (2012) Computing solutions for matching games. Int J Game Theory 41:75\u201390","journal-title":"Int J Game Theory"},{"key":"1221_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10107-014-0854-1","volume":"154","author":"A Bock","year":"2015","unstructured":"Bock A, Chandrasekaran K, K\u00f6nemann J, Peis B, Sanit\u00e1 L (2015) Finding small stabilizers for unstable graphs. Math Program 154:173\u2013196","journal-title":"Math Program"},{"key":"1221_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-9859-3","volume-title":"Convex analysis and nonlinear optimization","author":"J Borwein","year":"2000","unstructured":"Borwein J, Lewis A (2000) Convex analysis and nonlinear optimization. Springer, Berlin"},{"key":"1221_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.dam.2017.11.029","volume":"237","author":"A Brandst\u00e4dt","year":"2018","unstructured":"Brandst\u00e4dt A, Mosca R (2018) Maximum weight independent set in $l$claw-free graphs in polynomial time. Discret Appl Math 237:57\u201364","journal-title":"Discret Appl Math"},{"key":"1221_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00355-003-0302-2","volume":"24","author":"F Carreras","year":"2005","unstructured":"Carreras F, Freixas J (2005) On power distribution in weighted voting. Soc Choice Welf 24:269\u2013282","journal-title":"Soc Choice Welf"},{"key":"1221_CR11","doi-asserted-by":"publisher","DOI":"10.2200\/S00355ED1V01Y201107AIM016","volume-title":"Computational aspects of cooperative game theory","author":"G Chalkiadakis","year":"2011","unstructured":"Chalkiadakis G, Elkind E, Wooldridge M (2011) Computational aspects of cooperative game theory. Morgan and Claypool Publishers, San Rafael"},{"key":"1221_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2004.09.038","volume":"170","author":"VG Deineko","year":"2006","unstructured":"Deineko VG, Woeginger GJ (2006) On the dimension of simple monotonic games. Eur J Oper Res 170:315\u2013318","journal-title":"Eur J Oper Res"},{"key":"1221_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J Edmonds","year":"1970","unstructured":"Edmonds J, Fulkerson D (1970) Bottleneck extrema. J Comb Theory 8:299\u2013306","journal-title":"J Comb Theory"},{"key":"1221_CR14","unstructured":"Elkind E, Chalkiadakis G, Jennings NR (2008) Coalition structures in weighted voting games. In: Proceedings of ECAI 2008, frontiers in artificial intelligence and applications, vol 178, pp 393\u2013397"},{"key":"1221_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10472-009-9162-5","volume":"56","author":"E Elkind","year":"2009","unstructured":"Elkind E, Goldberg LA, Goldberg PW, Wooldridge M (2009) On the computational complexity of weighted voting games. Ann Math Artif Intell 56:109\u2013131","journal-title":"Ann Math Artif Intell"},{"key":"1221_CR16","first-page":"195","volume":"83","author":"U Faigle","year":"1998","unstructured":"Faigle U, Kern W, Fekete S, Hochstaettler W (1998) The nucleon of cooperative games and an algorithm for matching games. Math Program 83:195\u2013211","journal-title":"Math Program"},{"key":"1221_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9896-5","volume-title":"Algorithmic principles of mathematical programming","author":"U Faigle","year":"2002","unstructured":"Faigle U, Kern W, Still G (2002) Algorithmic principles of mathematical programming. Kluwer Academic Publishers, Dordrecht"},{"key":"1221_CR18","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF00182851","volume":"13","author":"P Fishburn","year":"1996","unstructured":"Fishburn P, Brams S (1996) Minimal winning coalitions in weighted-majority voting games. Soc Choice Welf 13:397\u2013417","journal-title":"Soc Choice Welf"},{"key":"1221_CR19","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s00182-013-0402-x","volume":"43","author":"J Freixas","year":"2014","unstructured":"Freixas J, Kurz S (2014) On $\\alpha $-roughly weighted games. Int J Game Theory 43:659\u2013692","journal-title":"Int J Game Theory"},{"key":"1221_CR20","first-page":"67","volume":"3","author":"J Freixas","year":"2010","unstructured":"Freixas J, Marciniak D (2010) On the notion of dimension and codimension of simple games. Contrib Game Theory Manag 3:67\u201381","journal-title":"Contrib Game Theory Manag"},{"key":"1221_CR21","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.ejor.2007.03.050","volume":"188","author":"J Freixas","year":"2008","unstructured":"Freixas J, Puente MA (2008) Dimension of complete simple games with minimum. Eur J Oper Res 188:555\u2013568","journal-title":"Eur J Oper Res"},{"key":"1221_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1051\/ro\/2011115","volume":"45","author":"J Freixas","year":"2011","unstructured":"Freixas J, Molinero X, Olsen M, Serna M (2011) On the complexity of problems on simple games. RAIRO Oper Res 45:295\u2013314","journal-title":"RAIRO Oper Res"},{"key":"1221_CR23","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. W. H. Freeman & Co., New York"},{"key":"1221_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00182-011-0308-4","volume":"42","author":"T Gvozdeva","year":"2013","unstructured":"Gvozdeva T, Hemaspaandra LA, Slinko A (2013) Three hierarchies of simple games parameterized by \u201cresource\u201d parameters. Int J Game Theory 42:1\u201317","journal-title":"Int J Game Theory"},{"key":"1221_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0166-218X(94)00161-6","volume":"66","author":"T Heged\u00fcs","year":"1996","unstructured":"Heged\u00fcs T, Megiddo N (1996) On the geometric separability of Boolean functions. Discret Appl Math 66:205\u2013218","journal-title":"Discret Appl Math"},{"key":"1221_CR26","doi-asserted-by":"crossref","unstructured":"Hof F, Kern W, Kurz S, Paulusma D (2018) Simple games versus weighted voting games. In: Proceedings of SAGT 2018, LNCS 11059, pp 69\u201381","DOI":"10.1007\/978-3-319-99660-8_7"},{"key":"1221_CR27","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/qmath\/7.1.183","volume":"7","author":"JR Isbell","year":"1956","unstructured":"Isbell JR (1956) A class of majority games. Q J Math 7:183\u2013187","journal-title":"Q J Math"},{"key":"1221_CR28","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/moor.28.2.294.14477","volume":"28","author":"W Kern","year":"2003","unstructured":"Kern W, Paulusma D (2003) Matching games: the least core and the nucleolus. Math Oper Res 28:294\u2013308","journal-title":"Math Oper Res"},{"key":"1221_CR29","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann J, Pashkovich K, Toth J (2019) Computing the nucleolus of weighted cooperative matching games in polynomial time. In: Proceedings of IPCO 2019, LNCS 11480, pp 413\u2013426","DOI":"10.1007\/978-3-030-17953-3_31"},{"key":"1221_CR30","first-page":"880","volume":"2016","author":"S Kurz","year":"2016","unstructured":"Kurz S, Molinero X, Olsen M (2016) On the construction of high dimensional simple games. Proc ECAI 2016:880\u2013885","journal-title":"Proc ECAI"},{"key":"1221_CR31","doi-asserted-by":"crossref","unstructured":"Nguyen T, Zick Y (2018) Resource based cooperative games: optimization, fairness and stability. In: Proceedings of SAGT 2018, LNCS 11059, pp 239\u2013244","DOI":"10.1007\/978-3-319-99660-8_21"},{"key":"1221_CR32","unstructured":"Pashkovich K (2018) Computing the nucleolus of weighted voting games in pseudo-polynomial time. arXiv:181002670"},{"key":"1221_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90040-X","volume":"12","author":"UN Peled","year":"1985","unstructured":"Peled UN, Simeone B (1985) Polynomial-time algorithms for regular set-covering and threshold synthesis. Discret Appl Math 12:57\u201369","journal-title":"Discret Appl Math"},{"key":"1221_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69291-1","volume-title":"Game theory","author":"H Peters","year":"2008","unstructured":"Peters H (2008) Game theory. Springer, Berlin"},{"key":"1221_CR35","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver A (1998) Theory of linear and integer programming. Wiley, New York"},{"key":"1221_CR36","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/bs.3830070104","volume":"7","author":"LS Shapley","year":"1962","unstructured":"Shapley LS (1962) Simple games: an outline of the descriptive theory. Behav Sci 7:59\u201366","journal-title":"Behav Sci"},{"key":"1221_CR37","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T Solymosi","year":"1994","unstructured":"Solymosi T, Raghavan TE (1994) An algorithm for finding the nucleolus of assignment games. Int J Game Theory 23:119\u2013143","journal-title":"Int J Game Theory"},{"key":"1221_CR38","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/game.1993.1009","volume":"5","author":"AD Taylor","year":"1993","unstructured":"Taylor AD, Zwicker WS (1993) Weighted voting, multicameral representation, and power. Games Econ Behav 5:170\u2013181","journal-title":"Games Econ Behav"},{"key":"1221_CR39","volume-title":"Simple games: desirability relations, trading, pseudoweightings","author":"AD Taylor","year":"1999","unstructured":"Taylor AD, Zwicker WS (1999) Simple games: desirability relations, trading, pseudoweightings. Princeton University Press, Princeton"},{"key":"1221_CR40","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama S, Ide M, Ariyoshi H, Shirakawa I (1977) A new algorithm for generating all the maximal independent sets. SIAM J Comput 6:505\u2013517","journal-title":"SIAM J Comput"},{"key":"1221_CR41","volume-title":"Theory of games and economic behavior","author":"J von Neumann","year":"1944","unstructured":"von Neumann J, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, Princeton"}],"container-title":["Social Choice and Welfare"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-019-01221-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00355-019-01221-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00355-019-01221-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T23:32:04Z","timestamp":1601163124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00355-019-01221-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,28]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["1221"],"URL":"https:\/\/doi.org\/10.1007\/s00355-019-01221-6","relation":{},"ISSN":["0176-1714","1432-217X"],"issn-type":[{"type":"print","value":"0176-1714"},{"type":"electronic","value":"1432-217X"}],"subject":[],"published":{"date-parts":[[2019,9,28]]},"assertion":[{"value":"13 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}