Coloring games with multi-located players
In this paper we consider minimum coloring problems with multi-located players, where agents are allowed to occupy different vertices in the conflict graph. The related cooperative games generalize the classical minimum coloring games. We show that minimum coloring games with multi-located players a...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2026 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:dnet:recercat____::2c76c43c97393c0f9b1a2fd89c5d5257 |
| Acceso en línea: | https://doi.org/10.1016/j.ejor.2026.03.015 https://hdl.handle.net/10459.1/470084 |
| Access Level: | acceso abierto |
| Palabra clave: | Coloring problem Complete multi-partite graph Perfect graph |
| Sumario: | In this paper we consider minimum coloring problems with multi-located players, where agents are allowed to occupy different vertices in the conflict graph. The related cooperative games generalize the classical minimum coloring games. We show that minimum coloring games with multi-located players are totally balanced if and only if the related minimum coloring problem is perfect and they are submodular if the underlying graph is complete multi-partite. In the first case, the totally balanced game is a generalized rank game, and in the second case, the submodular game is a (matroid) rank game. |
|---|