Pages that link to "Item:Q308625"
From MaRDI portal
The following pages link to Fairness and group-strategyproofness clash in assignment problems (Q308625):
Displaying 13 items.
- Strategy-proof and fair assignment is wasteful (Q738936) (← links)
- Efficient and fair assignment mechanisms are strongly group manipulable (Q1729671) (← links)
- Ex-post favoring ranks: a fairness notion for the random assignment problem (Q2059097) (← links)
- Efficient mixtures of priority rules for assigning objects (Q2078057) (← links)
- Group strategy-proof probabilistic voting with single-peaked preferences (Q2092786) (← links)
- On endowments and indivisibility: partial ownership in the Shapley-Scarf model (Q2205990) (← links)
- When are efficient and fair assignment mechanisms group strategy-proof? (Q2291174) (← links)
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results (Q2675456) (← links)
- Random Serial Dictatorship: The One and Only (Q5108269) (← links)
- Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
- Exchange of indivisible goods under matroid constraints (Q6145529) (← links)
- The fractional Boston random assignment rule and its axiomatic characterization (Q6541989) (← links)
- Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure (Q6556194) (← links)