How the Experts Algorithm Can Help Solve LPs Online

  title={How the Experts Algorithm Can Help Solve LPs Online},
  author={Anupam Gupta and Marco Molinaro},
  journal={Math. Oper. Res.},
  • Anupam Gupta, Marco Molinaro
  • Published 2016
  • Computer Science, Mathematics
  • Math. Oper. Res.
  • We consider the problem of solving packing/covering LPs online, when the columns of the constraint matrix are presented in random order. This problem has received much attention, and the main focus is to figure out how large the right-hand sides of the LPs have to be (compared to the entries on the left-hand side of the constraints) to allow (1 + ɛ )-approximations online. It is known that the right-hand sides have to be Ω( ɛ −2 log m ) times the left-hand sides, where m is the number of… CONTINUE READING

    Topics from this paper.

    Fast Algorithms for Online Stochastic Convex Programming
    • 85
    • PDF
    Linear Contextual Bandits with Knapsacks
    • 37
    • PDF
    Designing smoothing functions for improved worst-case competitive ratio in online optimization
    • 24
    • PDF
    Linear Contextual Bandits with Global Constraints and Objective
    • 10
    • PDF
    Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy
    • 12
    • PDF
    Robust Algorithms for the Secretary Problem
    • 8
    • PDF
    Scheduling Frameworks for Cloud Container Services
    • 10
    • PDF


    Publications referenced by this paper.