no code implementations • 30 Jun 2019 • Omid Sadeghi, Reza Eghbali, Maryam Fazel
In this paper, we study a certain class of online optimization problems, where the goal is to maximize a function that is not necessarily concave and satisfies the Diminishing Returns (DR) property under budget constraints.
no code implementations • NeurIPS 2016 • Reza Eghbali, Maryam Fazel
Online optimization covers problems such as online resource allocation, online bipartite matching, adwords (a central problem in e-commerce and advertising), and adwords with separable concave returns.
no code implementations • 27 Oct 2014 • Reza Eghbali, Jon Swenson, Maryam Fazel
Online optimization problems arise in many resource allocation tasks, where the future demands for each resource and the associated utility functions change over time and are not known apriori, yet resources need to be allocated at every point in time despite the future uncertainty.
