Generalized Kernels and Bargainig Sets for Cooperative Games with Limited Communication Structure
Contributions to game theory and management, Tome 3 (2010), pp. 289-302.

Voir la notice de l'article provenant de la source Math-Net.Ru

For a fixed undirected connected graph $\varphi$ with a node set $N$, we study generalized kernels and bargaining sets for cooperative games $(N,v)$, where players are able to cooperate only if they can form a connected subgraph in graph $\varphi$. We consider generalizations of Aumann–Maschler theory of the bargaining set and the kernel, where objections and counter-objections are defined between coalitions from a fixed collection of coalitions $\mathcal{A}$. Two problems are solved in this paper. Necessary and sufficient condition on $\mathcal{A}$, which ensures that each TU-game $(N,v)$ would have a nonempty $\varphi $-restricted generalized kernel $\mathcal{K}_\mathcal{A}(N,v)$ is obtained. For two different generalizations of bargaining sets, we obtained necessary and sufficient conditions on $\varphi$, which ensure that each game $(N,v)$ would have nonempty $\varphi $-restricted generalized $\mathcal{A}$-bargaining set for each $\varphi$-permissible collection $\mathcal{A}$.
Keywords: cooperative games, kernel, bargaining set, limited communication.
@article{CGTM_2010_3_a22,
     author = {Natalia Naumova and Irina Korman},
     title = {Generalized {Kernels} and {Bargainig} {Sets} for {Cooperative} {Games} with {Limited} {Communication} {Structure}},
     journal = {Contributions to game theory and management},
     pages = {289--302},
     publisher = {mathdoc},
     volume = {3},
     year = {2010},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2010_3_a22/}
}
TY  - JOUR
AU  - Natalia Naumova
AU  - Irina Korman
TI  - Generalized Kernels and Bargainig Sets for Cooperative Games with Limited Communication Structure
JO  - Contributions to game theory and management
PY  - 2010
SP  - 289
EP  - 302
VL  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2010_3_a22/
LA  - en
ID  - CGTM_2010_3_a22
ER  - 
%0 Journal Article
%A Natalia Naumova
%A Irina Korman
%T Generalized Kernels and Bargainig Sets for Cooperative Games with Limited Communication Structure
%J Contributions to game theory and management
%D 2010
%P 289-302
%V 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2010_3_a22/
%G en
%F CGTM_2010_3_a22
Natalia Naumova; Irina Korman. Generalized Kernels and Bargainig Sets for Cooperative Games with Limited Communication Structure. Contributions to game theory and management, Tome 3 (2010), pp. 289-302. http://geodesic.mathdoc.fr/item/CGTM_2010_3_a22/

[1] Aumann R. J., Maschler M., “The bargaining set for cooperative games”, Annals of Math. Studies, 52, Princeton Univ. Press, Princeton, N.J., 1964, 443–476 | MR

[2] Davis M., Maschler M., “Existence of stable payoff configurations for cooperative games”, Bull. Amer. Math. Soc., 69 (1963), 106–108 | DOI | MR | Zbl

[3] Maschler M., Peleg B., “A characterization, existence proof and dimension bounds of the kernel of a game”, Pacific J. of Math., 18 (1966), 289–328 | DOI | MR | Zbl

[4] Myerson R. B., “Graphs and cooperation in games”, Mathematics of Operations Research, 2 (1977), 225–229 | DOI | MR | Zbl

[5] Vestnik Leningrad. Univ. Math., 9 (1981), 131–139 | MR | Zbl | Zbl

[6] Vestnik Leningrad. Univ. Math., 11 (1983), 67–73 | MR | Zbl | Zbl

[7] Naumova N. I., “Generalized kernels and bargaining sets for families of coalitions”, The International Conference Game Theory and Management, Collected Papers (June 28–29, 2007, St. Petersburg, Russia), Contributions to Game Theory and Management, Graduate School of Management St. Petersburg State University, 2008, 346–360

[8] Peleg B., “Existence theorem for the bargaining set $M^i_1$”, Essays in Mathematical Economics in Honor of Oskar Morgenstern, ed. M. Shubic, Princeton Univ. Press, Princeton, 1967, 53–56 | MR