Pages that link to "Item:Q2862203"
From MaRDI portal
The following pages link to A deterministic truthful PTAS for scheduling related machines (Q2862203):
Displaying 14 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
- Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
- The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
- STACS 2004 (Q5309735) (← links)
- (Q5417684) (← links)
- STACS 2005 (Q5710720) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
- Well-behaved online load balancing against strategic jobs (Q6090218) (← links)