Approximate Core Allocations for Edge Cover Games

Tianhang Lu, Han Xian and Qizhi Fang

Papers from arXiv.org

Abstract: We study the approximate core for edge cover games, which are cooperative games stemming from edge cover problems. In these games, each player controls a vertex on a network $G = (V, E; w)$, and the cost of a coalition $S\subseteq V$ is equivalent to the minimum weight of edge covers in the subgraph induced by $S$. We prove that the 3/4-core of edge cover games is always non-empty and can be computed in polynomial time by using linear program duality approach. This ratio is the best possible, as it represents the integrality gap of the natural LP for edge cover problems. Moreover, our analysis reveals that the ratio of approximate core corresponds with the length of the shortest odd cycle of underlying graphs.

Date: 2023-08
New Economics Papers: this item is included in nep-gth and nep-net
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2308.11222 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2308.11222

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().