research
∙
08/18/2023
When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
We study the problem of vertex-weighted online bipartite matching with s...
share
research
∙
10/05/2021
Periodic Reranking for Online Matching of Reusable Resources
We consider a generalization of the vertex weighted online bipartite mat...
research
∙
10/01/2021
Adwords with Unknown Budgets
Motivated by applications in automated budget optimization, we consider ...
research
∙
07/06/2021
Submodular Order Functions and Assortment Optimization
We define a new class of set functions that in addition to being monoton...
research
∙
10/08/2020
Online Allocation of Reusable Resources via Algorithms Guided by Fluid Approximations
We consider the problem of online allocation (matching and assortments) ...
research
∙
02/06/2020
Online Allocation of Reusable Resources: Achieving Optimal Competitive Ratio
We study the problem of allocating a given set of resources to sequentia...
research
∙
05/29/2019
Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation
The problem of online matching with stochastic rewards is a variant of t...
research
∙
11/17/2017