The following pages link to (Q5417684):
Displaying 11 items.
- Approximate composable truthful mechanism design (Q344791) (← links)
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
- Truthful approximation mechanisms for scheduling selfish related machines (Q2643141) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- A deterministic truthful PTAS for scheduling related machines (Q2862203) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- STACS 2004 (Q5309735) (← links)
- STACS 2005 (Q5710720) (← links)