Comparable characterizations of four solutions for permission tree games (Q523060)
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 6706420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparable characterizations of four solutions for permission tree games |
scientific article; zbMATH DE number 6706420 |
Statements
Comparable characterizations of four solutions for permission tree games (English)
0 references
20 April 2017
0 references
cooperative TU-game
0 references
permission tree
0 references
Myerson value
0 references
hierarchical outcome
0 references
permission value
0 references
axiomatization
0 references
0 references
0 references
0 references
0 references
0.8855124711990356
0 references
0.8473459482192993
0 references
0.8237066268920898
0 references
0.822205662727356
0 references
