Smoothed Analysis of Online Non-parametric Auctions-Reference-Cited by-同舟云学术

Smoothed Analysis of Online Non-parametric Auctions

Published:2023-07-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 24th ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Durvasula Naveen¹^ORCID,Haghtalab Nika¹^ORCID,Zampetakis Manolis¹^ORCID

Affiliation:

1. UC Berkeley, Berkeley, CA, United States of America

Funder

Army Research Office

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3580507.3597787

Reference39 articles.

1. Scale-sensitive dimensions, uniform convergence, and learnability

2. Martin Anthony Peter L Bartlett Peter L Bartlett etal 1999. Neural network learning: Theoretical foundations. Vol. 9. Cambridge University Press Cambridge. Martin Anthony Peter L Bartlett Peter L Bartlett et al. 1999. Neural network learning: Theoretical foundations. Vol. 9. Cambridge University Press Cambridge.

3. Maria-Florina Balcan and Avrim Blum . 2006 . Approximation algorithms and online mechanisms for item pricing . In Proceedings of the 7th ACM Conference on Economics and Computation (EC). 29--35 . Maria-Florina Balcan and Avrim Blum. 2006. Approximation algorithms and online mechanisms for item pricing. In Proceedings of the 7th ACM Conference on Economics and Computation (EC). 29--35.

4. Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization

5. Shai Ben-David , Dávid Pál , and Shai Shalev-Shwartz . 2009 . Agnostic Online Learning .. In Proceedings of the Conference on Learning Theory (COLT). Shai Ben-David, Dávid Pál, and Shai Shalev-Shwartz. 2009. Agnostic Online Learning.. In Proceedings of the Conference on Learning Theory (COLT).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10