Pages that link to "Item:Q3525592"
From MaRDI portal
The following pages link to A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms (Q3525592):
Displayed 17 items.
- Truthful optimization using mechanisms with verification (Q391782) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Mechanisms for scheduling with single-bit private values (Q904689) (← links)
- Copula-based randomized mechanisms for truthful scheduling on two unrelated machines (Q904694) (← links)
- Fast payment schemes for truthful mechanisms with verification (Q1006066) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- Scheduling without payments (Q1678760) (← links)
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms (Q1949759) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- Bribeproof Mechanisms for Two-Values Domains (Q2819466) (← links)
- Recent Developments in the Mechanism Design Problem for Scheduling (Q3004649) (← links)
- (Q5111230) (← links)
- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions (Q5900469) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)