On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets
From MaRDI portal
Publication:404743
DOI10.1007/S00355-013-0746-YzbMATH Open1302.91156OpenAlexW3124650609MaRDI QIDQ404743FDOQ404743
Paula Jaramillo, Çağatay Kayı, Flip Klijn
Publication date: 4 September 2014
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: http://repository.urosario.edu.co/handle/10336/10830
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- The college admissions problem is not equivalent to the marriage problem
- Manipulation via capacities in two-sided matching markets
- A class of multipartner matching markets with a strong lattice structure
- The College Admissions Problem Revisited
- Machiavelli and the Gale-Shapley Algorithm
- The Economics of Matching: Stability and Incentives
- Job Matching, Coalition Formation, and Gross Substitutes
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Stability and Polarization of Interests in Job Matching
- Truncation Strategies in Matching Markets
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- On preferences over subsets and the lattice structure of stable matchings
- Three remarks on the many-to-many stable matching problem
- Stable many-to-many matchings with contracts
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Incentives in two-sided matching with random stable mechanisms
- Implementation in the many-to-many matching market.
- An algorithm to compute the full set of many-to-many stable matchings.
- Manipulability in matching markets: conflict and coincidence of interests
- The lattice structure of the set of stable outcomes of the multiple partners assignment game
- Credible group stability in many-to-many matching problems
- Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions
- A many-to-many `rural hospital theorem'
- Optimal truncation in matching markets
- The singleton core in the college admissions problem and its application to the national resident matching program (NRMP)
Cited In (4)
This page was built for publication: On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404743)