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 • Buyer’s values drawn from a distribution

New Hardness of Approximation Results Hard Hard Hard Matroid-Based Hard Easy Additive, Unit-demand

Our Results Approximation- preserving reduction (CDW ‘13) MDMDP Approximation- Previously unknown if ODP preserving reduction (this reduction exists paper)

Hard instance for ODP(matroid-based) (even to get non-trivial approximation) Approximation- preserving reduction (CDW ‘13) MDMDP Approximation- Previously unknown if ODP preserving reduction (this reduction exists paper) Found Implies Hard instance for ODP(matroid-based) (even to get non-trivial approximation)