Two efficient values of cooperative games with graph structure based on $$\tau $$ τ -values
Guang Zhang,
Erfang Shan (),
Liying Kang and
Yanxia Dong
Additional contact information
Guang Zhang: Shanghai University
Erfang Shan: Shanghai University
Liying Kang: Shanghai University
Yanxia Dong: School of Statistics and Information, Shanghai University of International Business and Economics
Journal of Combinatorial Optimization, 2017, vol. 34, issue 2, No 12, 462-482
Abstract:
Abstract The paper is devoted to value concepts for cooperative games with a communication structure represented by a graph. Under assumptions that the players partition themselves into ‘components’ before realizing cooperation and the worth of the grand coalition not less than the sum of the worths of all components, the fair distribution of surplus solution and the two-step $$\tau $$ τ -value are introduced as two efficient values for such games, each of which is an extension of the graph $$\tau $$ τ -value. For the two efficient values, we discuss their special properties and we provide their axiomatic characterizations in views of those properties. By analysing an example applied to the two values, we conclude that the fair distribution of surplus solution allocates more surplus to the bigger coalitions and favors the powerful players, while the two-step $$\tau $$ τ -value benefits the vulnerable groups and inspires to form small coalitions.
Keywords: Graph games; $$\tau $$ τ -Values; Efficient solution; Fair distribution of surplus solution; Two-step $$\tau $$ τ -value (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0081-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:2:d:10.1007_s10878-016-0081-1
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-016-0081-1
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().