Dominating set games.

DOI10.1016/j.orl.2004.02.004zbMath1098.91017OpenAlexW2134225083MaRDI QIDQ703283

Bas van Velzen

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.02.004

zbMATH Keywords

cost allocationdominating setTU gamecooperative cost gamedominating set game

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Discrete location and assignment (90B80) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (3)

On the cores of games arising from integer edge covering functions of graphs ⋮ A game theoretic approach for minimal connected dominating set ⋮ Balancedness of edge covering games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs whose neighborhoods have no special cycles
• Relations between packing and covering numbers of a tree
• Ideal 0, 1 matrices
• Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• On the Core of Cost Allocation Games Defined on Location Problems
• Balanced matrices

This page was built for publication: Dominating set games.