4 citations · 5 across the 4 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2020
Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs
Mitas Ray, Omid Sadeghi, Lillian J. Ratliff +1
We study the problem of online resource allocation, where multiple customers arrive sequentially and the seller must irrevocably allocate resources to each incoming customer while…
math.OC2019★ 4 cited
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints
Omid Sadeghi, Maryam Fazel
In this paper, we study a class of online optimization problems with long-term budget constraints where the objective functions are not necessarily concave (nor convex) but they in…
math.OC2019
Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems
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 Retu…