Sampling and Representation Complexity of Revenue Maximization

DOI10.1007/978-3-319-13129-0_22zbMath1406.91171arXiv1402.4535MaRDI QIDQ2936993

Noam Nisan, Li Han, Shaddin Dughmi

Publication date: 7 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

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

zbMATH Keywords

computational complexity of samples; revenue-maximizing auction

Mathematics Subject Classification ID

91B26: Auctions, bargaining, bidding and selling, and other market models

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)