Abstract
We use polynomial formulations to show that several rational and discrete network synthesis games, including the minimum cost spanning tree game, satisfy the assumptions of Owen's linear production game model. We also discuss computational issues related to finding and recognizing core points for these classes of games.
| Original language | English |
|---|---|
| Pages (from-to) | 123-135 |
| Number of pages | 13 |
| Journal | Mathematical Programming |
| Volume | 50 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Mar 1991 |
Keywords
- Network synthesis
- cooperative games
- core of a game
- linear production games