Pages that link to "Item:Q2343388"
From MaRDI portal
The following pages link to Size versus fairness in the assignment problem (Q2343388):
Displaying 12 items.
- 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)
- Tight social welfare approximation of probabilistic serial (Q2089061) (← links)
- A pessimist's approach to one-sided matching (Q2103007) (← links)
- Minimal envy and popular matchings (Q2242327) (← links)
- Size versus truthfulness in the house allocation problem (Q2319628) (← links)
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem (Q2411514) (← links)
- On the number of employed in the matching model (Q2425191) (← links)
- Bounded incentives in manipulating the probabilistic serial rule (Q6142601) (← links)
- Strategy-proof and envy-free random assignment (Q6163283) (← links)
- A planner-optimal matching mechanism and its incentive compatibility in a restricted domain (Q6176744) (← links)
- Improved truthful rank approximation for rank-maximal matchings (Q6609179) (← links)
