research
∙
04/27/2023
Dynamic Pricing and Learning with Bayesian Persuasion
We consider a novel dynamic pricing and learning setting where in additi...
share
research
∙
09/25/2022
Online Allocation and Learning in the Presence of Strategic Agents
We study the problem of allocating T sequentially arriving items among n...
research
∙
06/08/2021
Scale Free Adversarial Multi Armed Bandits
We consider the Scale-Free Adversarial Multi Armed Bandit(MAB) problem, ...
research
∙
03/09/2021
Dynamic Pricing and Learning under the Bass Model
We consider a novel formulation of the dynamic pricing and demand learni...
research
∙
11/12/2019
On optimal ordering in the optimal stopping problem
In the classical optimal stopping problem, a player is given a sequence ...
research
∙
06/11/2019
Reinforcement Learning for Integer Programming: Learning to Cut
Integer programming (IP) is a general optimization framework widely appl...
research
∙
06/07/2019
Dynamic First Price Auctions Robust to Heterogeneous Buyers
We study dynamic mechanisms for optimizing revenue in repeated auctions,...
research
∙
05/10/2019
Learning in structured MDPs with convex cost functions: Improved regret bounds for inventory management
We consider a stochastic inventory control problem under censored demand...
research
∙
01/29/2019
Discretizing Continuous Action Space for On-Policy Optimization
In this work, we show that discretizing action space for continuous cont...
research
∙
09/27/2018
Boosting Trust Region Policy Optimization by Normalizing Flows Policy
We propose to improve trust region policy search with normalizing flows ...
research
∙
09/13/2018
Submodular Secretary Problem with Shortlists
In , the goal is to select k items in a randomly ordered input so as to ...
research
∙
06/10/2018
Implicit Policy for Reinforcement Learning
We introduce Implicit Policy, a general class of expressive policies tha...
research
∙
05/04/2018
Exploration by Distributional Reinforcement Learning
We propose a framework based on distributional reinforcement learning an...
research
∙
03/01/2018
Robust Repeated Auctions under Heterogeneous Buyer Behavior
We study revenue optimization in a repeated auction between a single sel...
research
∙
09/20/2017
Bandits with Delayed Anonymous Feedback
We study the bandits with delayed anonymous feedback problem, a variant ...
research
∙
06/10/2015
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives
We consider a contextual version of multi-armed bandit problem with glob...
research
∙
09/15/2012
Further Optimal Regret Bounds for Thompson Sampling
Thompson Sampling is one of the oldest heuristics for multi-armed bandit...
research
∙
09/15/2012