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

DOI10.1007/S10878-012-9484-9zbMATH Open1308.91025OpenAlexW2041850538MaRDI QIDQ386434FDOQ386434

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

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

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)

Cites Work

• Matching theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Combinatorial optimization. Networks and matroids
• Core Stability of Minimum Coloring Games
• Fair cost allocations under conflicts - a game-theoretic point of view -
• Balancedness of edge covering games
• Title not available (Why is that?)
• Dominating set games.

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)