The following pages link to (Q2934709):
Displaying 13 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- Truthful optimization using mechanisms with verification (Q391782) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- The power of verification for one-parameter agents (Q1004286) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- Scheduling without payments (Q1678760) (← links)
