Population monotonicity in matching games

DOI10.1007/s10878-021-00804-3zbMath1492.91035arXiv2105.00621OpenAlexW3201170906MaRDI QIDQ2136163

Han Xiao, Qizhi Fang

Publication date: 10 May 2022

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

Full work available at URL: https://arxiv.org/abs/2105.00621

zbMATH Keywords

matching gamecooperative game theorypopulation monotonic allocation scheme

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

On the population monotonicity of independent set games

Cites Work

• Computing solutions for matching games
• Axiomatization of the core of assignment games
• Generalized Ramsey theory for graphs, X: Double stars
• Population monotonic allocation schemes for cooperative games with transferable utility
• The nucleon of cooperative games and an algorithm for matching games
• An algorithm for finding the nucleolus of assignment games
• Characterization of the extreme core allocations of the assignment game.
• Stable outcomes of the roommate game with transferable utility
• Assignment games with stable core
• Totally balanced combinatorial optimization games
• Consistency in one-sided assignment problems
• The general graph matching game: approximate core
• An axiomatization of the nucleolus of assignment markets
• Incremental cost sharing: Characterization by coalition strategy-proofness
• The assignment game. I: The core
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Limitations of cross-monotonic cost-sharing schemes
• Matching Games: The Least Core and the Nucleolus
• Computing the nucleolus of weighted cooperative matching games in polynomial time
• Strategyproof sharing of submodular costs: budget balance versus efficiency

This page was built for publication: Population monotonicity in matching games