Simple and three-valued simple minimum coloring games
type: Item
instance of: scholarly article
title: Simple and three-valued simple minimum coloring games
zbMATH Open document ID: 1371.91025
author: Peter Borm
author: M. Musegaas
author: Marieke Quant
published in: Mathematical Methods of Operations Research
publication date: 2016-11-29T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 6657185
zbMATH Keywords: minimum coloring games
zbMATH Keywords: simple games
zbMATH Keywords: three-valued simple games
MaRDI profile type: Publication
full work available at URL: s00186-016-0542-4
OpenAlex ID: W2258430235
Wikidata QID: Q59460132
cites work: Core Stability of Minimum Coloring Games
cites work: Operations research games: A survey. (With comments and rejoinder)
cites work: The strong perfect graph theorem
cites work: Algorithmic Aspects of the Core of Combinatorial Optimization Games
cites work: Totally balanced combinatorial optimization games
cites work: Monotonic stable solutions for minimum coloring games
cites work: Step out-step in sequencing games
cites work: Q5844986
cites work: Submodularity of some classes of the combinatorial optimization games
cites work: Fair cost allocations under conflicts - a game-theoretic point of view -
cites work: Vertex colouring and forbidden subgraphs -- a survey
DOI: 10.1007/S00186-016-0542-4
description: scientific article; zbMATH DE number 6657185