Monotonic stable solutions for minimum coloring games

DOI10.1007/S10107-013-0655-YMaRDI QIDQ2248763zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

quasi-threshold graph\((P_42K_2)\)-free graph

Mathematics Subject Classification ID

Cooperative games (91A12) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• Core Stability of Minimum Coloring Games
• On minimal colorings without monochromatic solutions to a linear equation
• On the properties of weighted minimum colouring games
• Monotonic solution of cooperative games on matroids
• scientific article; zbMATH DE number 5583099
• Anti-coordination games and stable graph colorings
• Planarity, Colorability, and Minor Games
• On monochromatic configurations for finite colorings
• A Game Theoretic Approach for Efficient Graph Coloring

Cites work

• A Note on "The Comparability Graph of a Tree"
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Core Stability of Minimum Coloring Games
• Fair cost allocations under conflicts - a game-theoretic point of view -
• On some balanced, totally balanced and submodular delivery games
• On the core of linear production games
• Operations research games: A survey. (With comments and rejoinder)
• Population monotonic allocation schemes for cooperative games with transferable utility
• Production-inventory games and PMAS-games: Characterizations of the Owen point
• Production-inventory games: A new class of totally balanced combinatorial optimization games
• Quasi-threshold graphs
• Sequencing games
• Submodularity of some classes of the combinatorial optimization games
• The Comparability Graph of a Tree
• Totally balanced combinatorial optimization games
• Traveling salesman games
• Trivially perfect graphs

Cited in

(7)

• On games arising from multi-depot Chinese postman problems
• Population monotonic allocation schemes for vertex cover games
• Some new results on generalized additive games
• Population monotonic allocation schemes for the two-period economic lot-sizing games
• Minimum coloring problems with weakly perfect graphs
• Simple and three-valued simple minimum coloring games
• On the properties of weighted minimum colouring games

This page was built for publication: Monotonic stable solutions for minimum coloring games

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