Core of the assignment game via fixed point methods
From MaRDI portal
(Redirected from Publication:533916)
Recommendations
Cites work
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A lattice-theoretical fixpoint theorem and its applications
- A search model of two-sided matching under nontransferable utility.
- A short and constructive proof of Tarski's fixed-point theorem
- A solution to matching with preferences over colleagues
- Assignment games satisfy the CoMa-property
- Characterization of the extreme core allocations of the assignment game.
- Core many-to-one matchings by fixed-point methods
- Interior points in the core of two-sided matching markets
- On a characterization of stable matchings
- Symmetrically pairwise-bargained allocations in an assignment market
- The assignment game. I: The core
- The lattice structure of the set of stable outcomes of the multiple partners assignment game
Cited in
(6)- An alternative proof of the characterization of core stability for the assignment game
- Another proof that assignment games have singleton cores only if multiple optimal matchings exist
- Some fixed-point results for the dynamic assignment problem
- The assignment game: the \(\tau\)-value
- A note on the inclusion of the kernel in the core of the bilateral assignment game
- Core theory for multiple-sided assignment games
This page was built for publication: Core of the assignment game via fixed point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533916)