Recommendations
Cites work
- scientific article; zbMATH DE number 3172146 (Why is no real title available?)
- scientific article; zbMATH DE number 477584 (Why is no real title available?)
- Connecting the cooperative and competitive structures of the multiple-partners assignment game
- Hiring procedures to implement stable allocations
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The assignment game. I: The core
- The lattice structure of the set of stable outcomes of the multiple partners assignment game
- Three remarks on the many-to-many stable matching problem
Cited in
(15)- Does it make sense to analyse a two-sided market as a multi-choice game?
- The core of an m-sided assignment game
- Stable cost sharing in production allocation games
- Buyer-seller exactness in the assignment game
- Substitution, complementarity, and stability
- On cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria
- The assignment game. I: The core
- The assignment game: the \(\tau\)-value
- A survey on assignment markets
- A glove-market partitioned matrix related to the assignment game
- The 'marriage game': An assignment problem with indivisibilities
- Ranking auctions: a cooperative approach
- The general graph matching game: approximate core
- On the structure of cooperative and competitive solutions for a generalized assignment game
- The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria
This page was built for publication: A generalized assignment game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854115)