Simple and Nearly Optimal Multi-Item Auctions

DOI10.1137/1.9781611973105.41zbMath1426.91132arXiv1210.3560OpenAlexW2952252631MaRDI QIDQ5741749

Yang Cai, Zhi-Yi Huang

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

polynomial time approximation schemeallocation ruleBayesian optimal multi-item multi-bidder auction

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)

Related Items (6)

The complexity of optimal multidimensional pricing for a unit-demand buyer ⋮ Optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations ⋮ Extreme value theorems for optimal multidimensional pricing ⋮ A Duality-Based Unified Approach to Bayesian Mechanism Design ⋮ Duality and Optimality of Auctions for Uniform Distributions ⋮ Bounding the optimal revenue of selling multiple goods

This page was built for publication: Simple and Nearly Optimal Multi-Item Auctions