Skip to content
VuFind
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
    • 日本語
    • Nederlands
    • Português
    • Português (Brasil)
    • 中文(简体)
    • 中文(繁體)
    • Türkçe
    • עברית
    • Gaeilge
    • Cymraeg
    • Ελληνικά
    • Català
    • Euskara
    • Русский
    • Čeština
    • Suomi
    • Svenska
    • polski
    • Dansk
    • slovenščina
    • اللغة العربية
    • বাংলা
    • Galego
    • Tiếng Việt
    • Hrvatski
    • हिंदी
    • Հայերէն
    • Українська
    • Sámegiella
    • Монгол
Advanced
  • Optimizing Offer Sets in Sub-L...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Optimizing Offer Sets in Sub-Linear Time

Optimizing Offer Sets in Sub-Linear Time

Bibliographic Details
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
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

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)
  • Shift Finding in Sub-linear Time
    by: Andoni, Alexandr, et al.
    Published: (2014)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs