The Problem MDMDP(V): Multi-Dimensional Mechanism Design Problem - - PowerPoint PPT Presentation
The Problem MDMDP(V): Multi-Dimensional Mechanism Design Problem for class V Revenue maximization approximation Single buyer, single seller Buyers values drawn from a distribution New Hardness of Approximation Results Hard
Problem for class V
Matroid-Based
Hard Hard Hard Hard
Additive, Unit-demand
Easy
Approximation- preserving reduction (CDW ‘13) Previously unknown if reduction exists Approximation- preserving reduction (this paper)
Approximation- preserving reduction (CDW ‘13) Previously unknown if reduction exists Approximation- preserving reduction (this paper) Hard instance for ODP(matroid-based) (even to get non-trivial approximation) Hard instance for ODP(matroid-based) (even to get non-trivial approximation)
Implies Found