A combinatorial characterization for population monotonic allocations in convex independent set games
From MaRDI portal
Publication:5024477
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
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
- scientific article; zbMATH DE number 613179 (Why is no real title available?)
- Population monotonicity in matching games
- A note: characterizations of convex games by means of population monotonic allocation schemes
- scientific article; zbMATH DE number 5351693 (Why is no real title available?)
- 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)