Stable cooperation in graph-restricted games

MaRDI QIDQ2827149zbMATH OpenFDO

Authors Elena M. Parilina, Artem A. Sedakov

Publication date 12 October 2016

Full work available at URL http://mathnet.ru/eng/cgtm238

zbMATH Keywords

characteristic functioncoalition structurecooperationES-valuegraphMyerson valueShapley valuestability

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 5823886
• Stable cooperation in a game with a major player
• Communication and its cost in graph-restricted games
• scientific article; zbMATH DE number 970204
• Cooperation when some players are incompatible

Cited in

(13)

• An algorithm for computing the stable coalition structures in tree-graph communication games
• Graphs and (levels of) cooperation in games: two ways how to allocate the surplus
• Consensus in a social network with two principals
• Individual stability of coalition structures in three-person games
• Characteristic function games with restricted agent interactions: core-stability and coalition structures
• Solutions of cooperative games with a major player and a hierarchical structure
• scientific article; zbMATH DE number 5823886 (Why is no real title available?)
• Stable cooperation in a game with a major player
• Solutions for cooperative games with a major player and a hierarchical structure
• scientific article; zbMATH DE number 3948033 (Why is no real title available?)
• Stable coalition structures in dynamic competitive environment
• Individual stability of coalition structures in three-person games
• Existence of Stable Coalition Structures in Three-player Games with Graph-constrained Solution

This page was built for publication: Stable cooperation in graph-restricted games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827149)