A Pre-Kernel Characterization and Orthogonal Projection

  • Holger Ingmar Meinhardt
Part of the Theory and Decision Library C book series (TDLC, volume 45)


We have established that a quadratic and convex function can be attained from each payoff equivalence class. After that, we proved that the objective function, from which a pre-kernel element can be pursued, is composed of a finite collection of quadratic and convex functions. In addition, from each payoff equivalence class a linear transformation can be derived that maps payoff vectors into the space of unbalanced excess configurations. The resultant column vectors of the linear mapping constitutes a spanning system of a vector space of balanced excesses. Similar to payoff vectors, any vector of unbalanced excesses is mapped by an orthogonal projection on a m-dimensional flat of balanced excesses, whereas mn. Moreover, each payoff set determines the dimension and location of a particularly balanced excess flat in the vector space of unbalanced excesses. Since, a spanning system or basis of a flat is not unique, we can derive a set of transition matrices where each transition matrix constitutes a change of basis. This basis change has a natural interpretation, which transforms a bargaining situation into another equivalent bargaining situation. It is established that the transition matrices belong to the positive general linear group \({\text{GL}}^{+}(m; \mathbb{R})\). As a consequence, a group action can be identified on the set of all ordered bases of a flat of balanced excesses. Any induced payoff equivalence class of a TU game can be associated with a specific basis or bargaining situation. Finally, a first pre-kernel result with regard to the orthogonal projection method is given.


  1. Aliprantis, Ch. D., & Border, K. C. (1994). Infinite dimensional analysis: A Hitchhiker’s guide. Berlin: Springer.CrossRefGoogle Scholar
  2. Dym, H. (2007). Linear algebra in action (Graduate studies in mathematics, Vol. 78, 1st ed.). Providence: American Mathematical Society.Google Scholar
  3. Hall, B. C. (2003). Lie groups, lie algebras, and representations: An elementary introduction (Volume 222 of Graduate texts in mathematics). New York: Springer.Google Scholar
  4. Humphreys, J. F. (1996). A course in group theory. Oxford: Oxford University Press.Google Scholar
  5. Maschler, M., & Peleg, B. (1966). A characterization, existence proof and dimension bounds for the Kernel of a game. Pacific Journal of Mathematics, 18(2), 289–328.CrossRefGoogle Scholar
  6. Maschler, M., & Peleg, B. (1967). The structure of the Kernel of a cooperative game. SIAM Journal of Applied Mathematics, 15, 569–604.CrossRefGoogle Scholar
  7. Maschler, M., Peleg, B., & Shapley, L. S. (1979). Geometric properties of the Kernel, nucleolus, and related solution concepts. Mathematics of Operations Research, 4, 303–338.CrossRefGoogle Scholar
  8. 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, Mimeo.Google Scholar
  9. Webster, R. (1994). Convexity. Oxford: Oxford University Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Holger Ingmar Meinhardt
    • 1
  1. 1.Institute of Operations ResearchKarlsruhe Institute of Technology (KIT)KarlsruheGermany

Personalised recommendations