Abstract
We introduce a novel covering method to compute values for acyclic digraph games, and we call the values obtained by this method the covering values. These values may be considered as natural extensions of the component efficient solutions for line-graph games studied by van den Brink et al. (Econ Theory 33:349–364, 2007), and the tree values studied by Khmelnitskaya (Theory Decis 69(4):657–669, 2010a). With the new method, we reinterpret the tree values proposed by Khmelnitskaya (2010a). Besides, we propose the covering values in the digraph game with general acyclic digraph structures presenting flow situations when some links may merge while others split into several separate ones. We give axiomatizations of these values, and interpret these values in terms of dividend distributions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bondy JA, Murty USR (2008) Graph theory. Springer, New York
Burt RS (1992) Structural holes: the social structure of competition. Harvard University Press, Cambridge
Demange G (2004) On group stability in hierarchies and networks. J Polit Econ 112: 754–778
Faigle U, Kern W (1992) The Shapley value for cooperative games under precedence constraints. Int J Game Theory 21(3): 249–266
Gilles RP, Owen G, van den Brink R (1992) Games with permission structures: the conjunctive approach. Int J Game Theory 20(3): 277–293
Harsanyi JC (1958) A bargaining model for the cooperative n-person game. PhD thesis
Herings PJJ, van der Laan G, Talman D (2008) The average tree solution for cycle-free graph games. Games Econ Behav 62(1): 77–92
Khmelnitskaya A (2010a) Values for rooted-tree and sink-tree digraph games and sharing a river. Theory Decis 69(4): 657–669
Khmelnitskaya A (2010b) Graph-restricted games with coalition structures. In: Petrosyan LA, Zenkevich NA (eds) Contributions to game theory and management, vol III. Graduate School of Management SPbU, St. Petersburg, pp 220–246
Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2(3): 225–229 ISSN 0364765X
Shapley L (1953) A value for n-person games. In: Tucker AW, Kuhn HW (eds) Contributions to the theory of games II. Princeton University Press, Princeton, pp 307–317
van den Brink R (1997) An axiomatization of the disjunctive permission value for games with a permission structure. Int J Game Theory 26(1): 27–43
van den Brink R, van der Laan G, Vasil’ev V (2003) Harsanyi solutions in line-graph games. Tinbergen Institute Discussion Papers 03-076/1, Tinbergen Institute, Sept. 2003
van den Brink R, van der Laan G, Vasil’ev V (2007) Component efficient solutions in line-graph games with applications. Econ Theory 33: 349–364
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, L., Li, X. The covering values for acyclic digraph games. Int J Game Theory 40, 697–718 (2011). https://doi.org/10.1007/s00182-010-0264-4
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00182-010-0264-4