Meinhardt, Holger Ingmar (2014): A Note on the Computation of the Pre-Kernel for Permutation Games.
Preview |
PDF
MPRA_paper_59365.pdf Download (319kB) | Preview |
Abstract
To determine correctly a non-convex pre-kernel for TU games with more than 4 players can be a challenge full of possible pitfalls, even to the experienced researcher. Parts of the pre-kernel can be easily overlooked. In this note we discuss a method to present the full shape of the pre-kernel for a permutation game as discussed by Solymosi (2014). By using the property in which the pre-kernel is located in the least core for permutation games, the least core can be covered by a small collection of payoff equivalence classes as identified by Meinhardt (2013d) to finally establish the correct shape of the pre-kernel.
Item Type: | MPRA Paper |
---|---|
Original Title: | A Note on the Computation of the Pre-Kernel for Permutation Games |
Language: | English |
Keywords: | Transferable Utility Game: Non-Convex Pre-Kernel: Pre-Kernel Catcher: Convex Analysis: Fenchel-Moreau Conjugation: Indirect Function |
Subjects: | C - Mathematical and Quantitative Methods > C6 - Mathematical Methods ; Programming Models ; Mathematical and Simulation Modeling > C63 - Computational Techniques ; Simulation Modeling C - Mathematical and Quantitative Methods > C7 - Game Theory and Bargaining Theory > C71 - Cooperative Games D - Microeconomics > D6 - Welfare Economics > D63 - Equity, Justice, Inequality, and Other Normative Criteria and Measurement D - Microeconomics > D7 - Analysis of Collective Decision-Making > D74 - Conflict ; Conflict Resolution ; Alliances ; Revolutions |
Item ID: | 59365 |
Depositing User: | Dr. Holger Ingmar Meinhardt |
Date Deposited: | 18 Oct 2014 14:20 |
Last Modified: | 28 Sep 2019 04:43 |
References: | Ch. Chang and T. S. H. Driessen. (Pre)Kernel Catchers for Cooperative Games. OR Spectrum, 17(1):pp 23–26, 1995. Ch. Chang and Ch. Y. Kan. The Bound of the Kernel. Mathematical Social Sciences, 25:87–93, 1992. Ch. Chang and Ch.-H. Lian. Some Results on (Pre)Kernel Catchers and the Coincidence of the Kernel and Prekernel. International Game Theory Review, 4(3):201–211, 2002. Y. Funaki. Upper and Lower Bounds of the Kernel and Nucleolus. International Journal of Game Theory, 15:121–129, 1986. A Kopelowitz. 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. mimeo. J-E. Martinez-Legaz. Dual Representation of Cooperative Games based on Fenchel-Moreau Conjugation. Optimization, 36: 291–319, 1996. M. Maschler, B. Peleg, and L. S. Shapley. Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts. Mathematics of Operations Research, 4:303–338, 1979. H. I. Meinhardt. Graphical Extensions of the Mathematica Package TuGames. Technical report, Karlsruhe Institute of Technology (KIT), 2005. URL http://library.wolfram.com/infocenter/Courseware/5709/TuGamesView3D. pdf. H. I. Meinhardt. TuGames: A Mathematica Package for Cooperative Game Theory. Version 2.2, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany, 2013a. URL http://library.wolfram.com/infocenter/MathSource/5709. H. I. Meinhardt. MatTuGames: A Matlab Toolbox for Cooperative Game Theory. Version 0.4, Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany, 2013b. URL http://www.mathworks.com/matlabcentral/fileexchange/ 35933-mattugames. H. I. Meinhardt. The Matlab Game Theory Toolbox MatTuGames Version 0.4: An Introduction, Basics, and Examples. Technical report, Karlsruhe Institute of Technology (KIT), 2013c. H. I. Meinhardt. The Pre-Kernel as a Tractable Solution for Cooperative Games: An Exercise in Algorithmic Game Theory, volume 45 of Theory and Decision Library: Series C. Springer Publisher, Heidelberg/Berlin, 2013d. H. I. Meinhardt. On the Single-Valuedness of the Pre-Kernel. Technical Report MPRA-56074, Karlsruhe Institute of Technology (KIT), May 2014. URL http://mpra.ub.uni-muenchen.de/56074/. A. Meseguer-Artola. Using the Indirect Function to characterize the Kernel of a TU-Game. Technical report, Departament d’Economia i d’Historia Economica, Universitat Autonoma de Barcelona, Nov. 1997. mimeo. T. Solymosi. The kernel is in the least core for permutation games. Central European Journal of Operations Research, pages 1–15, March 2014. ISSN 1435-246X. doi: 10.1007/s10100-014-0342-y. URL http://dx.doi.org/10.1007/ s10100-014-0342-y. R.E. Stearns. Convergent Transfer Schemes for N-Person Games. Transaction American Mathematical Society, 134:449–459, 1968. |
URI: | https://mpra.ub.uni-muenchen.de/id/eprint/59365 |