On the cores of games arising from integer edge covering functions of graphs

DOI10.1007/S10878-012-9484-9MaRDI QIDQ386434zbMATH OpenOpenAlexFDO

Authors Boram Park, Suh-Ryung Kim, Hye Kyung Kim

Publication date 9 December 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9484-9

zbMATH Keywords

decomposition theoremsedge covering problemsinteger edge covering functions of graphsinteger edge covering problems on graphs

Mathematics Subject Classification ID

Cooperative games (91A12) Games on graphs (graph-theoretic aspects) (05C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games involving graphs (91A43)

Recommendations

• Balancedness of edge covering games
• \(k\)-edge-covering game
• The cores of paired-domination games
• BALANCEDNESS OF INTEGER DOMINATION GAMES
• Conditions on core stability of covering games

Cites work

• scientific article; zbMATH DE number 1599890 (Why is no real title available?)
• scientific article; zbMATH DE number 1929535 (Why is no real title available?)
• scientific article; zbMATH DE number 6464010 (Why is no real title available?)
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Balancedness of edge covering games
• Combinatorial optimization. Networks and matroids
• Core Stability of Minimum Coloring Games
• Dominating set games.
• Fair cost allocations under conflicts - a game-theoretic point of view -
• Matching theory

Cited in

(4)

• \(k\)-edge-covering game
• Balancedness of edge covering games
• Approximate core allocations for edge cover games
• Approximate core allocations for edge cover games

This page was built for publication: On the cores of games arising from integer edge covering functions of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386434)