Pages that link to "Item:Q344791"
From MaRDI portal
The following pages link to Approximate composable truthful mechanism design (Q344791):
Displaying 8 items.
- Mechanism design for the truthful elicitation of costly probabilistic estimates in distributed information systems (Q543619) (← links)
- Generalized assignment problem: truthful mechanism design without money (Q1727952) (← links)
- No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
- Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension (Q2941531) (← links)
- (Q3455573) (← links)
- Truthful and Near-Optimal Mechanism Design via Linear Programming (Q5395669) (← links)
- Characterizing Truthful Multi-armed Bandit Mechanisms (Q5419036) (← links)
- Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives (Q6100445) (← links)