Abstract
Games with cooperation structure are cooperative games with a family offeasible coalitions, that describes which coalitions can negotiate in the game. We study a model ofcooperation structure and the corresponding restricted game, in which the feasible coalitions are those belonging to apartition system. First, we study a recursive procedure for computing the Hart and Mas-Colell potential of these games and we develop the relation between the dividends of Harsanyi in the restricted game and the worths in the original game. The properties ofpartition convex geometries are used to obtain formulas for theShapley andBanzhaf values of the players in the restricted game υℒ in terms of the original gamev. Finally, we consider the Owen multilinear extension for the restricted game.
Similar content being viewed by others
References
Borm P, Owen G, Tijs S (1992) The Position value for communication situations. SIAM J. Discrete Math. 5:305–320
Curiel I, Pederzoli G, Tijs S (1989) Sequencing games. European J. Oper. Res. 40:344–351
Dubey P, Shapley LS (1979) Mathematical properties of the Banzhaf power index. Math. of Oper. Res. 4:99–131
Edelman PH, Jamison RE (1985) The theory of convex geometries. Geom. Dedicata 19:247–270
Edelman PH (1997) A note on voting. To appear in Math. Social Sciences
Harsanyi JC (1963) A simplified bargaining model for then-person cooperative game. International Economic Review 4:194–220
Hart S, Mas-Colell A (1988) The potential of the Shapley value. In: Roth AE (ed.) The Shapley value, Cambridge University Press, pp. 127–137
Moulin H (1996) Incremental cost sharing; Characterization by strategyproofness. Mimeo, Duke University, Durham, NC
Myerson RB (1977) Graphs and cooperation in games. Math. of Oper. Res. 2:225–229
Myerson RB (1980) Conference structures and fair allocation rules. Intern. J. Game Theory 9:169–182
Myerson RB (1991) Game theory. Analysis of conflict. Harvard University Press
Nouweland A van den, Borm P (1991) On the convexity of communication games. Intern. J. Game Theory 19:421–430
Nouweland A van den, Borm P, Tijs S (1992) Allocation rules for hypergraph communication situations. Intern. J. Game Theory 20:255–268
Owen G (1986) Values of graph-restricted games. SIAM J. Alg. Discr. Meth. 7:210–220
Owen G (1988) Multilinear extension of games. In: Roth AE (ed.) The Shapley Value, Cambridge University Press, pp. 139–151
Potters J, Reijnierse H (1995) Γ-component additive games. Intern. J. Game Theory 24:49–56
Shapley LS (1953) A value forn-person games. In: Kuhn HW, Tucker AW (eds.) Contributions to the theory of games II, Princeton University Press, pp. 307–317
Stanley RP (1986) Enumerative combinatorics I. Wadsworth, Monterey CA
Author information
Authors and Affiliations
Additional information
The author is grateful to Paul Edelman, Ulrich Faigle and the referees for their comments and suggestions. The proof of Theorem 1 was proposed by the associate editor's referee.
Rights and permissions
About this article
Cite this article
Bilbao, JM. Values and potential of games with cooperation structure. Int J Game Theory 27, 131–145 (1998). https://doi.org/10.1007/BF01243199
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01243199