Stable sets and max-convex decompositions of TU games

DOI10.1007/S11750-011-0177-9zbMATH Open1269.91010OpenAlexW2072109237MaRDI QIDQ356514FDOQ356514

Authors: Francesc Llerena, Carles Rafels 

Publication date: 26 July 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-011-0177-9

Recommendations

• Convex games and stable sets
• Maximal stable sets of two-player games
• Stable sets and cores for multi-criteria simple games and for their extensions
• scientific article; zbMATH DE number 1031405
• On the computation of stable sets for bimatrix games
• scientific article; zbMATH DE number 4035611
• STABLE SETS FOR SIMPLE GAMES WITH ORDINAL PREFERENCES
• scientific article; zbMATH DE number 3849014
• A characterisation of stable sets in games with transitive preference
• On the convexity of independent set games

zbMATH Keywords

corecoalitional gamesconvex gamesmax-convex decompositionstable sets

Mathematics Subject Classification ID

Cooperative games (91A12)

Cites Work

• Title not available (Why is that?)
• Cores of convex games
• Title not available (Why is that?)
• Introduction to the Theory of Cooperative Games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• The Shapley value on some lattices of monotonic games
• The vector lattice structure of the \(n\)-person TU games
• Title not available (Why is that?)
• On the cores of cooperative games and the stability of the Weber set
• An intersection theorem in TU cooperative game theory
• A game with no solution

Cited In (3)

• Stable sets and cores for multi-criteria simple games and for their extensions
• Title not available (Why is that?)
• The minimum set of \(\mu\)-compatible subgames for obtaining a stable set in an assignment game

This page was built for publication: Stable sets and max-convex decompositions of TU games

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