The kernel of the sum of two cooperative games (Q793647): Difference between revisions
From MaRDI portal
Latest revision as of 12:52, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The kernel of the sum of two cooperative games |
scientific article |
Statements
The kernel of the sum of two cooperative games (English)
0 references
1984
0 references
In this paper the kernel of a composition of two cooperative games with disjoint sets of players is described. Given two cooperative games \(G^ 1=(N^ 1,v^ 1)\) and \(G^ 2=(N^ 2,v^ 2)\) such that \(N^ 1\cap N^ 2=\emptyset\), the composition \(G^ 1\oplus G^ 2\) is defined to be the game (N,v) where \(N=N^ 1\cup N^ 2\) and \(v(S)=\max \{v^ 1(S\cap N^ 1), v^ 2(S\cap N^ 2)\}\) for all \(S\subset N\). The composition \(G^ 1\oplus G^ 2\) is called the sum of the games \(G^ 1\) and \(G^ 2\). For any game \(G=(N,v)\) and any real number c, the modified game \(G_ c=(N,v_ c)\) is given by \(v_ c(S)=\max \{v(S),c\}\) or all \(\emptyset \neq S\subset N\). In the main theorem of the paper the kernel of the sum of two games is given of the parts of kernels of certain modified games. Finally, the sum of games from certain classes (monotonic simple, symmetric or convex games) is treated in detail.
0 references
game in characteristic function form
0 references
kernel
0 references
composition of two cooperative games
0 references
disjoint sets of players
0 references
sum of two games
0 references