On the population monotonicity of independent set games

Article Computer Science, Interdisciplinary Applications

Population monotonicity in matching games

Han Xiao et al.

Summary: In this paper, the authors study matching games and provide a necessary and sufficient characterization for the existence of population monotonic allocation schemes, allowing for efficient determination of whether a matching game admits such schemes.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2022)

Add to Collection

Article Economics

The general graph matching game: Approximate core

Vijay V. Vazirani

Summary: The classic paper by Shapley and Shubik (1971) characterizes the core of the assignment game using matching theory and LP-duality theory. The paper proposes an imputation in the 2/3-approximate core for the general graph matching game, which can be computed in polynomial time.

GAMES AND ECONOMIC BEHAVIOR (2022)

Add to Collection

Article Operations Research & Management Science

A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games

Bin Liu et al.

Summary: This paper discusses population monotonic allocation schemes for independent set games, providing a combinatorial characterization for these schemes in convex instances and proving the equivalence of convexity, population monotonicity, and balancedness in certain types of independent set games.

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH (2021)

Add to Collection

Article Mathematics, Applied

On the convexity of independent set games

Han Xiao et al.

Summary: This paper investigates the convexity of independent set games, providing a necessary and sufficient characterization for convex instances. It also introduces a new class of independent set games and provides a characterization for their convexity.

DISCRETE APPLIED MATHEMATICS (2021)

Add to Collection

Article Computer Science, Software Engineering