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)...
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.