The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
作者： Daniel Granot , Gur Huberman
DOI: 10.1137/0603029
关键词:
摘要: Notwithstanding the apparent differences between convex games and minimum cost spanning tree (m.c.s.t.) games, we show that there is a close relationship these two types of games. This realized with introduction group permutationally (p.c.) It shown p.c. game has nonempty core both m.c.s.t. are convex.
aip.org
sci-hub.se 参考文章(0)