论文信息 - The Marginal Operators for Games on Convex geometries

The Marginal Operators for Games on Convex geometries

In this work we study situations in which communication among the players is not complete and it is represented by a family of subsets of the set of players. Although several models of partial cooperation have been proposed, we shall follow a model derived from the work of Faigle and Kern. We define the games on convex geometries and introduce marginal worth vectors and quasi-supermodular games. Furthermore, we analyze some properties of the marginal operators on the space of games on convex geometries.

Jesús Mario Bilbao | Esperanza A. Lebrón | J. J. López | N. Jiménez

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

[2] Jean Derks. A short proof of the inclusion of the core in the Weber set , 1992 .

[3] Stef Tijs,et al. Minimarg and maximarg operators , 1991 .

[4] Robert J. Weber,et al. Probabilistic Values for Games , 1977 .

[5] Garrett Birkhoff,et al. The convexity lattice of a poset , 1985, Order.

[6] U. Faigle,et al. The Shapley value for cooperative games under precedence constraints , 1992 .

[7] Jesús Mario Bilbao,et al. The core of games on convex geometries , 1999, Eur. J. Oper. Res..

[8] Stef Tijs,et al. Cost allocation and communication , 1991 .

[9] L. Shapley. Cores of convex games , 1971 .

[10] Paul H. Edelman. A note on voting , 1997 .

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

[12] A simple procedure to compute the nucleolus of Γ-component additive games , 1995 .

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

[14] Tatsuro Ichiishi,et al. Super-modularity: Applications to convex games and to the greedy algorithm for LP , 1981 .

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

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