Pages that link to "Item:Q4910748"

The following pages link to An improved randomized truthful mechanism for scheduling unrelated machines (Q4910748):

Displaying 17 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)
• 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)
• Setting lower bounds on truthfulness (Q1651232) (← links)
• Scheduling without payments (Q1678760) (← links)
• No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
• A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
• Average-case approximation ratio of scheduling without payments (Q2032343) (← links)
• New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
• Fair by design: multidimensional envy-free mechanisms (Q2345204) (← links)
• The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
• (Q5417684) (← links)
• A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
• On scheduling mechanisms beyond the worst case (Q6670812) (← links)