27 citations · 95 across the 19 of their papers we have counts for
20 papers
Online Bipartite Matching with Reusable Capacity under Non-Stationary Rewards
Xi Chen, Shixin Wang, Bingkun Zhou +1
We study online bipartite matching with reusable server capacity and non-stationary rewards. Jobs arrive sequentially, reveal compatible servers, reward rates, and processing durat…
Continuum-armed Bandit Optimization with Batch Pairwise Comparison Oracles
Xiangyu Chang, Xi Chen, Yining Wang +1
This paper studies a bandit optimization problem where the goal is to maximize a function over periods for some unknown strongly concave function . We consider a new…
Dynamic Pricing with Adversarially-Censored Demands
Jianyu Xu, Yining Wang, Xi Chen +1
We study an online dynamic pricing problem where the potential demand at each time period is stochastic and dependent on the price. However, a perishable inventor…
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
Xi Chen, Mo Liu, Yining Wang +1
In this paper, we consider a multi-stage dynamic assortment optimization problem with multi-nomial choice modeling (MNL) under resource knapsack constraints. Given the current reso…
Utility Fairness in Contextual Dynamic Pricing with Demand Learning
Xi Chen, David Simchi-Levi, Yining Wang
This paper introduces a novel contextual bandit algorithm for personalized pricing under utility fairness constraints in scenarios with uncertain demand, achieving an optimal regre…
Dynamic Car Dispatching and Pricing: Revenue and Fairness for Ridesharing Platforms
Zishuo Zhao, Xi Chen, Xuefeng Zhang +1
A major challenge for ridesharing platforms is to guarantee profit and fairness simultaneously, especially in the presence of misaligned incentives of drivers and riders. We focus…