A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure

• Arin J, Feltkamp V (1997) The nucleolus and kernel of veto-rich transferable utility games. Int J Game Theory 26: 61–73

  Article  Google Scholar 

• Arin J, Inarra E (1998) A characterization of the nucleolus for convex games. Games Econ Behav 23: 12–24

  Article  Google Scholar 

• Bondareva O (1962) The theory of the Core in an n-person game. Vestnik Leningrad Univ 13: 141–142 (in Russian)

  Google Scholar 

• Brânzei R, Fragnelli V, Tijs S (2002) Tree connected line graph peer group situations and line graph peer group games. Math Method Oper Res 55: 93–106

  Article  Google Scholar 

• Brânzei R, Solymosi T, Tijs S (2005) Strongly essential coalitions and the nucleolus of peer group games. Int J Game Theory 33: 447–460

  Article  Google Scholar 

• Brune S (1983) On the regions of linearity for the nucleolus and their computation. Int J Game Theory 12: 47–80

  Article  Google Scholar 

• Davis M, Maschler M (1965) The kernel of a cooperative game. Nav Res Logist Q 12: 223–259

  Article  Google Scholar 

• Gillies DB (1953) Some theorems on n-Person games. Princeton University Press, Princeton, NJ

  Google Scholar 

• Gilles RP, Owen G (1994) Cooperative games and disjunctive permission structures. Department of Economics, Virginia Polytechnic Institute and State University, Blacksburg, Virginia

  Google Scholar 

• Gilles RP, Owen G, van den Brink R (1992) Games with permission structures: the conjunctive approach. Int J Game Theory 20: 277–293

  Article  Google Scholar 

• Huberman G (1980) The nucleolus and essential coalitions. In: Bensoussan A, Lions J (eds) Analysis and optimization of systems. Lecture notes in control and information sciences, vol 28. Springer, Berlin, pp 416–422

  Google Scholar 

• Kohlberg E (1971) On the nucleolus of a characteristic function game. SIAM J Appl Math 20: 62–66

  Article  Google Scholar 

• Kuipers J, Solymosi T, Aarts H (2000) Computing the nucleolus of some combinatorially-structured games. Math Program 88: 541–563

  Article  Google Scholar 

• Muto S, Potters J, Tijs S (1989) Information market games. Int J Game Theory 18: 209–226

  Article  Google Scholar 

• Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2: 225–229

  Article  Google Scholar 

• Ni D, Wang Y (2007) Sharing a polluted river. Games Econ Behav 60: 176–186

  Article  Google Scholar 

• Reynierse J, Potters J (1998) The \({\mathcal{B}}\)-nucleolus of TU-games. Games Econ Behav 24: 77–96

  Article  Google Scholar 

• Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17: 1163–1170

  Article  Google Scholar 

• Shapley LS (1953) A value for N-person games. In: Kuhn HW, Tucker AW (eds) Contributions to the theory of games, vol 2. Princeton University Press, Princeton, pp 307–317

  Google Scholar 

• Shapley LS (1967) On balanced sets and cores. Nav Res Logist Q 14: 453–460

  Article  Google Scholar 

• Sobolev AI (1975) The characterization of optimality principles in cooperative games by functional equations (in Russian). In: Vorob’ev NN (eds) Mathematical methods in the social sciences, vol 6. Vilnius, USSR, pp 94–151

  Google Scholar 

• van den Brink R (1997) An axiomatization of the disjunctive permission value for games with a permission structure. Int J Game Theory 26: 27–43

  Article  Google Scholar 

• van den Brink R, Gilles RP (1996) Axiomatizations of the conjunctive permission value for games with permission structures. Games Econ Behav 12: 113–126

  Article  Google Scholar 

Download references