Population monotonic allocation schemes for vertex cover games

DOI10.1016/j.tcs.2020.07.023zbMath1456.91057arXiv2002.02824OpenAlexW3004873553MaRDI QIDQ2006775

Qizhi Fang, Han Xiao, Ding-Zhu Du

Publication date: 12 October 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

vertex coverstable matchingpopulation monotonic allocation schemecross-monotonic cost-sharing scheme

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

Population monotonic allocation schemes for the two-period economic lot-sizing games

Cites Work

• Population monotonic allocation schemes for cooperative games with transferable utility
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Submodularity of some classes of the combinatorial optimization games
• Totally balanced combinatorial optimization games
• Population monotonic allocation schemes in bankruptcy games
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Monotonic stable solutions for minimum coloring games
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• College Admissions and the Stability of Marriage