activity
20182021
most citedFairness Maximization among Offline Agents in Online-Matching Markets

3 citations · 7 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2020

Group-level Fairness Maximization in Online Bipartite Matching

Will Ma, Pan Xu, Yifan Xu

We consider the allocation of limited resources to heterogeneous customers who arrive in an online fashion. We would like to allocate the resources "fairly", so that no group of cu…

cs.DS2019

Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints

Elaheh Fata, Will Ma, David Simchi-Levi

We consider an assortment optimization problem where a customer chooses a single item from a sequence of sets shown to her, while limited inventories constrain the items offered to…

cs.DS20192 cited

Prophet Inequalities on the Intersection of a Matroid and a Graph

Jackie Baek, Will Ma

We consider prophet inequalities in a setting where agents correspond to both elements in a matroid and vertices in a graph. A set of agents is feasible if they form both an indepe…

cs.DS20191 cited

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-dependent Competitive Ratios

Will Ma, David Simchi-Levi

Motivated by the dynamic assortment offerings and item pricings occurring in e-commerce, we study a general problem of allocating finite inventories to heterogeneous customers arri…

cs.DS2018

On Policies for Single-leg Revenue Management with Limited Demand Information

Will Ma, David Simchi-Levi, Chung-Piaw Teo

In this paper we study the single-item revenue management problem, with no information given about the demand trajectory over time. When the item is sold through accepting/rejectin…