| Article ID: | iaor1993300 |
| Country: | Netherlands |
| Volume: | 50 |
| Issue: | 1 |
| Start Page Number: | 123 |
| End Page Number: | 135 |
| Publication Date: | Mar 1991 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Tamir A. |
| Keywords: | networks |
The paper uses 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. It also discusses computational issues related to finding and recognizing core points for these classes of games.