research
∙
05/24/2023
No-Regret Online Prediction with Strategic Experts
We study a generalization of the online binary prediction with expert ad...
share
research
∙
07/07/2022
Interactive Combinatorial Bandits: Balancing Competitivity and Complementarity
We study non-modular function maximization in the online interactive ban...
research
∙
11/15/2021
Faster First-Order Algorithms for Monotone Strongly DR-Submodular Maximization
Continuous DR-submodular functions are a class of generally non-convex/n...
research
∙
06/15/2021
Improved Regret Bounds for Online Submodular Maximization
In this paper, we consider an online optimization problem over T rounds ...
research
∙
12/23/2020
Function Design for Improved Competitive Ratio in Online Resource Allocation with Procurement Costs
We study the problem of online resource allocation, where multiple custo...
research
∙
05/29/2020
Online DR-Submodular Maximization with Stochastic Cumulative Constraints
In this paper, we consider online continuous DR-submodular maximization ...
research
∙
06/30/2019
Online Continuous DR-Submodular Maximization with Long-Term Budget Constraints
In this paper, we study a class of online optimization problems with lon...
research
∙
06/30/2019