The following pages link to (Q4910748):
Displaying 7 items.
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- A proof of the Nisan-Ronen conjecture (Q6499256) (← links)
