Improved two sample revenue guarantees via mixed-integer linear programming

DOI10.1007/978-3-030-85947-3_1zbMath1491.91080arXiv2103.00235OpenAlexW3203696190MaRDI QIDQ2670901

Mete Şeref Ahunbay, Adrian Vetta

Publication date: 1 June 2022

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites Work

• Revenue maximization with a single sample
• Optimal Auction Design
• Making the Most of Your Samples
• Efficient empirical revenue maximization in single-parameter auction environments
• Settling the sample complexity of single-parameter revenue maximization
• The sample complexity of revenue maximization
• The sample complexity of auctions with side information

This page was built for publication: Improved two sample revenue guarantees via mixed-integer linear programming