An optimal bound to access the core in TU-games (Q2435888)
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 6260464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal bound to access the core in TU-games |
scientific article; zbMATH DE number 6260464 |
Statements
An optimal bound to access the core in TU-games (English)
0 references
21 February 2014
0 references
accessibility
0 references
core
0 references
optimal bound
0 references
weak dominance
0 references
TU-games
0 references
0.9356606006622314
0 references
0.9083790183067322
0 references
0.8488054871559143
0 references
0.847320020198822
0 references
0.8305646777153015
0 references
