A combinatorial characterization for population monotonic allocations in convex independent set games
DOI10.1142/S0217595921400066zbMATH Open1480.91020OpenAlexW3127392574MaRDI QIDQ5024477FDOQ5024477
Authors: Bin Liu, Han Xiao, Qizhi Fang 
Publication date: 1 February 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921400066
Recommendations
- On the convexity of independent set games
- Population monotonicity in matching games
- A note: characterizations of convex games by means of population monotonic allocation schemes
- Population monotonic allocation schemes for cooperative games with transferable utility
- Population monotonic allocation schemes for vertex cover games
Cooperative games (91A12) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Combinatorial games (91A46)
Cites Work
Cited In (9)
- Population monotonic allocation schemes for vertex cover games
- On the convexity of independent set games
- Population monotonic solutions on convex games
- On the existence of population-monotonic solutions on the domain of quasi-convex games
- Title not available (Why is that?)
- Population monotonicity in matching games
- A note: characterizations of convex games by means of population monotonic allocation schemes
- Title not available (Why is that?)
- On the population monotonicity of independent set games
This page was built for publication: A combinatorial characterization for population monotonic allocations in convex independent set games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024477)
