Pages that link to "Item:Q2441234"
From MaRDI portal
The following pages link to A note on object allocation under lexicographic preferences (Q2441234):
Displaying 10 items.
- When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391) (← links)
- Probabilistic assignment: an extension approach (Q1649093) (← links)
- Pareto optimal matchings of students to courses in the presence of prerequisites (Q1662656) (← links)
- Equivalence of efficiency notions for ordinal assignment problems (Q1668490) (← links)
- A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences (Q2034808) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- Submodular optimization views on the random assignment problem (Q2330658) (← links)
- Pareto optimal matchings with lower quotas (Q2409711) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- Incentive properties for ordinal mechanisms (Q5964696) (← links)