Английская Википедия:Irrigation game
Irrigation games are cooperative games which model cost sharing problems on networks (more precisely, on rooted trees). The irrigation game is a transferable utility game assigned to a cost-tree problem. A common example of this cost-tree problems are the irrigation networks. The irrigation ditch is represented by a graph, its nodes are water users, the edges are sections of the ditch. There is a cost of maintaining the ditch (each section has an own maintenance cost), and we are looking for the fair division of the costs among the users. The irrigation games are mentioned first by Aadland and Kolpin 1998, but the formal concept and the characterization of the game class is introduced by Márkus et al. 2011.
Mathematical definition
The definition of Márkus et al. 2011 is the following: A graph is a pair <math>G =(V;A )</math>, where the elements of <math>V</math> are called vertices or nodes, and <math>A</math> stands for the ordered pairs of vertices, called arcs or edges. A rooted tree is a graph in which any two vertices are connected by exactly one simple path, and one vertex has been designated the root, in which case the edges have a natural orientation, away from the root. The tree-order is the partial ordering on the vertices of a rooted tree with <math>i \leq j</math>, if the unique path from the root to <math>j</math> passes through <math>i</math>. For any <math>e \in A,</math> <math>e = \overline{ij}</math> means <math>e</math> is an edge between vertices <math>i; j \in V</math> such that <math>i \leq j</math>.
Let <math>c : A \rightarrow \mathbb{R}_+</math>. Then <math>c</math> and <math>(G; c</math>) are called cost function and cost-tree respectively: for any <math>e \in A,</math> <math>e = \overline{ij},</math> <math>c_e</math> is the cost of joining player <math>j</math> to player <math>i</math>.
Assume that the cost-tree problems have fixed, at least two, number of players (<math>\# V \geq 3, \# N\geq 2</math>). Let <math>(G; c)</math> be a cost-tree, and <math>N</math> be the set of the players (the vertices but the root). Consider an <math>S\subseteq N</math> non-empty coalition, then the cost of connecting the players of <math>S</math> to the root is given by the cost of the minimal rooted tree which covers coalition <math>S</math>. By this method for each cost-tree we can define a game, called irrigation game. Formally:
Definition (Irrigation game): For any cost-tree <math>(G; c)</math>, let <math>N=V\setminus\{root\}</math> be the player set, and for any coalition <math>S</math> (the empty sum is 0) let
Example
Файл:Example of irrigation game.png
The above graph represents a simple irrigation game played by three players. <math>G=(V,A)</math> is as follows: <math>V=\{root,1,2,3\}, A=\{\overline{root1},\overline{root2}, \overline{23}\}</math>, and the cost function <math>c</math> is defined as <math>c(\overline{root1})=11,\ \ c(\overline{root2})=5</math> and <math>c(\overline{23})=7</math>.
Then the irrigation game is the following: <math>v_{(G; c)}(\emptyset)=0</math>, <math>v_{(G; c)}(\{1\})=11</math>, <math>v_{(G; c)}(\{2\})=5</math>, <math>v_{(G; c)}(\{3\})=7</math>, <math>v_{(G; c)}(\{1,2\})=16</math>, <math>v_{(G; c)}(\{1,3\})=23</math>, <math>v_{(G; c)}(\{2,3\})=12</math>, <math>v_{(G; c)}(\{1,2,3\})=23.</math>
Properties and Results
Márkus et al. 2011 reported several important properties of the class of the irrigation games. First, the well-known class of the airport games is a proper subset of the class of irrigation games, since the airport games are defined on special rooted trees, on chains (see: Airport problem). Second, the class of irrigation games is a non-convex cone which is a proper subset of the finite convex cone spanned by the duals of the unanimity games, therefore every irrigation game is concave.
Márkus et al. 2011 also extended the Shapley and Young axiomatizations of the Shapley value to the class of irrigation games and showed that the Shapley value of an irrigation game is always in the core of the game.
References
