Stable effectivity functions and perfect graphs

DOI10.1016/S0165-4896(99)00017-7MaRDI QIDQ1974051zbMATH OpenDBLPWikidataFDO

Authors Endre Boros, Vladimir Gurvich

Publication date 8 May 2000

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

Full work available at URL https://doi.org/10.1016/S0165-4896(99)00017-7

zbMATH Keywords

corekernelkernel-solvable graphperfect graphstable effectivity function

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4061024
• Necessary and sufficient conditions for stability of effectivity functions
• ON THE EQUIVALENCY OF BALANCEDNESS AND STABILITY IN EFFECTIVITY FUNCTION GAMES
• Stable effectivity functions with an infinity of players and alternatives
• Computational complexity to verify the unstability of effectivity function

Cites work

• A characterization of perfect graphs
• Cores of effectivity functions and implementation theory
• Dual cores and effectivity functions
• scientific article; zbMATH DE number 4133765 (Why is no real title available?)
• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 3864918 (Why is no real title available?)
• scientific article; zbMATH DE number 3898540 (Why is no real title available?)
• scientific article; zbMATH DE number 4079106 (Why is no real title available?)
• scientific article; zbMATH DE number 3515502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 497456 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Kernels in perfect line-graphs
• Necessary and sufficient conditions for stability of effectivity functions
• Normal hypergraphs and the perfect graph conjecture
• On kernels in perfect graphs
• Perfect graphs are kernel solvable
• Stable effectivity functions and perfect graphs
• Stable families of coalitions and normal hypergraphs
• The Core of an N Person Game

Cited in

(14)

• Minimal and locally minimal games and game forms
• Perfect graphs are kernel solvable
• On necessary and sufficient conditions for solvability of game forms.
• Dual-bounded generating problems: Weighted transversals of a hypergraph
• Stable effectivity functions and perfect graphs
• On effectivity functions of game forms
• Perfect graphs, kernels, and cores of cooperative games
• Computational complexity in the design of voting rules
• The structure of unstable power mechanisms
• Three-dimensional stable matching with cyclic preferences
• Recognizing distributed approval voting forms and correspondences
• Computational complexity to verify the unstability of effectivity function
• Stability of two player game structures
• A stability index for local effectivity functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974051)