On the population monotonicity of independent set games
From MaRDI portal
Publication:2084006
DOI10.1016/j.orl.2022.06.009OpenAlexW4226355997MaRDI QIDQ2084006
Publication date: 17 October 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.17041
Related Items
Cites Work
- Unnamed Item
- Population monotonic allocation schemes for cooperative games with transferable utility
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Totally balanced combinatorial optimization games
- A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
- The general graph matching game: approximate core
- Population monotonicity in matching games
- Monotonic core allocation paths for assignment games
- The assignment game. I: The core
- On the convexity of independent set games
- On some approximately balanced combinatorial cooperative games
- Totally Balanced Games and Games of Flow
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Limitations of cross-monotonic cost-sharing schemes
- A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games
- Matching Games: The Least Core and the Nucleolus
- LINK MONOTONIC ALLOCATION SCHEMES
- Finding nucleolus of flow game
- An efficient characterization of submodular spanning tree games
- Computing the nucleolus of weighted cooperative matching games in polynomial time
This page was built for publication: On the population monotonicity of independent set games
