2011•VU Research PortalOpen access

Two Values for Transferable Utility Games with Coalition and Graph Structure

René van den Brink, Gerard van der Laan, Nigel Moes

Open full text 2 citations

Abstract

In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the Myerson graph restricted game and of that the Kamijo partition restricted game. In this game the dividend of any coalition that is neither a subset of a union nor a union of unions is zero. The partition-graph restricted TU-game is obtained by taking the partition restricted game and of that the graph restricted game. In this game the dividend of any coalition that is not connected in the graph is zero. We apply the values to an economic example in which the players in a union represent the cities in a country and the graph represents a network of natural gas pipelines between the cities.

About this research paper

What this paper is about

In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the Myerson graph restricted game and of that the Kamijo partition restricted game. In this game the dividend of any coalition that is neither a subset of a union nor a union of unions is zero. The partition-graph restricted TU-game is obtained by taking the partition restricted game and of that the graph restricted game. In this game the dividend of any coalition that is not connected in the graph is zero. We apply the values to an economic example in which the players in a union represent the cities in a country and the graph represents a network of natural gas pipelines between the cities.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the Myerson graph restricted game and of that the Kamijo partition restricted game. In this game the dividend of any coalition that is neither a subset of a union nor a union of unions is zero. The partition-graph restricted TU-game is obtained by taking the partition restricted game and of that the graph restricted game. In this game the dividend of any coalition that is not connected in the graph is zero. We apply the values to an economic example in which the players in a union represent the cities in a country and the graph represents a network of natural gas pipelines between the cities.

Key concepts: Transferable utility, Mathematical economics, Graph, Mathematics, Computer science, Combinatorics, Game theory

Related papers

Back to paper searchBrowse research topicsOriginal source
Two Values for Transferable Utility Games with Coalition and Graph Structure — Research Paper | ScholarLens