Strongly balanced cooperative games (Q1189671)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strongly balanced cooperative games |
scientific article; zbMATH DE number 57641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strongly balanced cooperative games |
scientific article; zbMATH DE number 57641 |
Statements
Strongly balanced cooperative games (English)
0 references
27 September 1992
0 references
The paper is dedicated to the theory of cooperative games with incomplete cooperation. Strong balancedness means in this context that the considered game is balanced for any choice of payoff functions of effective coalitions. It is shown that games with incomplete cooperation can be characterized by graph-theoretical tools, and that the strong balancedness is equivalent to the normality of the corresponding hypergraph. The general results are completed by economic examples of communication and assignment games.
0 references
incomplete cooperation
0 references
effective coalitions
0 references
graph-theoretical tools
0 references
strong balancedness
0 references
hypergraph
0 references
0 references
0 references
0.8798815
0 references
0.8754173
0 references
0.8736676
0 references
