Restricted Core Stability of Flow Games

Authors:
Mao-Cheng Cai;Qizhi Fang
Affiliations:
Academy of Mathematics and Systems Science, Chinese Academy of Science, Beijing, China 100080;Department of Mathematics, Ocean University of China, Qingdao, China 266071
Venue:
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Year:
2008

Citing 6
Cited 0

On the complexity of cooperative solution concepts

Mathematics of Operations Research
Algorithmic Aspects of the Core of Combinatorial Optimization Games

Mathematics of Operations Research
Membership for Core of LP Games and Other Games

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Finding nucleolus of flow game

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Core stability of flow games

CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Core stability of minimum coloring games

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a kind of restricted core stability for flow games, which is a generalization of the core stability of simple flow games. We first give a characterization on the restricted core, and then propose a sufficient and necessary condition on the restricted core stability for flow games associated with general networks. This condition yields that testing the restricted core stability can be done in polynomial time.