Abstract
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 m ≤ n. 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Private communication with Axel Ostmann.
- 2.
This is equivalent to the assertion that the attached homomorphism that maps from the group on the symmetry group is injective.
Bibliography
Aliprantis, Ch. D., & Border, K. C. (1994). Infinite dimensional analysis: A Hitchhiker’s guide. Berlin: Springer.
Dym, H. (2007). Linear algebra in action (Graduate studies in mathematics, Vol. 78, 1st ed.). Providence: American Mathematical Society.
Hall, B. C. (2003). Lie groups, lie algebras, and representations: An elementary introduction (Volume 222 of Graduate texts in mathematics). New York: Springer.
Humphreys, J. F. (1996). A course in group theory. Oxford: Oxford University Press.
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.
Maschler, M., & Peleg, B. (1967). The structure of the Kernel of a cooperative game. SIAM Journal of Applied Mathematics, 15, 569–604.
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.
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.
Webster, R. (1994). Convexity. Oxford: Oxford University Press.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meinhardt, H.I. (2014). A Pre-Kernel Characterization and Orthogonal Projection. In: The Pre-Kernel as a Tractable Solution for Cooperative Games. Theory and Decision Library C, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39549-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-39549-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39548-2
Online ISBN: 978-3-642-39549-9
eBook Packages: Business and EconomicsEconomics and Finance (R0)