Pages that link to "Item:Q2021788"
From MaRDI portal
The following pages link to Two-sided strategy-proofness in many-to-many matching markets (Q2021788):
Displaying 18 items.
- Many-to-many matching with max-min preferences (Q477355) (← links)
- On the operation of multiple matching markets (Q516981) (← links)
- The blocking lemma and strategy-proofness in many-to-many matchings (Q523460) (← links)
- The blocking lemma for a many-to-one matching model (Q617603) (← links)
- Manipulation via capacities in two-sided matching markets (Q1381985) (← links)
- Strategy-proofness of worker-optimal matching with continuously transferable utility (Q1651280) (← links)
- Choice function-based two-sided markets: stability, lattice property, path independence and algorithms (Q1736601) (← links)
- On group strategy-proof mechanisms for a many-to-one matching model (Q1764287) (← links)
- Stability of equilibrium outcomes under deferred acceptance: acyclicity and dropping strategies (Q2098899) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- A one-sided many-to-many matching problem (Q2402821) (← links)
- An incompatibility between recursive unanimity and strategy-proofness in two-sided matching problems (Q2452262) (← links)
- Credible group stability in many-to-many matching problems (Q2496782) (← links)
- A necessary and sufficient condition for stable matching rules to be strategy-proof (Q2513288) (← links)
- When Can Manipulations be Avoided in Two-Sided Matching Markets? -- Maximal Domain Results (Q3394931) (← links)
- A Truthful Cardinal Mechanism for One-Sided Matching (Q5146917) (← links)
- Strategy‐proof and group strategy‐proof stable mechanisms: An equivalence (Q6077637) (← links)
- Unique stable matchings (Q6176757) (← links)
