Stable effectivity functions and perfect graphs

被引：9
|
作者：
Boros, E [1 ]
Gurvich, V [1 ]
机构：
[1] Rutgers State Univ, Piscataway, NJ 08854 USA
来源：
MATHEMATICAL SOCIAL SCIENCES | 2000年 / 39卷 / 02期
基金：
美国国家科学基金会;
关键词：
core; kernel; stable effectivity function; perfect graph; kernel-solvable graph;
D O I：
10.1016/S0165-4896(99)00017-7
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
We consider the problem of characterizing the stability of effectivity functions (EFF), via a correspondence between game theoretic and well-known combinatorial concepts. To every EFF we assign a pair of hypergraphs, representing clique covers of two associated graphs, and obtain some necessary and some sufficient conditions for the stability of EFFs in terms of graph-properties. These conditions imply, for example, that to check the stability of an EFF is an NP-complete problem. We also translate some well-known conjectures of graph theory into game theoretic language and vice versa. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：175 / 194
页数：20
相关论文
共 50 条
12345