Minimum coloring problems with weakly perfect graphs

DOI10.1007/S10058-021-00265-4MaRDI QIDQ2149192zbMATHOpenAlexFDO

Authors Eric Bahel, Christian Trudeau

Publication date 28 June 2022

Published in Review of Economic Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10058-021-00265-4

zbMATH Keywords

cost sharingmerge-proofnessminimum coloring gameunanimity lower bound

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• Algorithms and Computation
• Graph-Theoretic Concepts in Computer Science
• Core Stability of Minimum Coloring Games
• Simple and three-valued simple minimum coloring games
• Fair cost allocations under conflicts - a game-theoretic point of view -

Cites work

• A Simple Expression for the Shapley Value in a Special Case
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Allocation rules for a commonly owned technology: The average cost lower bound
• Core Stability of Minimum Coloring Games
• Fair cost allocations under conflicts - a game-theoretic point of view -
• Joint Ownership of a Convex Technology: Comparison of Three Solutions
• Monotonic stable solutions for minimum coloring games
• Sharing the cost of redundant items
• Stability and fairness in the job scheduling problem

Cited in

(8)

• On the properties of weighted minimum colouring games
• Minimal colorings for properly colored subgraphs
• Simple and three-valued simple minimum coloring games
• Fair cost allocations under conflicts - a game-theoretic point of view -
• Graph-Theoretic Concepts in Computer Science
• Algorithms and Computation
• Core Stability of Minimum Coloring Games
• On the minimum load coloring problem

This page was built for publication: Minimum coloring problems with weakly perfect graphs

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