The average covering tree value for directed graph games
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 t...
Gespeichert in:
| Veröffentlicht in: | Journal of combinatorial optimization 2020-02, Vol.39 (2), p.315-333 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 333 |
|---|---|
| container_issue | 2 |
| container_start_page | 315 |
| container_title | Journal of combinatorial optimization |
| container_volume | 39 |
| creator | Khmelnitskaya, Anna Selçuk, Özer Talman, Dolf |
| description | 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. |
| doi_str_mv | 10.1007/s10878-019-00471-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2343275914</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2343275914</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-833e194ad770563dda0da6c195217b0c53abd28f4d17d8f53b0a292711b38f093</originalsourceid><addsrcrecordid>eNp9kLtOwzAUhi0EEqXwAkyWmA3n2HFsj6jiJlViKbPlxE6aqm2CnVbi7XEJEhvT-Yf_ovMRcotwjwDqISFopRmgYQCFQibPyAylEoxrXZ5nLTRnpQF5Sa5S2gBA1sWM6NU6UHcM0bWB1n0W3b6lYwyBHt32EGjTR-q7GOoxeNpGN6xp63YhXZOLxm1TuPm9c_Lx_LRavLLl-8vb4nHJalGKkWkhAprCeaVAlsJ7B96VNRrJUVVQS-Eqz3VTeFReN1JU4LjhCrESugEj5uRu6h1i_3kIabSb_hD3edJyUQiupMEiu_jkqmOfUgyNHWK3c_HLItgTITsRspmQ_SFkZQ6JKZSG09ch_lX_k_oGPO5nUA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2343275914</pqid></control><display><type>article</type><title>The average covering tree value for directed graph games</title><source>SpringerNature Journals</source><creator>Khmelnitskaya, Anna ; Selçuk, Özer ; Talman, Dolf</creator><creatorcontrib>Khmelnitskaya, Anna ; Selçuk, Özer ; Talman, Dolf</creatorcontrib><description>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.</description><identifier>ISSN: 1382-6905</identifier><identifier>EISSN: 1573-2886</identifier><identifier>DOI: 10.1007/s10878-019-00471-5</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Combinatorics ; Convex and Discrete Geometry ; Convexity ; Game theory ; Games ; Graph theory ; Graphical representations ; Graphs ; Mathematical Modeling and Industrial Mathematics ; Mathematics ; Mathematics and Statistics ; Operations Research/Decision Theory ; Optimization ; Theory of Computation ; Trees</subject><ispartof>Journal of combinatorial optimization, 2020-02, Vol.39 (2), p.315-333</ispartof><rights>The Author(s) 2019</rights><rights>This work is published under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-833e194ad770563dda0da6c195217b0c53abd28f4d17d8f53b0a292711b38f093</citedby><cites>FETCH-LOGICAL-c363t-833e194ad770563dda0da6c195217b0c53abd28f4d17d8f53b0a292711b38f093</cites><orcidid>0000-0003-2614-1189</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10878-019-00471-5$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10878-019-00471-5$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Khmelnitskaya, Anna</creatorcontrib><creatorcontrib>Selçuk, Özer</creatorcontrib><creatorcontrib>Talman, Dolf</creatorcontrib><title>The average covering tree value for directed graph games</title><title>Journal of combinatorial optimization</title><addtitle>J Comb Optim</addtitle><description>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.</description><subject>Combinatorics</subject><subject>Convex and Discrete Geometry</subject><subject>Convexity</subject><subject>Game theory</subject><subject>Games</subject><subject>Graph theory</subject><subject>Graphical representations</subject><subject>Graphs</subject><subject>Mathematical Modeling and Industrial Mathematics</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Theory of Computation</subject><subject>Trees</subject><issn>1382-6905</issn><issn>1573-2886</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><recordid>eNp9kLtOwzAUhi0EEqXwAkyWmA3n2HFsj6jiJlViKbPlxE6aqm2CnVbi7XEJEhvT-Yf_ovMRcotwjwDqISFopRmgYQCFQibPyAylEoxrXZ5nLTRnpQF5Sa5S2gBA1sWM6NU6UHcM0bWB1n0W3b6lYwyBHt32EGjTR-q7GOoxeNpGN6xp63YhXZOLxm1TuPm9c_Lx_LRavLLl-8vb4nHJalGKkWkhAprCeaVAlsJ7B96VNRrJUVVQS-Eqz3VTeFReN1JU4LjhCrESugEj5uRu6h1i_3kIabSb_hD3edJyUQiupMEiu_jkqmOfUgyNHWK3c_HLItgTITsRspmQ_SFkZQ6JKZSG09ch_lX_k_oGPO5nUA</recordid><startdate>20200201</startdate><enddate>20200201</enddate><creator>Khmelnitskaya, Anna</creator><creator>Selçuk, Özer</creator><creator>Talman, Dolf</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-2614-1189</orcidid></search><sort><creationdate>20200201</creationdate><title>The average covering tree value for directed graph games</title><author>Khmelnitskaya, Anna ; Selçuk, Özer ; Talman, Dolf</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-833e194ad770563dda0da6c195217b0c53abd28f4d17d8f53b0a292711b38f093</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Combinatorics</topic><topic>Convex and Discrete Geometry</topic><topic>Convexity</topic><topic>Game theory</topic><topic>Games</topic><topic>Graph theory</topic><topic>Graphical representations</topic><topic>Graphs</topic><topic>Mathematical Modeling and Industrial Mathematics</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Theory of Computation</topic><topic>Trees</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Khmelnitskaya, Anna</creatorcontrib><creatorcontrib>Selçuk, Özer</creatorcontrib><creatorcontrib>Talman, Dolf</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><jtitle>Journal of combinatorial optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Khmelnitskaya, Anna</au><au>Selçuk, Özer</au><au>Talman, Dolf</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The average covering tree value for directed graph games</atitle><jtitle>Journal of combinatorial optimization</jtitle><stitle>J Comb Optim</stitle><date>2020-02-01</date><risdate>2020</risdate><volume>39</volume><issue>2</issue><spage>315</spage><epage>333</epage><pages>315-333</pages><issn>1382-6905</issn><eissn>1573-2886</eissn><abstract>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.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10878-019-00471-5</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0003-2614-1189</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1382-6905 |
| ispartof | Journal of combinatorial optimization, 2020-02, Vol.39 (2), p.315-333 |
| issn | 1382-6905 1573-2886 |
| language | eng |
| recordid | cdi_proquest_journals_2343275914 |
| source | SpringerNature Journals |
| subjects | Combinatorics Convex and Discrete Geometry Convexity Game theory Games Graph theory Graphical representations Graphs Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Trees |
| title | The average covering tree value for directed graph games |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T01%3A18%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20average%20covering%20tree%20value%20for%20directed%20graph%20games&rft.jtitle=Journal%20of%20combinatorial%20optimization&rft.au=Khmelnitskaya,%20Anna&rft.date=2020-02-01&rft.volume=39&rft.issue=2&rft.spage=315&rft.epage=333&rft.pages=315-333&rft.issn=1382-6905&rft.eissn=1573-2886&rft_id=info:doi/10.1007/s10878-019-00471-5&rft_dat=%3Cproquest_cross%3E2343275914%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2343275914&rft_id=info:pmid/&rfr_iscdi=true |