Optimizing Offer Sets in Sub-Linear Time
Main Authors: | Farias, Vivek, Li, Andrew, Sinha, Deeksha |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 21st ACM Conference on Economics and Computation
2022
|
Online Access: | https://hdl.handle.net/1721.1/146245 |
Similar Items
-
Set Cover in Sub-linear Time
by: Indyk, Piotr, et al.
Published: (2021) -
Near-Optimal A-B Testing
by: Bhat, Nikhil, et al.
Published: (2021) -
Optimization for online platforms
by: Sinha, Deeksha.
Published: (2021) -
Near-Optimal Entrywise Anomaly Detection for Low-Rank Matrices with Sub-Exponential Noise
by: Farias, Vivek F, et al.
Published: (2022) -
Optimization of courses offer in educational institutions
by: Rafael López Bracho, et al.
Published: (2015-08-01)