Stable sets in one-seller assignment games
From MaRDI portal
(Redirected from Stable sets in one-seller assignment games)
Recommendations
- Von Neumann-Morgenstern solutions in the assignment market
- Assignment games with stable core
- The minimum set of \(\mu\)-compatible subgames for obtaining a stable set in an assignment game
- On assignment games
- On the structure of cooperative and competitive solutions for a generalized assignment game
Cites work
- Assignment games with stable core
- Auctioning Böhm-Bawerk's horses
- scientific article; zbMATH DE number 1194817 (Why is no real title available?)
- scientific article; zbMATH DE number 3084669 (Why is no real title available?)
- The assignment game. I: The core
- Von Neumann-Morgenstern solutions in the assignment market
Cited in
(10)- Von Neumann-Morgenstern stable sets of a patent licensing game: the existence proof
- Does it make sense to analyse a two-sided market as a multi-choice game?
- Von Neumann-Morgenstern solutions in the assignment market
- On games arising from multi-depot Chinese postman problems
- Stability properties of the core in a generalized assignment problem
- The minimum set of \(\mu\)-compatible subgames for obtaining a stable set in an assignment game
- Stable sets of allocations and the provision of public goods
- scientific article; zbMATH DE number 4183226 (Why is no real title available?)
- Constrained-optimal tradewise-stable outcomes in the one-sided assignment game: a solution concept weaker than the core
- Efron's coins and the linial arrangement
This page was built for publication: Stable sets in one-seller assignment games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490208)
