Automorphisms and weighted values
MetadataShow full item record
The notion of automorphism is an essential tool to capture the meaning of any mathematical structure. We apply this idea to cooperative games and obtain two interesting characterizations of the automorphisms of such a game: the one, in the complete case, as the permutations of players which preserve the (classical) Shapley value; the other, for the general case, as the permutations preserving all weighted Shapley values.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.