The menu complexity of ``one-and-a-half-dimensional mechanism design

zbMATH Open1403.91182arXiv1711.02165MaRDI QIDQ4608024FDOQ4608024

Raghuvansh R. Saxena, S. Matthew Weinberg, Ariel Schvartzman

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1711.02165

Recommendations

• The menu-size complexity of revenue approximation
• The menu-size complexity of revenue approximation
• Optimal mechanisms with simple menus
• Bounding the menu-size of approximately optimal auctions via optimal-transport duality
• The complexity of optimal mechanism design

zbMATH Keywords

mechanism designauctionsmenu complexity

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other game-theoretic models (91A40)

Cited In (2)

• Buy-many mechanisms are not much better than item pricing
• The menu-size complexity of revenue approximation

This page was built for publication: The menu complexity of ``one-and-a-half-dimensional mechanism design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608024)