{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:32:00Z","timestamp":1762324320899,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996592"},{"type":"electronic","value":"9783319996608"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-99660-8_7","type":"book-chapter","created":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T18:19:21Z","timestamp":1535307561000},"page":"69-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Simple Games Versus Weighted Voting Games"],"prefix":"10.1007","author":[{"given":"Frits","family":"Hof","sequence":"first","affiliation":[]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[]},{"given":"Sascha","family":"Kurz","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"key":"7_CR1","unstructured":"Pashkovich, K.: On critical threshold value for simple games. arXiv:1806.03170v2, 11 June 2018"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/net.3230190206","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19(2), 247\u2013253 (1989)","journal-title":"Networks"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0377-2217(01)00334-4","volume":"143","author":"JM Bilbao","year":"2002","unstructured":"Bilbao, J.M., Garc\u00eda, J.R.F., Jim\u00e9nez, N., L\u00f3pez, J.J.: Voting power in the European Union enlargement. Eur. J. Oper. Res. 143(1), 181\u2013196 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR4","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.: Computing solutions for matching games. Int. J. Game Theory 41, 75\u201390 (2012)","journal-title":"Int. J. Game Theory"},{"key":"7_CR5","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.: Finding small stabilizers for unstable graphs. Math. Program. 154, 173\u2013196 (2015)","journal-title":"Math. Program."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.dam.2017.11.029","volume":"237","author":"A Brandstaett","year":"2018","unstructured":"Brandstaett, A., Mosca, R.: Maximum weight independent set in $$l$$claw-free graphs in polynomial time. Discrete Appl. Math. 237, 57\u201364 (2018)","journal-title":"Discrete Appl. Math."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Chalkiadakis, G., Elkind, E., Wooldridge, M.: Computational Aspects of Cooperative Game Theory. Morgan and Claypool Publishers (2011)","DOI":"10.1007\/978-3-031-01558-8"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2004.09.038","volume":"170","author":"VG Deineko","year":"2006","unstructured":"Deineko, V.G., Woeginger, G.J.: On the dimension of simple monotonic games. Eur. J. Oper. Res. 170(1), 315\u2013318 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR9","unstructured":"Elkind, E., Chalkiadakis, G., Jennings, N.R.: Coalition structures in weighted voting games, vol. 178, pp. 393\u2013397 (2008)"},{"issue":"2","key":"7_CR10","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, L.A., Goldberg, P.W., Wooldridge, M.: On the computational complexity of weighted voting games. Ann. Math. Artif. Intell. 56(2), 109\u2013131 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR11","first-page":"195","volume":"83","author":"U Faigle","year":"1998","unstructured":"Faigle, U., Kern, W., Fekete, S., Hochstaettler, W.: The nucleon of cooperative games and an algorithm for matching games. Math. Program. 83, 195\u2013211 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"7_CR12","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.: On $$\\alpha $$-roughly weighted games. Int. J. Game Theory 43(3), 659\u2013692 (2014)","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"7_CR13","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.: On the complexity of problems on simple games. RAIRO Oper. Res. 45(4), 295\u2013314 (2011)","journal-title":"RAIRO Oper. Res."},{"issue":"2","key":"7_CR14","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, M.A.: Dimension of complete simple games with minimum. Eur. J. Oper. Res. 188(2), 555\u2013568 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"1","key":"7_CR16","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, L.A., Slinko, A.: Three hierarchies of simple games parameterized by \u201cresource\u201d parameters. Int. J. Game Theory 42(1), 1\u201317 (2013)","journal-title":"Int. J. Game Theory"},{"issue":"3","key":"7_CR17","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.: On the geometric separability of Boolean functions. Discrete Appl. Math. 66(3), 205\u2013218 (1996)","journal-title":"Discrete Appl. Math."},{"key":"7_CR18","unstructured":"Hof, F.: Weight distribution in matching games. MSc thesis, University of Twente (2016)"},{"key":"7_CR19","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.: Matching games: the least core and the nucleolus. Math. Oper. Res. 28, 294\u2013308 (2003)","journal-title":"Math. Oper. Res."},{"key":"7_CR20","unstructured":"Koenemann, J., Pashkovich, K., Toth, J.: Computing the nucleolus of weighted cooperative matching games in polynomial time arXiv:1803.03249v2, 9 March 2018"},{"key":"7_CR21","unstructured":"Kurz, S., Molinero, X., Olsen, M.: On the construction of high dimensional simple games. In: Proceedings ECAI 2016, New York, pp. 880\u2013885 (2016)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, vol. 367. American Mathematical Society (2009)","DOI":"10.1090\/chel\/367"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(85)90040-X","volume":"12","author":"UN Peled","year":"1985","unstructured":"Peled, U.N., Simeone, B.: Polynomial-time algorithms for regular set-covering and threshold synthesis. Discrete Appl. Math. 12(1), 57\u201369 (1985)","journal-title":"Discrete Appl. Math."},{"key":"7_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69291-1","volume-title":"Game Theory: A Multi-Leveled Approach","author":"H Peters","year":"2008","unstructured":"Peters, H.: Game Theory: A Multi-Leveled Approach. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69291-1"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/qmath\/7.1.183","volume":"7","author":"JR Isbell","year":"1956","unstructured":"Isbell, J.R.: A class of majority games. Q. J. Math. 7, 183\u2013187 (1956)","journal-title":"Q. J. Math."},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory, Ser. B 80(2), 346\u2013355 (2000)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T Solymosi","year":"1994","unstructured":"Solymosi, T., Raghavan, T.E.: An algorithm for finding the nucleolus of assignment games. Int. J. Game Theory 23, 119\u2013143 (1994)","journal-title":"Int. J. Game Theory"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/game.1993.1009","volume":"5","author":"AD Taylor","year":"1993","unstructured":"Taylor, A.D., Zwicker, W.S.: Weighted voting, multicameral representation, and power. Games Econ. Behav. 5, 170\u2013181 (1993)","journal-title":"Games Econ. Behav."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Taylor, A.D., Zwicker, W.S.: Simple Games: Desirability Relations, Trading, Pseudoweightings. Princeton University Press (1999)","DOI":"10.1515\/9780691223896"},{"issue":"3","key":"7_CR30","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.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505\u2013517 (1977)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99660-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:40:35Z","timestamp":1709833235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99660-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319996592","9783319996608"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99660-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 August 2018","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":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aims.sjtu.edu.cn\/SAGT_2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}