{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:58Z","timestamp":1740122398171,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-01-00780"],"award-info":[{"award-number":["18-01-00780"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n<jats:p>We introduce a single-valued solution concept, the so-called average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to all covering trees of the directed graph. The covering trees of a directed graph are those (rooted) trees on the set of players that preserve the dominance relations between the players prescribed by the directed graph. The average covering tree value is component efficient, and under a particular convexity-type condition it is stable. For transferable utility games with complete communication structure the average covering tree value equals to the Shapley value of the game. If the graph is the directed analog of an undirected graph the average covering tree value coincides with the gravity center solution.\n<\/jats:p>","DOI":"10.1007\/s10878-019-00471-5","type":"journal-article","created":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T07:46:13Z","timestamp":1572507973000},"page":"315-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The average covering tree value for directed graph games"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2614-1189","authenticated-orcid":false,"given":"Anna","family":"Khmelnitskaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00d6zer","family":"Sel\u00e7uk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dolf","family":"Talman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,30]]},"reference":[{"key":"471_CR1","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1086\/421171","volume":"112","author":"G Demange","year":"2004","unstructured":"Demange G (2004) On group stability in hierarchies and connected coalitions. J Polit Econ 112:754\u2013778","journal-title":"J Polit Econ"},{"key":"471_CR2","volume-title":"Graph theory","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory. Springer, Berlin"},{"key":"471_CR3","unstructured":"Gillies DB (1953) Some theorems on $n$-Person games. Ph.D.\u00a0thesis, Princeton University, Princeton"},{"key":"471_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.geb.2007.03.007","volume":"62","author":"PJJ Herings","year":"2008","unstructured":"Herings PJJ, van der Laan G, Talman AJJ (2008) The average tree solution for cycle-free graph games. Games Econ Behav 62:77\u201392","journal-title":"Games Econ Behav"},{"key":"471_CR5","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1016\/j.geb.2009.10.002","volume":"68","author":"PJJ Herings","year":"2010","unstructured":"Herings PJJ, van der Laan G, Talman AJJ, Yang Z (2010) The average tree solution for cooperative games with communication structure. Games Econ Behav 68:626\u2013633","journal-title":"Games Econ Behav"},{"key":"471_CR6","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s11238-009-9141-7","volume":"69","author":"AB Khmelnitskaya","year":"2010","unstructured":"Khmelnitskaya AB (2010) Values for rooted-tree and sink-tree digraph games and sharing a river. Theory Decision 69:657\u2013669","journal-title":"Theory Decision"},{"key":"471_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.ejor.2013.10.014","volume":"235","author":"AB Khmelnitskaya","year":"2014","unstructured":"Khmelnitskaya AB, Talman AJJ (2014) Tree, web and average web values for cycle-free directed graph games. Eur J Oper Res 235:233\u2013246","journal-title":"Eur J Oper Res"},{"key":"471_CR8","doi-asserted-by":"crossref","unstructured":"Khmelnitskaya AB, Sel\u00e7uk \u00d6, Talman AJJ (2014) The Shapley value for directed graph games. CentER Discussion Paper 2014\u2013064. CentER, Tilburg University, Tilburg","DOI":"10.2139\/ssrn.2513257"},{"key":"471_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.mathsocsci.2013.12.004","volume":"68","author":"GA Koshevoy","year":"2014","unstructured":"Koshevoy GA, Talman AJJ (2014) Solution concepts for games with general coalitional structure. Math Soc Sci 68:19\u201330","journal-title":"Math Soc Sci"},{"key":"471_CR10","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s00182-010-0264-4","volume":"40","author":"L Li","year":"2011","unstructured":"Li L, Li X (2011) The covering values for acyclic digraph games. Int J Game Theory 40:697\u2013718","journal-title":"Int J Game Theory"},{"key":"471_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/moor.2.3.225","volume":"2","author":"RB Myerson","year":"1977","unstructured":"Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2:225\u2013229","journal-title":"Math Oper Res"},{"key":"471_CR12","first-page":"307","volume-title":"Contributions to the theory of games II","author":"L Shapley","year":"1953","unstructured":"Shapley L (1953) A value for $n$-preson games. In: Kuhn HW, Tucker AW (eds) Contributions to the theory of games II. Princeton University Press, Princeton, pp 307\u2013317"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00471-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00471-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00471-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T00:14:16Z","timestamp":1603930456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00471-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,30]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00471-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2019,10,30]]},"assertion":[{"value":"30 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}