The following pages link to Scheduling without payments (Q1678760):
Displaying 11 items.
- Heterogeneous facility location without money (Q290519) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- Average-case approximation ratio of scheduling without payments (Q2032343) (← links)
- Multi-unit assignment under dichotomous preferences (Q2173167) (← links)
- The anarchy of scheduling without money (Q2420568) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- The Anarchy of Scheduling Without Money (Q2819467) (← links)
- (Q5111230) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
