Pages that link to "Item:Q3465944"
From MaRDI portal
The following pages link to The Complexity of Computing the Random Priority Allocation Matrix (Q3465944):
Displaying 9 items.
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Complexity of finding Pareto-efficient allocations of highest welfare (Q2030716) (← links)
- A pessimist's approach to one-sided matching (Q2103007) (← links)
- Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity (Q2289006) (← links)
- Size versus truthfulness in the house allocation problem (Q2319628) (← links)
- Random Serial Dictatorship: The One and Only (Q5108269) (← links)
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
- Game-theoretically secure protocols for the ordinal random assignment problem (Q6535137) (← links)
- On Pareto optimal balanced exchanges (Q6564189) (← links)
