论文信息 - A unified approach to restricted games

A unified approach to restricted games

There have been two main lines in the literature on restricted games: the first line was started by Myerson (1977) that studied graph-restricted games an the second one was initiated by Faigle (1989). The present paper provides a unified way to look on the literature and establishes connections between the two different lines on restricted games. The strength and advantages of this unified approach becomes clear in the study of the inheritance of the convexity from the game to the restricted game where an interesting result by Nouweland and Borm (1991) on the convexity of graph-restricted games is turned into a direct consequence of the corresponding result by Faigle (1989), by means of this relation.

[1] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .

[2] A. Nouweland,et al. On the convexity of communication games , 1991 .

[3] Hans Reijnierse,et al. Γ-component additive games , 1995 .

[4] G. Owen. Values of graph-restricted games , 1986 .

[5] Jeroen Kuipers,et al. Combinatorial methods in cooperative game theory , 1994 .

[6] Herbert Hamers,et al. On games corresponding to sequencing situations with ready times , 1995, Math. Program..

[7] Paul H. Edelman,et al. The theory of convex geometries , 1985 .

[8] Peter Borm,et al. On the Position Value for Communication Situations , 1992, SIAM J. Discret. Math..

[9] Lloyd S. Shapley,et al. On balanced sets and cores , 1967 .

[10] J. C. Dodu,et al. Some Applications of Linear Programming Methods to the Study of Large-scale Power Systems , 1981 .

[11] Ulrich Faigle. Cores of games with restricted cooperation , 1989, ZOR Methods Model. Oper. Res..

[12] Roger B. Myerson,et al. Graphs and Cooperation in Games , 1977, Math. Oper. Res..

[13] Mamoru Kaneko,et al. Cores of partitioning games , 1982, Math. Soc. Sci..