Splitting graphs when calculating Myerson value for pure overhead games. (Q703208)
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: Splitting graphs when calculating Myerson value for pure overhead games. |
scientific article; zbMATH DE number 2125850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Splitting graphs when calculating Myerson value for pure overhead games. |
scientific article; zbMATH DE number 2125850 |
Statements
Splitting graphs when calculating Myerson value for pure overhead games. (English)
0 references
11 January 2005
0 references
The authors develop splitting graphs when calculating the Myerson value for pure overhead games. A number of strategies and theorems are developed for the problem but no numerical experiments are performed.
0 references
communication situation
0 references
overhead games
0 references
Myerson value
0 references
graphs
0 references
0.7584006190299988
0 references
0.7549139261245728
0 references
0.7407164573669434
0 references
0.7373637557029724
0 references
0.7356141209602356
0 references
