Proof of permutationally convexity of MCSF games |
| |
| Authors: | Bahram Alidaee |
| |
| Affiliation: | (1) Mathematics and Physical Sciences Department, West Texas State University, 79016 Canyon, TX, USA |
| |
| Abstract: | Granot and Huberman (1982) showed that minimum cost spanning tree (MCST) games are permutationally convex (PC). Recently, Rosenthal (1987) gave an extension of MCST games to minimum cost spanning forest (MCSF) games and showed these games have nonempty cores. In this note we show any MCSF game is a PC game. |
| |
| Keywords: | Minimum Cost Spanning Tree Game Minimum Cost Spanning Forest Game Permutationally Convex Game |
| 本文献已被 SpringerLink 等数据库收录！ |
