Matches in SemOpenAlex for { <https://semopenalex.org/work/W1569625151> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W1569625151 abstract "Abstract: A new solution is presented for transferable utility games with graph communication where the cooperation possibilities are represented by a graph. Players are only able to cooperate and obtain some worth in a coalition if they form a connected set in the given graph. To determine the payoff for each player, a single-valued solution, the communication tree value, is proposed for this class of games. The idea is that to form the grand coalition of all players a player can join a set of players only if this player is connected in the graph to at least one of the players in the set. To a set of players, starting with an arbitrary single player, from each maximally connected subset of remaining players one player joins who is connected to one or more of the players in that set. In this way a (rooted) tree on the set of players is obtained, called a communication tree. For a given game each communication tree of the graph induces a marginal contribution vector, in which any player receives a payoff equal to what he contributes in worth when he joins his subordinates in the tree. The average payoff over all communication trees of the graph determines the value. In case the underlying graph is cycle-complete the value coincides with the average tree solution. When there is complete communication between all players, which is the special case of cycle-completeness, players join one by one, yielding the Shapley value. A weak form of convexity is introduced, under which the value is guaranteed to be an element of the core. For games with complete graph communication the condition coincides with convexity and in case the underlying graph is cycle-free it is weaker than super-additivity." @default.
- W1569625151 created "2016-06-24" @default.
- W1569625151 creator A5013511581 @default.
- W1569625151 creator A5028720979 @default.
- W1569625151 date "2012-01-01" @default.
- W1569625151 modified "2023-09-28" @default.
- W1569625151 title "The Communication Tree Value for TU-Games with Graph Communication" @default.
- W1569625151 cites W2147640380 @default.
- W1569625151 cites W3125771792 @default.
- W1569625151 cites W2133285317 @default.
- W1569625151 doi "https://doi.org/10.2139/ssrn.2183065" @default.
- W1569625151 hasPublicationYear "2012" @default.
- W1569625151 type Work @default.
- W1569625151 sameAs 1569625151 @default.
- W1569625151 citedByCount "0" @default.
- W1569625151 crossrefType "journal-article" @default.
- W1569625151 hasAuthorship W1569625151A5013511581 @default.
- W1569625151 hasAuthorship W1569625151A5028720979 @default.
- W1569625151 hasBestOaLocation W15696251512 @default.
- W1569625151 hasConcept C113174947 @default.
- W1569625151 hasConcept C114614502 @default.
- W1569625151 hasConcept C118615104 @default.
- W1569625151 hasConcept C132525143 @default.
- W1569625151 hasConcept C144237770 @default.
- W1569625151 hasConcept C177142836 @default.
- W1569625151 hasConcept C199022921 @default.
- W1569625151 hasConcept C199360897 @default.
- W1569625151 hasConcept C202556891 @default.
- W1569625151 hasConcept C22171661 @default.
- W1569625151 hasConcept C2778692605 @default.
- W1569625151 hasConcept C33923547 @default.
- W1569625151 hasConcept C41008148 @default.
- W1569625151 hasConcept C80444323 @default.
- W1569625151 hasConcept C95815963 @default.
- W1569625151 hasConceptScore W1569625151C113174947 @default.
- W1569625151 hasConceptScore W1569625151C114614502 @default.
- W1569625151 hasConceptScore W1569625151C118615104 @default.
- W1569625151 hasConceptScore W1569625151C132525143 @default.
- W1569625151 hasConceptScore W1569625151C144237770 @default.
- W1569625151 hasConceptScore W1569625151C177142836 @default.
- W1569625151 hasConceptScore W1569625151C199022921 @default.
- W1569625151 hasConceptScore W1569625151C199360897 @default.
- W1569625151 hasConceptScore W1569625151C202556891 @default.
- W1569625151 hasConceptScore W1569625151C22171661 @default.
- W1569625151 hasConceptScore W1569625151C2778692605 @default.
- W1569625151 hasConceptScore W1569625151C33923547 @default.
- W1569625151 hasConceptScore W1569625151C41008148 @default.
- W1569625151 hasConceptScore W1569625151C80444323 @default.
- W1569625151 hasConceptScore W1569625151C95815963 @default.
- W1569625151 hasLocation W15696251511 @default.
- W1569625151 hasLocation W15696251512 @default.
- W1569625151 hasLocation W15696251513 @default.
- W1569625151 hasOpenAccess W1569625151 @default.
- W1569625151 hasPrimaryLocation W15696251511 @default.
- W1569625151 hasRelatedWork W1535974208 @default.
- W1569625151 hasRelatedWork W1577810998 @default.
- W1569625151 hasRelatedWork W2007806054 @default.
- W1569625151 hasRelatedWork W2022012821 @default.
- W1569625151 hasRelatedWork W2022930128 @default.
- W1569625151 hasRelatedWork W2038913457 @default.
- W1569625151 hasRelatedWork W2125447683 @default.
- W1569625151 hasRelatedWork W2212971205 @default.
- W1569625151 hasRelatedWork W2242822246 @default.
- W1569625151 hasRelatedWork W2272304366 @default.
- W1569625151 hasRelatedWork W2513087425 @default.
- W1569625151 hasRelatedWork W2950947863 @default.
- W1569625151 hasRelatedWork W2970019760 @default.
- W1569625151 hasRelatedWork W2997473097 @default.
- W1569625151 hasRelatedWork W3093328643 @default.
- W1569625151 hasRelatedWork W3146317073 @default.
- W1569625151 hasRelatedWork W3151669630 @default.
- W1569625151 hasRelatedWork W852087202 @default.
- W1569625151 hasRelatedWork W2168690006 @default.
- W1569625151 hasRelatedWork W2338469562 @default.
- W1569625151 isParatext "false" @default.
- W1569625151 isRetracted "false" @default.
- W1569625151 magId "1569625151" @default.
- W1569625151 workType "article" @default.