The kernel is in the least core for permutation games

详细信息    查看全文

• 作者：Tamás Solymosi
• 关键词：Permutation game ; Least core ; Kernel ; Primary 91A12 ; Secondary 91A40
• 刊名：Central European Journal of Operations Research
• 出版年：2015
• 出版时间：December 2015
• 年：2015
• 卷：23
• 期：4
• 页码：795-809
• 全文大小：693 KB
• 参考文献：Curiel IJ, Tijs SH (1986) Assignment games and permutation games. Methods Oper Res 54:323-34MATH MathSciNet
  Davis M, Maschler M (1965) The kernel of a cooperative game. Naval Res Logist Q 12:223-59MATH MathSciNet CrossRef
  Davis M, Maschler M (1967) Existence of stable payoff configurations for cooperative games. In: Shubik M (ed) Essays in mathematical economics in honour of Oskar Morgenstern. Princeton University Press, Princeton, pp 39-2
  Driessen TSH (1998) A note on the inclusion of the kernel in the core of bilateral assignment game. Int J Game Theory 27:301-03MATH MathSciNet CrossRef
  Granot D (1994) On a new bargaining set for cooperative games. Working paper, Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, Canada
  Granot D (2010) The reactive bargaining set for cooperative games. Int J Game Theory 39:163-70MATH MathSciNet CrossRef
  Granot D, Granot F (1992) On some network flow games. Math Oper Res 17:792-41MATH MathSciNet CrossRef
  Maschler M, Peleg B, Shapley LS (1972) The kernel and bargaining set for convex games. Int J Game Theory 1:73-3MathSciNet CrossRef
  Maschler M, Peleg B, Shapley LS (1979) Geometric properties of the kernel, nucleolus and related solution concepts. Math Oper Res 4:303-38MATH MathSciNet CrossRef
  Meinhardt HI (2014) The pre-kernel as a tractable solution for cooperative games: an exercise in algorithmic game theory. Theory and decision library C, vol 45. Springer, Berlin
  Peleg B (1966) The kernel of the general-sum four-person game. Can J Math 18:673-77MATH MathSciNet CrossRef
  Peleg B, Sudh?lter P (2003) Introduction to the theory of cooperative games. Kluwer, BostonCrossRef
  Quint T (1996) On one-sided versus two-sided matching games. Games Econ Behav 16:124-34MATH MathSciNet CrossRef
  Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17:1163-170MATH MathSciNet CrossRef
  Shapley LS (1967) On balanced sets and cores. Naval Res Logist Q 14:453-60CrossRef
  Shapley LS, Shubik M (1972) The assignment game I: the core. Int J Game Theory 1:111-30MathSciNet CrossRef
  Solymosi T (2002) The bargaining set of four-person balanced games. Int J Game Theory 31:1-1MATH MathSciNet CrossRef
  Solymosi T, Raghavan TES, Tijs S (2003) Bargaining sets and the core in permutation games. Central Eur J Oper Res 11:93-01MathSciNet
  Solymosi T, Raghavan TES, Tijs S (2005) Computing the nucleolus of cyclic permutation games. Eur J Oper Res 162:270-80MATH MathSciNet CrossRef
  Tijs SH, Parthasarathy T, Potters JAM, Rajendra Prasad V (1984) Permutation games: another class of totally balanced games. OR Spektrum 6:119-23
  
• 作者单位：Tamás Solymosi (1) (2)
  
  1. Department of Operations Research and Actuarial Sciences, Corvinus University of Budapest, Pf. 489, 1828?, Budapest, Hungary
  2. ‘Momentum-Game Theory Research Group, Institute of Economics, Research Center for Economic and Regional Studies, Hungarian Academy of Sciences, Buda?rsi út 45, 1112?, Budapest, Hungary
  
• 刊物主题：Operations Research/Decision Theory;
• 出版者：Springer Berlin Heidelberg
• ISSN：1613-9178

文摘

Permutation games are totally balanced transferable utility cooperative games arising from certain sequencing and re-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is a subset of the core. We prove that for permutation games the kernel is contained in the least core, even if the latter is a lower dimensional subset of the core. By means of a 5-player permutation game we demonstrate that, in sense of the lexicographic center procedure leading to the nucleolus, this inclusion result can not be strengthened. Our 5-player permutation game is also an example (of minimum size) for a game with a non-convex kernel. Keywords Permutation game Least core Kernel