| 拟凸对策的解 |
| |
| 引用本文： | 刘德铭,黄振高. 拟凸对策的解[J]. 数学理论与应用, 1991, 0(Z1) |
| |
| 作者姓名： | 刘德铭 黄振高 |
| |
| 作者单位： | 国防科技大学，国防科技大学 |
| |
| 摘 要： | 本文先引入拟凸对策的概念作为凸对策的推广,然后研究这种对策的各种解的性质。我们主要证得,当局中人数小于6或者对策的复盖严格凸时,谈判集与核心重合,核是单点集。另外,存在一个6人拟凸对策,其谈判集与核心不同。
|
| 关 键 词： | 合作对策 谈判集 核 核心 |
Solutions of Quasi-convex Games |
| |
| Liu Deming Huang Zhengao. Solutions of Quasi-convex Games[J]. Mathematical Theory and Applications, 1991, 0(Z1) |
| |
| Authors: | Liu Deming Huang Zhengao |
| |
| Affiliation: | National University of Defence Technology |
| |
| Abstract: | In this paper,we first introduce quasi-convex games as a generalization of convex games,and then investigate solutions of games of this type.As the main results of the paper,we prove that when the number of players is less than 6 or the cover of the game is strictly convex,the bargaining set coincides with the core and the kernel consists of a sincle point.Moreover, there is a 6-person quasi-convex game with the bargaining set different from the core. |
| |
| Keywords: | Cooperative games Bargaining Sets Core Convexity |
| 本文献已被 CNKI 等数据库收录！ |
|
