Pages that link to "Item:Q1949759"
From MaRDI portal
The following pages link to A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759):
Displayed 13 items.
- Truthful mechanism design via correlated tree rounding (Q526848) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
- No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← 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 anarchy of scheduling without money (Q2420568) (← links)
- The Anarchy of Scheduling Without Money (Q2819467) (← links)
- The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)