Pages that link to "Item:Q1792559"
From MaRDI portal
The following pages link to No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559):
Displaying 4 items.
- Spanning tree auctions: a complete characterization (Q518710) (← links)
- Strongly polynomial-time truthful mechanisms in one shot (Q1014632) (← links)
- Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546) (← links)
- Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension (Q2941531) (← links)