The sample complexity of revenue maximization
From MaRDI portal
Publication:5259558
DOI10.1145/2591796.2591867zbMath1315.91026arXiv1502.00963OpenAlexW2164143329MaRDI QIDQ5259558
Tim Roughgarden, Richard John Cole
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.00963
Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (21)
The Limitations of Optimization from Samples ⋮ Revenue-Maximizing Auctions: A Bidder’s Standpoint ⋮ Improving multi-armed bandit algorithms in online pricing settings ⋮ Applications of $$\alpha $$-Strongly Regular Distributions to Bayesian Auctions ⋮ Pricing with Samples ⋮ Optimal multi-unit mechanisms with private demands ⋮ Bayesian auctions with efficient queries ⋮ Improved two sample revenue guarantees via mixed-integer linear programming ⋮ Performance bounds for optimal sales mechanisms beyond the monotone hazard rate condition ⋮ Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets ⋮ A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders ⋮ Canadian traveller problem with predictions ⋮ Brief Announcement: Bayesian Auctions with Efficient Queries. ⋮ Making the Most of Your Samples ⋮ Full surplus extraction from samples ⋮ From pricing to prophets, and back! ⋮ Robust Auctions for Revenue via Enhanced Competition ⋮ Unnamed Item ⋮ Incentive-Compatible Learning of Reserve Prices for Repeated Auctions ⋮ Regret-minimizing Bayesian persuasion ⋮ Learning in Repeated Auctions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: The sample complexity of revenue maximization
