Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Games involving graphs (91A43) Discrete location and assignment (90B80)
Recommendations
Cites work
- scientific article; zbMATH DE number 9246 (Why is no real title available?)
- scientific article; zbMATH DE number 16723 (Why is no real title available?)
- scientific article; zbMATH DE number 3557519 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Balanced matrices
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem
- Graphs whose neighborhoods have no special cycles
- Ideal 0, 1 matrices
- On the Core of Cost Allocation Games Defined on Location Problems
- Relations between packing and covering numbers of a tree
Cited in
(7)- The cores of paired-domination games
- Balancedness of edge covering games
- BALANCEDNESS OF INTEGER DOMINATION GAMES
- A note on balancedness of dominating set games
- On the cores of games arising from integer edge covering functions of graphs
- Approximate core allocations for edge cover games
- A game theoretic approach for minimal connected dominating set
This page was built for publication: Dominating set games.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703283)
