Cores of convex and strictly convex games
成果类型:
Article
署名作者:
Gonzalez-Diaz, Julio; Sanchez-Rodriguez, Estela
署名单位:
Northwestern University; Universidade de Vigo; Universidade de Vigo
刊物名称:
GAMES AND ECONOMIC BEHAVIOR
ISSN/ISSBN:
0899-8256
DOI:
10.1016/j.geb.2007.03.003
发表日期:
2008
页码:
100-105
关键词:
cooperative TU games
Convex games
combinatorial complexity
Pascal's triangle
摘要:
We follow the path initiated by Shapley in 1971 and study the geometry of the core of convex and strictly convex games. We define what we call face games and use them to study the combinatorial complexity of the core of a strictly convex game. Remarkably, we present a picture that summarizes our results with the aid of Pascal's triangle. (C) 2007 Elsevier Inc. All rights reserved.
来源URL: