Pages that link to "Item:Q2359384"
From MaRDI portal
The following pages link to Fairness and efficiency in strategy-proof object allocation mechanisms (Q2359384):
Displaying 42 items.
- Fairness and group-strategyproofness clash in assignment problems (Q308625) (← links)
- Egalitarian-equivalent Groves mechanisms in the allocation of heterogeneous objects (Q656802) (← links)
- Strategy-proof, efficient, and nonbossy quota allocations (Q836935) (← links)
- Weakly fair allocations and strategy-proofness (Q926330) (← links)
- Pricing for fairness: distributed resource allocation for multiple objectives (Q973022) (← links)
- Random assignment of multiple indivisible objects (Q1005770) (← links)
- Fair solutions to the random assignment problem (Q1633672) (← links)
- On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
- On the consistency of random serial dictatorship (Q1670191) (← links)
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties (Q1680097) (← links)
- Efficient and fair assignment mechanisms are strongly group manipulable (Q1729671) (← links)
- Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741) (← links)
- A general strategy proof fair allocation mechanism (Q1927373) (← links)
- Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
- Stepwise ordinal efficiency for the random assignment problem (Q1996179) (← links)
- Serial dictatorship mechanisms with reservation prices: heterogeneous objects (Q2058845) (← links)
- Ex-post favoring ranks: a fairness notion for the random assignment problem (Q2059097) (← links)
- Strategy-proof popular mechanisms (Q2092775) (← links)
- A pessimist's approach to one-sided matching (Q2103007) (← links)
- A new fairness notion in the assignment of indivisible resources (Q2108757) (← links)
- Serial dictatorship mechanisms with reservation prices (Q2206002) (← links)
- Minimal envy and popular matchings (Q2242327) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- When are efficient and fair assignment mechanisms group strategy-proof? (Q2291174) (← links)
- Shortest paths with ordinal weights (Q2327649) (← links)
- Fair sharing under dichotomous preferences (Q2343801) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- Strategy-proof assignment on the full preference domain (Q2386134) (← links)
- A note on object allocation under lexicographic preferences (Q2441234) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results (Q2675456) (← links)
- Strategy-proof allocation with outside option (Q2681500) (← links)
- Pricing for fairness (Q2931384) (← links)
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
- Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
- Random assignments with uniform preferences: an impossibility result (Q6106541) (← links)
- On wastefulness of random assignments in discrete allocation problems (Q6113818) (← links)
- Strategy-proof and envy-free random assignment (Q6163283) (← links)
- A new impossibility result for random assignments (Q6170029) (← 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)
- On slots' scheduling (Q6559099) (← links)