On the properties of weighted minimum colouring games

DOI10.1007/S10479-021-04374-9MaRDI QIDQ2095946zbMATH OpenOpenAlexFDO

Authors Herbert Hamers, Nayat Horozoglu, Henk Norde, Trine Tornøe Platz

Publication date 15 November 2022

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-021-04374-9

zbMATH Keywords

\((2K_2complete multipartite graphP_4)\)-free graphpopulation monotonic allocation schemessubmodularitytotally balancednessweighted minimum colouring game

Mathematics Subject Classification ID

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

Recommendations

• Minimum coloring problems with weakly perfect graphs
• Monotonic stable solutions for minimum coloring games
• Simple and three-valued simple minimum coloring games
• Totally balanced combinatorial optimization games
• Graphs inducing totally balanced and submodular Chinese postman games

Cites work

• A Linear Recognition Algorithm for Cographs
• A Note on "The Comparability Graph of a Tree"
• A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Channel assignment and weighted coloring
• Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Contributions to the Theory of Games (AM-40), Volume IV
• Cores of convex games
• Highway games on weakly cyclic graphs
• scientific article; zbMATH DE number 1090983 (Why is no real title available?)
• Monotonic stable solutions for minimum coloring games
• Naturally submodular digraphs and forbidden digraph configurations
• Normal hypergraphs and the perfect graph conjecture
• On some balanced, totally balanced and submodular delivery games
• On the equivalence between some local and global Chinese postman and traveling salesman graphs
• Population monotonic allocation schemes for cooperative games with transferable utility
• Quasi-threshold graphs
• Recognizing Berge graphs
• Submodularity of some classes of the combinatorial optimization games
• The kernel and bargaining set for convex games
• Totally balanced combinatorial optimization games

Cited in

(3)

• \(w\)-density and \(w\)-balanced property of weighted graphs
• Monotonic stable solutions for minimum coloring games
• Coloring games with multi-located players

This page was built for publication: On the properties of weighted minimum colouring games

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