Assignment games with population monotonic allocation schemes
From MaRDI portal
Publication:6541010
Recommendations
- Population monotonic allocation schemes for cooperative games with transferable utility
- Population Lorenz-monotonic allocation schemes for TU-games
- Monotonic core allocation paths for assignment games
- A dual description of the class of games with a population monotonic allocation scheme
- Population monotonicity in matching games
Cites work
- scientific article; zbMATH DE number 3728060 (Why is no real title available?)
- scientific article; zbMATH DE number 3733695 (Why is no real title available?)
- scientific article; zbMATH DE number 3771380 (Why is no real title available?)
- scientific article; zbMATH DE number 41329 (Why is no real title available?)
- A dual description of the class of games with a population monotonic allocation scheme
- A note on weighted multi-glove games
- An algorithm for finding the nucleolus of assignment games
- Assignment games with stable core
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Monotonic core allocation paths for assignment games
- On the Nucleolus of a Characteristic Function Game
- On the population monotonicity of independent set games
- Population monotonic allocation schemes for cooperative games with transferable utility
- Population monotonic allocation schemes for vertex cover games
- Population monotonic allocation schemes in bankruptcy games
- Population monotonic path schemes for simple games
- Population monotonicity in matching games
- The Nucleolus of a Characteristic Function Game
- The assignment game. I: The core
- The assignment game: the \(\tau\)-value
- The maximum and the addition of assignment games
Cited in
(2)
This page was built for publication: Assignment games with population monotonic allocation schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541010)
