{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:44:07Z","timestamp":1740109447810,"version":"3.37.3"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-31-00055"],"award-info":[{"award-number":["18-31-00055"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Basic Research Program of the National Research University Higher School of Economics"},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["17-11-01079"],"award-info":[{"award-number":["17-11-01079"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shandong Province \u201cDouble-Hundred Talent Plan\u201d","award":["WST2017009"],"award-info":[{"award-number":["WST2017009"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Game Theory"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00182-019-00681-5","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T03:19:33Z","timestamp":1557803973000},"page":"119-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tournament solutions based on cooperative game theory"],"prefix":"10.1007","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8424-8198","authenticated-orcid":false,"given":"Aleksei Y.","family":"Kondratev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2262-2620","authenticated-orcid":false,"given":"Vladimir V.","family":"Mazalov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"key":"681_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3448-4","volume-title":"Effectivity functions in social choice","author":"J Abdou","year":"1991","unstructured":"Abdou J, Keiding H (1991) Effectivity functions in social choice. Kluwer Academic Publishers, Dordrecht"},{"key":"681_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-35929-3_12","volume-title":"Power, voting, and voting power: 30 years after","author":"JM Alonso-Meijide","year":"2013","unstructured":"Alonso-Meijide JM, Casas-M\u00e9ndez B, Fiestras-Janeiro MG (2013) A review of some recent results on power indices. In: Holler MJ, Nurmi H (eds) Power, voting, and voting power: 30 years after. Springer, Berlin, Heidelberg, pp 231\u2013245"},{"doi-asserted-by":"crossref","unstructured":"Altman A, Tennenholtz M (2005) Ranking systems: the pagerank axioms. In: 6th ACM Conference on Electronic Commerce. ACM, New York, pp 1\u20138","key":"681_CR3","DOI":"10.1145\/1064009.1064010"},{"unstructured":"Altman A, Procaccia AD, Tennenholtz M (2009) Nonmanipulable selections from a tournament. In: 21st international joint conference on artifical intelligence, Morgan Kaufmann Publishers Inc., San Francisco, pp 27\u201332","key":"681_CR4"},{"issue":"1","key":"681_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00186-011-0378-x","volume":"75","author":"R Amer","year":"2012","unstructured":"Amer R, Gim\u00e9nez JM, Maga\u00f1a A (2012) Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games. Math Methods Oper Res 75(1):105\u2013134","journal-title":"Math Methods Oper Res"},{"issue":"4","key":"681_CR6","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1007\/s00355-011-0561-2","volume":"39","author":"V Anesi","year":"2012","unstructured":"Anesi V (2012) A new old solution for weak tournaments. Soc Choice Welf 39(4):919\u2013930","journal-title":"Soc Choice Welf"},{"issue":"2","key":"681_CR7","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 AD, Rosenschein JS, Saberi A (2010) Approximating power indices: theoretical and empirical analysis. Auton Agents Multi Agent Syst 20(2):105\u2013122","journal-title":"Auton Agents Multi Agent Syst"},{"issue":"4","key":"681_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF00649265","volume":"1","author":"JS Banks","year":"1985","unstructured":"Banks JS (1985) Sophisticated voting outcomes and agenda control. Soc Choice Welf 1(4):295\u2013306","journal-title":"Soc Choice Welf"},{"key":"681_CR9","first-page":"317","volume":"19","author":"JF Banzhaf III","year":"1965","unstructured":"Banzhaf JF III (1965) Weighted voting doesn\u2019t work: a mathematical analysis. Rutgers L Rev 19:317\u2013343","journal-title":"Rutgers L Rev"},{"issue":"2","key":"681_CR10","doi-asserted-by":"publisher","first-page":"1340,004","DOI":"10.1142\/S0219198913400045","volume":"15","author":"C Bertini","year":"2013","unstructured":"Bertini C, Freixas J, Gambarelli G, Stach I (2013) Comparing power indices. Int Game Theory Rev 15(2):1340,004","journal-title":"Int Game Theory Rev"},{"issue":"1","key":"681_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1162\/003355397555136","volume":"112","author":"T Besley","year":"1997","unstructured":"Besley T, Coate S (1997) An economic model of representative democracy. Q J Econ 112(1):85\u2013114","journal-title":"Q J Econ"},{"issue":"1","key":"681_CR12","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/0022-0531(83)90024-8","volume":"31","author":"G Bordes","year":"1983","unstructured":"Bordes G (1983) On the possibility of reasonable consistent majoritarian choice: some positive results. J Econ Theory 31(1):122\u2013132","journal-title":"J Econ Theory"},{"issue":"4","key":"681_CR13","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/j.jet.2011.05.004","volume":"146","author":"F Brandt","year":"2011","unstructured":"Brandt F (2011) Minimal stable sets in tournaments. J Econ Theory 146(4):1481\u20131499","journal-title":"J Econ Theory"},{"key":"681_CR14","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-540-77105-0_30","volume-title":"Internet and network economics","author":"F Brandt","year":"2007","unstructured":"Brandt F, Fischer F (2007) Pagerank as a weak tournament solution. In: Deng X, Graham FC (eds) Internet and network economics. Springer, Berlin, Heidelberg, pp 300\u2013305"},{"issue":"3","key":"681_CR15","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s00355-011-0638-y","volume":"40","author":"F Brandt","year":"2013","unstructured":"Brandt F, Chudnovsky M, Kim I, Liu G, Norin S, Scott A, Seymour P, Thomass\u00e9 S (2013) A counterexample to a conjecture of Schwartz. Soc Choice Welf 40(3):739\u2013743","journal-title":"Soc Choice Welf"},{"key":"681_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/CBO9781107446984.004","volume-title":"Handbook of computational social choice","author":"F Brandt","year":"2016","unstructured":"Brandt F, Brill M, Harrenstein P (2016a) Tournament solutions. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of computational social choice. Cambridge University Press, New York, pp 57\u201384"},{"issue":"1","key":"681_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s00355-015-0904-5","volume":"46","author":"F Brandt","year":"2016","unstructured":"Brandt F, Geist C, Harrenstein P (2016b) A note on the McKelvey uncovered set and pareto optimality. Soc Choice Welf 46(1):81\u201391","journal-title":"Soc Choice Welf"},{"key":"681_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.mathsocsci.2016.12.007","volume":"87","author":"F Brandt","year":"2017","unstructured":"Brandt F, Harrenstein P, Seedig HG (2017) Minimal extending sets in tournaments. Math Soc Sci 87:55\u201363","journal-title":"Math Soc Sci"},{"issue":"2","key":"681_CR19","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00453-010-9395-z","volume":"61","author":"X Chen","year":"2011","unstructured":"Chen X, Deng X, Liu BJ (2011) On incentive compatible competitive selection protocols. Algorithmica 61(2):447\u2013462","journal-title":"Algorithmica"},{"issue":"3","key":"681_CR20","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00355-012-0696-9","volume":"41","author":"J Duggan","year":"2013","unstructured":"Duggan J (2013) Uncovered sets. Soc Choice Welf 41(3):489\u2013535","journal-title":"Soc Choice Welf"},{"issue":"1","key":"681_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(88)90096-8","volume":"44","author":"B Dutta","year":"1988","unstructured":"Dutta B (1988) Covering sets and a new Condorcet choice correspondence. J Econ Theory 44(1):63\u201380","journal-title":"J Econ Theory"},{"issue":"4","key":"681_CR22","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1111\/1468-0262.00228","volume":"69","author":"B Dutta","year":"2001","unstructured":"Dutta B, Jackson MO, Le Breton M (2001) Strategic candidacy and voting procedures. Econometrica 69(4):1013\u20131037","journal-title":"Econometrica"},{"issue":"3","key":"681_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1080\/0022250X.1999.9990219","volume":"23","author":"MG Everett","year":"1999","unstructured":"Everett MG, Borgatti SP (1999) The centrality of groups and classes. J Math Soc 23(3):181\u2013201","journal-title":"J Math Soc"},{"unstructured":"Faliszewski P, Gourv\u00e8s L, Lang J, Lesca J, Monnot J (2016) How hard is it for a party to nominate an election winner? In: Proceedings of the twenty-fifth international joint conference on artificial intelligence, AAAI Press, IJCAI\u201916, pp 257\u2013263","key":"681_CR24"},{"key":"681_CR25","doi-asserted-by":"crossref","DOI":"10.4337\/9781840647761","volume-title":"The measurement of voting power. Theory and practice, problems and paradoxes","author":"DS Felsenthal","year":"1998","unstructured":"Felsenthal DS, Machover M (1998) The measurement of voting power. Theory and practice, problems and paradoxes. Edward Elgar, Cheltenham"},{"issue":"3","key":"681_CR26","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"PC Fishburn","year":"1977","unstructured":"Fishburn PC (1977) Condorcet social choice functions. SIAM J Appl Math 33(3):469\u2013489","journal-title":"SIAM J Appl Math"},{"issue":"4","key":"681_CR27","doi-asserted-by":"publisher","first-page":"683","DOI":"10.2307\/2297786","volume":"51","author":"PC Fishburn","year":"1984","unstructured":"Fishburn PC (1984) Probabilistic social choice based on simple voting comparisons. Rev Econ Stud 51(4):683\u2013692","journal-title":"Rev Econ Stud"},{"issue":"2","key":"681_CR28","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190190208","volume":"19","author":"DC Fisher","year":"1995","unstructured":"Fisher DC, Ryan J (1995) Tournament games and positive tournaments. J Graph Theory 19(2):217\u2013236","journal-title":"J Graph Theory"},{"issue":"3","key":"681_CR29","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1016\/j.ejor.2007.02.045","volume":"186","author":"J Freixas","year":"2008","unstructured":"Freixas J, Pons M (2008) Circumstantial power: optimal persuadable voters. Eur J Oper Res 186(3):1114\u20131126","journal-title":"Eur J Oper Res"},{"issue":"1","key":"681_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01718625","volume":"10","author":"IJ Good","year":"1971","unstructured":"Good IJ (1971) A note on Condorcet sets. Public Choice 10(1):97\u2013101","journal-title":"Public Choice"},{"issue":"3","key":"681_CR31","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1016\/j.ejor.2014.10.037","volume":"241","author":"M Guajardo","year":"2015","unstructured":"Guajardo M, J\u00f6rnsten K (2015) Common mistakes in computing the nucleolus. Eur J Oper Res 241(3):931\u2013935","journal-title":"Eur J Oper Res"},{"issue":"3","key":"681_CR32","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.mathsocsci.2008.12.002","volume":"57","author":"O Hudry","year":"2009","unstructured":"Hudry O (2009) A survey on the complexity of tournament solutions. Math Soc Sci 57(3):292\u2013303","journal-title":"Math Soc Sci"},{"issue":"3","key":"681_CR33","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1215\/S0012-7094-58-02537-7","volume":"25","author":"JR Isbell","year":"1958","unstructured":"Isbell JR (1958) A class of simple games. Duke Math J 25(3):423\u2013439","journal-title":"Duke Math J"},{"issue":"1","key":"681_CR34","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00355-009-0387-3","volume":"34","author":"W Kirsch","year":"2010","unstructured":"Kirsch W, Langner J (2010) Power indices and minimal winning coalitions. Soc Choice Welf 34(1):33\u201346","journal-title":"Soc Choice Welf"},{"key":"681_CR35","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/978-3-319-54430-4_66","volume-title":"Intelligent information and database systems","author":"A Kondratev","year":"2017","unstructured":"Kondratev A, Mazalov V (2017) A ranking procedure with the Shapley value. In: Nguyen NT, Tojo S, Nguyen LM, Trawi\u0144ski B (eds) Intelligent information and database systems. Springer, Cham, pp 691\u2013700"},{"unstructured":"Kreweras G (1965) Aggregation of preference orderings. In: Mathematics and Social Sciences I: Proceedings of the seminars of Menthon\u2013Saint-Bernard, France (1\u201327 July 1960) and of G\u00f6sing, Austria (3\u201327 July 1962), pp 73\u201379","key":"681_CR36"},{"issue":"1","key":"681_CR37","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/game.1993.1010","volume":"5","author":"G Laffond","year":"1993","unstructured":"Laffond G, Laslier JF, Le Breton M (1993) The bipartisan set of a tournament game. Games Econ Behav 5(1):182\u2013201","journal-title":"Games Econ Behav"},{"issue":"2","key":"681_CR38","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00355-012-0685-z","volume":"41","author":"F Lange","year":"2013","unstructured":"Lange F, K\u00f3czy L\u00c1 (2013) Power indices expressed in terms of minimal winning coalitions. Social Choice Welf 41(2):281\u2013292","journal-title":"Social Choice Welf"},{"key":"681_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60805-6","volume-title":"Tournament solutions and majority voting","author":"JF Laslier","year":"1997","unstructured":"Laslier JF (1997) Tournament solutions and majority voting. Springer, Berlin"},{"key":"681_CR40","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/S1574-0005(05)80021-9","volume-title":"Handbook of game theory with economic applications","author":"M Maschler","year":"1992","unstructured":"Maschler M (1992) The bargaining set, kernel, and nucleolus. In: Aumann R, Hart S (eds) Handbook of game theory with economic applications, vol 1. Elsevier, New York, pp 591\u2013667"},{"issue":"2","key":"681_CR41","doi-asserted-by":"publisher","first-page":"289","DOI":"10.2140\/pjm.1966.18.289","volume":"18","author":"M Maschler","year":"1966","unstructured":"Maschler M, Peleg B (1966) A characterization, existence proof and dimension bounds for the kernel of a game. Pac J Math 18(2):289\u2013328","journal-title":"Pac J Math"},{"key":"681_CR42","volume-title":"Mathematical game theory and applications","author":"V Mazalov","year":"2014","unstructured":"Mazalov V (2014) Mathematical game theory and applications. Wiley, Hoboken"},{"issue":"2","key":"681_CR43","doi-asserted-by":"publisher","first-page":"283","DOI":"10.2307\/2111098","volume":"30","author":"RD McKelvey","year":"1986","unstructured":"McKelvey RD (1986) Covering, dominance, and institution-free properties of social choice. Am J Polit Sci 30(2):283\u2013314","journal-title":"Am J Polit Sci"},{"key":"681_CR44","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1613\/jair.3806","volume":"46","author":"TP Michalak","year":"2013","unstructured":"Michalak TP, Aadithya KV, Szczepanski PL, Ravindran B, Jennings NR (2013) Efficient computation of the Shapley value for game-theoretic network centrality. J Artif Intell Res 46:607\u2013650","journal-title":"J Artif Intell Res"},{"issue":"1","key":"681_CR45","doi-asserted-by":"publisher","first-page":"68","DOI":"10.2307\/2110925","volume":"24","author":"NR Miller","year":"1980","unstructured":"Miller NR (1980) A new solution set for tournaments and majority voting: further graph-theoretical approaches to the theory of voting. Am J Polit Sci 24(1):68\u201396","journal-title":"Am J Polit Sci"},{"key":"681_CR46","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-35929-3_15","volume-title":"Power, voting, and voting power: 30 years after","author":"M Montero","year":"2013","unstructured":"Montero M (2013) On the nucleolus as a power index. In: Holler MJ, Nurmi H (eds) Power, voting, and voting power: 30 years after. Springer, Berlin, Heidelberg, pp 283\u2013299"},{"issue":"1","key":"681_CR47","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2307\/2946658","volume":"111","author":"MJ Osborne","year":"1996","unstructured":"Osborne MJ, Slivinski A (1996) A model of political competition with citizen-candidates. Q J Econ 111(1):65\u201396","journal-title":"Q J Econ"},{"issue":"1","key":"681_CR48","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01770068","volume":"10","author":"B Peleg","year":"1981","unstructured":"Peleg B (1981) Coalition formation in simple games with dominant players. Int J Game Theory 10(1):11\u201333","journal-title":"Int J Game Theory"},{"issue":"1","key":"681_CR49","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/2981392","volume":"109","author":"LS Penrose","year":"1946","unstructured":"Penrose LS (1946) The elementary statistics of majority voting. J R Stat Soc 109(1):53\u201357","journal-title":"J R Stat Soc"},{"issue":"3","key":"681_CR50","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.socnet.2011.04.001","volume":"33","author":"M del Pozo","year":"2011","unstructured":"del Pozo M, Manuel C, Gonz\u00e1lez-Arang\u00fcena E, Owen G (2011) Centrality in directed social networks. a game theoretic approach. Soc Netw 33(3):191\u2013200","journal-title":"Soc Netw"},{"key":"681_CR51","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-04428-1_3","volume-title":"Algorithm Decis Theory","author":"T Russell","year":"2009","unstructured":"Russell T, Walsh T (2009) Manipulating tournaments in cup and round robin competitions. In: Rossi F, Tsoukias A (eds) Algorithm Decis Theory. Springer, Berlin, Heidelberg, pp 26\u201337"},{"issue":"6","key":"681_CR52","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17(6):1163\u20131170","journal-title":"SIAM J Appl Math"},{"issue":"2","key":"681_CR53","doi-asserted-by":"publisher","first-page":"97","DOI":"10.2307\/2216143","volume":"6","author":"T Schwartz","year":"1972","unstructured":"Schwartz T (1972) Rationality and the myth of the maximum. Nous 6(2):97\u2013117","journal-title":"Nous"},{"key":"681_CR54","first-page":"307","volume-title":"Contributions to the Theory of Games II","author":"LS Shapley","year":"1953","unstructured":"Shapley LS (1953) A value for n-person games. In: Kuhn HW, Tucker AW (eds) Contributions to the Theory of Games II. Princeton University Press, Princeton, pp 307\u2013317"},{"issue":"2","key":"681_CR55","first-page":"416","volume":"12","author":"A Subochev","year":"2018","unstructured":"Subochev A, Aleskerov F, Pislyakov V (2018) Ranking journals using social choice theory methods: a novel approach in bibliometrics. J Inf 12(2):416\u2013429","journal-title":"J Inf"},{"key":"681_CR56","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.artint.2015.11.001","volume":"231","author":"PL Szczepa\u0144ski","year":"2016","unstructured":"Szczepa\u0144ski PL, Michalak TP, Rahwan T (2016) Efficient algorithms for game-theoretic betweenness centrality. Artif Intell 231:39\u201363","journal-title":"Artif Intell"},{"unstructured":"Tarkowski MK, Michalak TP, Rahwan T, Wooldridge M (2018) Game-theoretic network centrality: a review. arXiv:180100218v1","key":"681_CR57"},{"key":"681_CR58","volume-title":"Simple games: desirability relations, trading","author":"AD Taylor","year":"1999","unstructured":"Taylor AD, Zwicker WS (1999) Simple games: desirability relations, trading. Princeton University Press, Pseudoweightings"},{"issue":"4","key":"681_CR59","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1023\/A:1024162419357","volume":"53","author":"R Van Den Brink","year":"2002","unstructured":"Van Den Brink R, Borm P (2002) Digraph competitions and cooperative games. Theory Decis 53(4):327\u2013342","journal-title":"Theory Decis"},{"issue":"2","key":"681_CR60","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0378-8733(00)00019-8","volume":"22","author":"R Van Den Brink","year":"2000","unstructured":"Van Den Brink R, Gilles RP (2000) Measuring domination in directed networks. Soc Netw 22(2):141\u2013157","journal-title":"Soc Netw"},{"issue":"2","key":"681_CR61","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00355-015-0897-0","volume":"45","author":"H Vartiainen","year":"2015","unstructured":"Vartiainen H (2015) Dynamic stable set as a tournament solution. Soc Choice Welf 45(2):309\u2013327","journal-title":"Soc Choice Welf"},{"issue":"4","key":"681_CR62","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01761605","volume":"5","author":"LA Wolsey","year":"1976","unstructured":"Wolsey LA (1976) The nucleolus and kernel for simple games or special valid inequalities for 0\u20131 linear integer programs. Int J Game Theory 5(4):227\u2013238","journal-title":"Int J Game Theory"},{"key":"681_CR63","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1017\/CBO9781107446984.003","volume-title":"Handbook of computational social choice","author":"WS Zwicker","year":"2016","unstructured":"Zwicker WS (2016) Introduction to the theory of voting. In: Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD (eds) Handbook of computational social choice. Cambridge University Press, New York, pp 23\u201356"}],"container-title":["International Journal of Game Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-019-00681-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00182-019-00681-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00182-019-00681-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T14:57:56Z","timestamp":1694876276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00182-019-00681-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["681"],"URL":"https:\/\/doi.org\/10.1007\/s00182-019-00681-5","relation":{},"ISSN":["0020-7276","1432-1270"],"issn-type":[{"type":"print","value":"0020-7276"},{"type":"electronic","value":"1432-1270"}],"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"7 May 2019","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}