Pages that link to "Item:Q2941531"
From MaRDI portal
The following pages link to Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension (Q2941531):
Displaying 6 items.
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- Setting lower bounds on truthfulness (Q1651232) (← links)
- No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
- General truthfulness characterizations via convex analysis (Q2667284) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)