Bounding the menu-size of approximately optimal auctions via optimal-transport duality

DOI10.1145/3188745.3188786zbMath1430.91045arXiv1708.08907OpenAlexW2962924022MaRDI QIDQ5230282

Yannai A. Gonczarowski

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

upper bounddualitylower boundauctionrevenue maximizationapproximate revenue maximizationmenu size

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (4)

Buy-many mechanisms are not much better than item pricing ⋮ The menu-size complexity of revenue approximation ⋮ The Complexity of Contracts ⋮ Selling multiple correlated goods: revenue maximization and menu-size complexity

This page was built for publication: Bounding the menu-size of approximately optimal auctions via optimal-transport duality