Pages that link to "Item:Q2643141"
From MaRDI portal
The following pages link to Truthful approximation mechanisms for scheduling selfish related machines (Q2643141):
Displaying 21 items.
- Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Truthful algorithms for scheduling selfish tasks on parallel machines (Q861258) (← links)
- Copula-based randomized mechanisms for truthful scheduling on two unrelated machines (Q904694) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- On truthfulness and approximation for scheduling selfish tasks (Q1041343) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Tighter price of anarchy for selfish task allocation on selfish machines (Q2082200) (← links)
- Diffusion auction design (Q2667812) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- A deterministic truthful PTAS for scheduling related machines (Q2862203) (← links)
- (Q2951304) (← links)
- Private Capacities in Mechanism Design (Q3182917) (← links)
- Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks in Competitive Real-Time Environments (Q5268114) (← links)
- STACS 2004 (Q5309735) (← links)
- (Q5417684) (← links)
- Structural Information and Communication Complexity (Q5710093) (← links)
- STACS 2005 (Q5710720) (← links)
