Pages that link to "Item:Q2930317"
From MaRDI portal
The following pages link to Mechanism design for fractional scheduling on unrelated machines (Q2930317):
Displayed 12 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← 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)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- The anarchy of scheduling without money (Q2420568) (← links)
- The Anarchy of Scheduling Without Money (Q2819467) (← links)
- Recent Developments in the Mechanism Design Problem for Scheduling (Q3004649) (← links)
- THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING (Q3144935) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)