The Pre-Kernel as a Fair Division Rule for Some Cooperative Game Models

  • Holger I. MeinhardtEmail author
Part of the Contributions to Management Science book series (MANAGEMENT SC.)


Rather than considering fairness as some private property or a subjective feeling of an individual, we study fairness on a set of principles (axioms) which describes the pre-kernel. Apart from its appealing axiomatic foundation, the pre-kernel also qualifies in accordance with the recent findings of Meinhardt (The pre-kernel as a tractable solution for cooperative games: an exercise in algorithmic game theory. Springer, Berlin, 2013b) as an attractive fair division rule due to its ease of computation by solving iteratively systems of linear equations. To advance our understanding of compliance on non-binding agreements, we start our analysis with a Cournot situation to derive four cooperative game models well introduced in the literature, where each of it represents different aspiration levels of partners involved in a negotiation process of splitting the monopoly proceeds. In this respect, we demonstrate the bargaining difficulties that might arise when agents are not acting self-constraint, and what consequences this impose on the stability of a fair agreement.


Convex analysis Convex games Fenchel-Moreau conjugation Indirect function Pre-kernel Stable agreement 



We are very grateful to Jingang Zhao for his helpful comments and suggestions of improvements. Of course, the usual disclaimer applies.


  1. Aumann RJ (1959) Acceptable points in general cooperative n-person games. In: Tucker AW, Luce RD (eds) Contributions to the theory of games, vol IV. Princeton University Press, Princeton, pp 287–324Google Scholar
  2. Aumann RJ (1961) A survey on cooperative games without side payments. In: Shubik M (ed) Essays in mathematical economics in honor of Oskar Morgenstern. Princeton University Press, Princeton, pp 3–27Google Scholar
  3. Chang C, Hu C-C (2016) A non-cooperative interpretation of the kernel. IJGT, doi:10.1007/s00182-016-0529-7Google Scholar
  4. Curiel I (1997) Cooperative game theory and applications. Kluwer Academic Publishers, BostonCrossRefGoogle Scholar
  5. Davis M, Maschler M (1965) The kernel of a cooperative game. NRLQ 12(3/4):223–259CrossRefGoogle Scholar
  6. Driessen TSH, Meinhardt HI (2001) (Average-) convexity of common pool and oligopoly TU-games. IGTR 3(2):141–158Google Scholar
  7. Driessen TSH, Meinhardt HI (2005) Convexity of oligopoly games without transferable technologies. MSS 50(1):102–126Google Scholar
  8. Driessen TSH, Meinhardt HI (2010) On the supermodularity of homogeneous oligopoly games. IGTR 12(4):309–337Google Scholar
  9. Hart S, Kurz M (1983) Endogenous formation of coalitions. Econometrica 51(4):1047–1064CrossRefGoogle Scholar
  10. Jentzsch G (1964) Some thoughts on the theory of cooperative games. In: Dresher M, Shapley LS, Tucker AW (eds) Advances in game theory. Princeton University Press, Princeton, pp 407–442Google Scholar
  11. Kopelowitz A (1967) Computation of the kernels of simple games and the nucleolus of N-person games. Technical report, RM 31, Research Program in Game Theory and Mathematical Economics, The Hebrew University of Jerusalem, 1967. MimeoGoogle Scholar
  12. Lekeas PV (2013) Coalitional beliefs in cournot oligopoly TU games. IGTR 15(1):1–21Google Scholar
  13. Martínez-Legaz J-E (1996) Dual representation of cooperative games based on Fenchel-Moreau conjugation. Optimization 36(4):291–319CrossRefGoogle Scholar
  14. Maschler M, Peleg B, Shapley LS (1979) Geometric properties of the kernel, nucleolus, and related solution concepts. MOR 4(4):303–338CrossRefGoogle Scholar
  15. Meinhardt HI (1999a) Common pool games are convex games. JPubET 1(2):247–270Google Scholar
  16. Meinhardt HI (1999b) Convexity and k-convexity in cooperative common pool games. Discussion Paper 11, Institute for Statistics and Economic Theory, University KarlsruheGoogle Scholar
  17. Meinhardt HI (2002) Cooperative decision making in common pool situations. Springer, HeidelbergCrossRefGoogle Scholar
  18. Meinhardt HI (2013a) The Matlab game theory toolbox MatTuGames version 0.4: an introduction, basics, and examples. Technical report, Karlsruhe Institute of Technology (KIT)Google Scholar
  19. Meinhardt HI (2013b) The pre-kernel as a tractable solution for cooperative games: an exercise in algorithmic game theory. Springer, BerlinGoogle Scholar
  20. Meinhardt HI (2014) A note on the computation of the pre-kernel for permutation games. Technical Report MPRA-59365, Karlsruhe Institute of Technology (KIT).
  21. Meinhardt HI (2015a) MatTuGames: A Matlab toolbox for cooperative game theory. Karlsruhe Institute of Technology (KIT), Karlsruhe. Version 0.8Google Scholar
  22. Meinhardt HI (2015b) On the single-valuedness of the pre-kernel. ArXiv e-prints, Google Scholar
  23. Meinhardt HI (2016a) TuGames: A Mathematica package for cooperative game theory. Karlsruhe Institute of Technology (KIT). Version 2.4
  24. Meinhardt HI (2016b) TuOligopoly: A Mathematica package for industrial cooperation. Karlsruhe Institute of Technology (KIT). Version 0.1, MimeoGoogle Scholar
  25. Meseguer-Artola A (1997) Using the indirect function to characterize the kernel of a TU-game. Technical report, Departament d’Economia i d’Història Econòmica, Universitat Autònoma de Barcelona. MimeoGoogle Scholar
  26. Moulin H (1981) Deterrence and cooperation: a classification of two person games. EER 15(2):179–193Google Scholar
  27. Moulin H (1988) Axioms of cooperative decision making. Cambridge University Press, CambridgeCrossRefGoogle Scholar
  28. Norde H, Do KHP, Tijs SH (2002) Oligopoly games with and without transferable technologies. MSS 43(2):187–207Google Scholar
  29. Ostmann A (1986) Limits of rational behavior in cooperatively played normalform games. In: Tietz R, Albers W, Selten R (eds) Bounded rational behavior in experimental games and markets. Springer, Berlin, pp 317–332Google Scholar
  30. Ostmann A (1994) A note on cooperation in symmetric common dilemmas. MimeoGoogle Scholar
  31. Ostmann A, Meinhardt HI (2007) Non-binding agreements and fairness in commons dilemma games. CEJOR 15(1):63–96CrossRefGoogle Scholar
  32. Ostmann A, Meinhardt HI (2008) Toward an analysis of cooperation and fairness that includes concepts of cooperative game theory. In: Biel A, Eek D, Garling T, Gustafson M (eds) New issues and paradigms in research on social dilemmas. Springer, Berlin, pp 230–251CrossRefGoogle Scholar
  33. Peleg B, Sudhölter P (2007) Introduction to the theory of cooperative games, 2nd edn. Springer, BerlinGoogle Scholar
  34. Serrano R (1997) Reinterpretating the kernel. JET 77(1):58–80CrossRefGoogle Scholar
  35. Shapley LS (1971) Cores of convex games. IJGT 1(1):11–26Google Scholar
  36. Stearns RE (1968) Convergent transfer schemes for N-person games. Trans Am Math Soc 134(3):449–459Google Scholar
  37. Thrall RM, Lucas WF (1963) N-person games in partition function form. NRLQ 10(1):281–298CrossRefGoogle Scholar
  38. Vives X (1999) Oligopoly pricing: old ideas and new tools. MIT Press, CambridgeGoogle Scholar
  39. von Neumann JM, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, PrincetonGoogle Scholar
  40. Zhao J (1999a) A β-core existence result and its application to oligopoly markets. GEB 27(1):153–168Google Scholar
  41. Zhao J (1999b) A necessary and sufficient condition for the convexity in oligopoly games. MSS 37(2):189–204Google Scholar
  42. Zhao J (1999c) The existence of TU α-core in normal form games. IJGT 28(1):25–34Google Scholar
  43. Zhao J (2009) Estimating merging costs by merger preconditions. Theor Decis 66(4):373–399CrossRefGoogle Scholar
  44. Zhao J (2016) TU oligopoly games and industrial cooperation. In: Corchon L, Marini M (eds) Handbook of game theory and industrial organization. Edward Elgar, Cheltenham, pp 1–41Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Institute of Operations Research, Karlsruhe Institute of TechnologyKarlsruheGermany

Personalised recommendations