Monotonic stable solutions for minimum coloring games
From MaRDI portal
Publication:2248763
DOI10.1007/s10107-013-0655-yzbMath1292.05187OpenAlexW2146242944MaRDI QIDQ2248763
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://pure.uvt.nl/ws/files/1311870/2011-016.pdf
Cooperative games (91A12) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (7)
Some new results on generalized additive games ⋮ Minimum coloring problems with weakly perfect graphs ⋮ Simple and three-valued simple minimum coloring games ⋮ Population monotonic allocation schemes for the two-period economic lot-sizing games ⋮ Population monotonic allocation schemes for vertex cover games ⋮ On the properties of weighted minimum colouring games ⋮ On games arising from multi-depot Chinese postman problems
Cites Work
- Fair cost allocations under conflicts - a game-theoretic point of view -
- Production-inventory games and PMAS-games: Characterizations of the Owen point
- Production-inventory games: A new class of totally balanced combinatorial optimization games
- Sequencing games
- Traveling salesman games
- Population monotonic allocation schemes for cooperative games with transferable utility
- Trivially perfect graphs
- Operations research games: A survey. (With comments and rejoinder)
- Submodularity of some classes of the combinatorial optimization games
- Totally balanced combinatorial optimization games
- Quasi-threshold graphs
- On some balanced, totally balanced and submodular delivery games
- The Comparability Graph of a Tree
- On the core of linear production games
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Core Stability of Minimum Coloring Games
- A Note on "The Comparability Graph of a Tree"
This page was built for publication: Monotonic stable solutions for minimum coloring games
