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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
