On the properties of weighted minimum colouring games
From MaRDI portal
Publication:2095946
DOI10.1007/s10479-021-04374-9zbMath1503.05082OpenAlexW4213087067MaRDI QIDQ2095946
Trine Tornøe Platz, Nayat Horozoglu, Herbert Hamers, Henk Norde
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
submodularitycomplete multipartite graphpopulation monotonic allocation schemes\((2K_2P_4)\)-free graphtotally balancednessweighted minimum colouring game
Cooperative games (91A12) Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
- Population monotonic allocation schemes for cooperative games with transferable utility
- On the equivalence between some local and global Chinese postman and traveling salesman graphs
- Submodularity of some classes of the combinatorial optimization games
- Totally balanced combinatorial optimization games
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Quasi-threshold graphs
- On some balanced, totally balanced and submodular delivery games
- Naturally submodular digraphs and forbidden digraph configurations
- Monotonic stable solutions for minimum coloring games
- Recognizing Berge graphs
- Cores of convex games
- Normal hypergraphs and the perfect graph conjecture
- The kernel and bargaining set for convex games
- Highway games on weakly cyclic graphs
- Contributions to the Theory of Games (AM-40), Volume IV
- A Linear Recognition Algorithm for Cographs
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP
- Channel assignment and weighted coloring
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- A Note on "The Comparability Graph of a Tree"
This page was built for publication: On the properties of weighted minimum colouring games
