research
∙
06/14/2023
The Secretary Problem with Predictions
The value maximization version of the secretary problem is the problem o...
share
research
∙
04/11/2023
Bayes correlated equilibria and no-regret dynamics
This paper explores equilibrium concepts for Bayesian games, which are f...
research
∙
06/13/2022
Lazy and Fast Greedy MAP Inference for Determinantal Point Process
The maximum a posteriori (MAP) inference for determinantal point process...
research
∙
12/12/2021
Algorithmic Bayesian persuasion with combinatorial actions
Bayesian persuasion is a model for understanding strategic information r...
research
∙
06/02/2020
Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
This paper proposes a new framework for providing approximation guarante...
research
∙
05/13/2019
An improved algorithm for the submodular secretary problem with a cardinality constraint
We study the submodular secretary problem with a cardinality constraint....
research
∙
04/24/2019
Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio
We propose a new concept named adaptive submodularity ratio to study the...
research
∙
09/07/2018
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
In dictionary selection, several atoms are selected from finite candidat...
research
∙
03/29/2018
