C-complete sets for compromise stable games (Q471023)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6369330
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | C-complete sets for compromise stable games |
scientific article; zbMATH DE number 6369330 |
Statements
C-complete sets for compromise stable games (English)
0 references
13 November 2014
0 references
The paper investigates the relationship between compromise stability of transferable utility games and efficient payoff vectors; specifically, the main results study the structure of the generators of the core cover, and conditions ensuring that the game is compromise stable.
0 references
core
0 references
core cover
0 references
larginal vectors
0 references
TU-game
0 references
0.7814630270004272
0 references
0.7716692090034485
0 references
0.7436042428016663
0 references
0.7430694699287415
0 references
