Pages that link to "Item:Q402069"
From MaRDI portal
The following pages link to Strategy-proof stochastic assignment (Q402069):
Displayed 26 items.
- Fairness and group-strategyproofness clash in assignment problems (Q308625) (← links)
- A new perspective on Kesten's school choice with consent idea (Q472219) (← links)
- On stable and strategy-proof rules in matching markets with contracts (Q508382) (← links)
- On the operation of multiple matching markets (Q516981) (← links)
- Strategy-proof and fair assignment is wasteful (Q738936) (← links)
- The object allocation problem with random priorities (Q1651226) (← links)
- Equivalence of efficiency notions for ordinal assignment problems (Q1668490) (← links)
- Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object (Q1680102) (← links)
- Size versus truncation robustness in the assignment problem (Q1985723) (← links)
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem (Q1995295) (← links)
- Corrigendum to: ``Efficiency and stability under substitutable priorities with ties'' (Q2155235) (← links)
- Continuity and incentive compatibility in cardinal mechanisms (Q2178581) (← links)
- Strategy-proof improvements upon deferred acceptance: a maximal domain for possibility (Q2273939) (← links)
- Size versus fairness in the assignment problem (Q2343388) (← links)
- Fairness and efficiency in strategy-proof object allocation mechanisms (Q2359384) (← links)
- Efficient lottery design (Q2362194) (← links)
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem (Q2411514) (← links)
- Strategy-proof Pareto-improvement (Q2415985) (← links)
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results (Q2675456) (← links)
- Strategy-proof allocation with outside option (Q2681500) (← links)
- On mechanisms eliciting ordinal preferences (Q4612470) (← links)
- Random Serial Dictatorship: The One and Only (Q5108269) (← links)
- On wastefulness of random assignments in discrete allocation problems (Q6113818) (← links)
- Outside options in neutral allocation of discrete resources (Q6156321) (← links)
- Strategy-proof and envy-free random assignment (Q6163283) (← links)
- A new impossibility result for random assignments (Q6170029) (← links)
