DeepAI AI Chat
Log In Sign Up

Population Monotonic Allocation Schemes for Vertex Cover Games

02/07/2020
by   Han Xiao, et al.
Ocean University of China
0

For the class of vertex cover games (introduced by Deng et al., Math. Oper. Res., 24:751-766, 1999), we investigate the population monotonic allocation schemes (introduced by Sprumont, Games Econ. Behav., 2: 378-394, 1990). We present a complete characterization for the class of vertex cover games admitting a population monotonic allocation scheme (PMAS for short), i.e., a vertex cover game has a PMAS if and only if the underlying graph is (K_3,C_4,P_5)-free. Our characterization implies that the existence of a PMAS can be determined efficiently for vertex cover games. We also propose an alternative description for PMAS-es in vertex cover games based on the dual linear program of the vertex cover problem, which reveals the dual-based allocation scheme nature of PMAS-es. Moreover, we give a complete characterization for integral PMAS-es in vertex cover games via stable matchings and show that the celebrated Gale-Shapley algorithm (introduced by Gale and Shapley, Amer. Math. Monthly, 69:9-15, 1962) can be used to produce all integral PMAS-es in vertex cover games.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/03/2021

Population Monotonicity in Matching Games

A matching game is a cooperative profit game defined on an edge-weighted...
03/31/2022

On the Population Monotonicity of Independent Set Games

An independent set game is a cooperative game defined on graphs and deal...
10/31/2022

Assignment games with population monotonic allocation schemes

We characterize the assignment games which admit a population monotonic ...
12/12/2018

On Graphs with Minimal Eternal Vertex Cover Number

The eternal vertex cover problem is a variant of the classical vertex co...
10/11/2019

On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal

Let vc(G), fvs(G) and oct(G), respectively, denote the size of a minimum...
09/11/2022

Cores of Games via Total Dual Integrality, with Applications to Perfect Graphs and Polymatroids

LP-duality theory has played a central role in the study of cores of gam...
11/10/2022

Winner Determination Algorithms for Graph Games with Matching Structures

Cram, Domineering, and Arc Kayles are well-studied combinatorial games. ...