Stable effectivity functions and perfect graphs

DOI10.1016/S0165-4896(99)00017-7zbMath0951.91011WikidataQ59560732 ScholiaQ59560732MaRDI QIDQ1974051

Endre Boros, Vladimir A. Gurvich

Publication date: 8 May 2000

Published in: Mathematical Social Sciences (Search for Journal in Brave)

zbMATH Keywords

corekernelperfect graphkernel-solvable graphstable effectivity function

Mathematics Subject Classification ID

Cooperative games (91A12) Perfect graphs (05C17)

Related Items (10)

Dual-bounded generating problems: Weighted transversals of a hypergraph ⋮ Perfect graphs are kernel solvable ⋮ The structure of unstable power mechanisms ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ On necessary and sufficient conditions for solvability of game forms. ⋮ Stable effectivity functions and perfect graphs ⋮ Three-dimensional stable matching with cyclic preferences ⋮ On effectivity functions of game forms ⋮ Minimal and locally minimal games and game forms ⋮ Computational complexity in the design of voting rules

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On kernels in perfect graphs
• Kernels in perfect line-graphs
• Necessary and sufficient conditions for stability of effectivity functions
• Perfect graphs are kernel solvable
• Cores of effectivity functions and implementation theory
• Stable families of coalitions and normal hypergraphs
• Dual cores and effectivity functions
• Stable effectivity functions and perfect graphs
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• The Core of an N Person Game

This page was built for publication: Stable effectivity functions and perfect graphs