The modiclus and core stability
Consider a cooperative transferable utility game (TU game). The prenucleolus is obtained by lexicographically minimizing the non increasing ordered vector of excesses of the coalitions within the set of Pareto optimal payoff vectors. The modiclus is obtained by lexicographically minimizing the non increasing ordered vector of differences of excesses of the coalitions within the set of Pareto optimal payoff vectors. It is shown that the modiclus assigns a singleton to any TU game. Also it selects a member of the core for any exact orthogonal game and for any assignment game that has a stable core. An example is given to show that there is an exact TU game with a stable core that does not contain the modiclus.
This page was built for publication: The modiclus and core stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576646)