![]() |
Volumn 59, Issue 3, 2004, Pages 479-489
|
Splitting graphs when calculating Myerson value for pure overhead games
|
Author keywords
Communication situations; Graph Restricted Game; Myerson value; Pure overhead games
|
Indexed keywords
COMMUNICATION SYSTEMS;
COMPUTER SIMULATION;
FUNCTIONS;
GRAPHIC METHODS;
MATHEMATICAL MODELS;
PROBLEM SOLVING;
SET THEORY;
COMMUNICATION SITUATIONS;
GRAPH-RESTRICTED GAME;
MYERSON VALUE;
PURE OVERHEAD GAMES;
GAME THEORY;
|
EID: 21144445263
PISSN: 14322994
EISSN: None
Source Type: Journal
DOI: 10.1007/s001860400346 Document Type: Conference Paper |
Times cited : (9)
|
References (12)
|