Pages that link to "Item:Q2453028"
From MaRDI portal
The following pages link to The computational complexity of random serial dictatorship (Q2453028):
Displaying 19 items.
- Parametrized algorithms for random serial dictatorship (Q477775) (← links)
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Universal Pareto dominance and welfare for plausible utility functions (Q745015) (← links)
- On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
- The impossibility of extending random dictatorship to weak preferences (Q1668159) (← links)
- On the consistency of random serial dictatorship (Q1670191) (← links)
- Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741) (← links)
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem (Q1995295) (← links)
- Efficient mixtures of priority rules for assigning objects (Q2078057) (← links)
- A pessimist's approach to one-sided matching (Q2103007) (← links)
- A note on the serial dictatorship with project closures (Q2450713) (← links)
- The computational complexity of random serial dictatorship (Q2453028) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- The vigilant eating rule: a general approach for probabilistic economic design with constraints (Q2675446) (← links)
- On the stable matchings that can be reached when the agents go marching in one by one (Q2832573) (← links)
- (Q2937743) (redirect page) (← links)
- The Complexity of Computing the Random Priority Allocation Matrix (Q3465944) (← links)
- Inefficiency of random serial dictatorship under incomplete information (Q6090465) (← links)
- Bounded incentives in manipulating the probabilistic serial rule (Q6142601) (← links)
