Pages that link to "Item:Q2643141"
From MaRDI portal
The following pages link to Truthful approximation mechanisms for scheduling selfish related machines (Q2643141):
Displaying 10 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)
- Maximizing the minimum load for selfish agents (Q1041221) (← 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)
- Private Capacities in Mechanism Design (Q3182917) (← links)
