The blocking lemma and group incentive compatibility for matching with contracts
From MaRDI portal
(Redirected from Publication:309845)
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
- Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
- College Admissions and the Stability of Marriage
- Group incentive compatibility for matching with contracts
- Job Matching, Coalition Formation, and Gross Substitutes
- Machiavelli and the Gale-Shapley Algorithm
- On group strategy-proof mechanisms for a many-to-one matching model
- On preferences over subsets and the lattice structure of stable matchings
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- Single agents and the set of many-to-one stable matchings
- Some remarks on the stable matching problem
- Stability and Polarization of Interests in Job Matching
- Stability of matchings when individuals have preferences over colleagues
- The Economics of Matching: Stability and Incentives
- The blocking lemma for a many-to-one matching model
- The college admissions problem is not equivalent to the marriage problem
- Voting by Committees
Cited in
(7)- Group incentive compatibility and welfare for matching with contracts
- The blocking lemma and strategy-proofness in many-to-many matchings
- Group incentive compatibility for matching with contracts
- A note on strategy-proofness from the doctor side in matching with contracts
- scientific article; zbMATH DE number 4079106 (Why is no real title available?)
- Equivalence theorem in matching with contracts
- The blocking lemma for a many-to-one matching model
This page was built for publication: The blocking lemma and group incentive compatibility for matching with contracts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309845)