activity
20182023
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 2019Show all

5 papers · 1 filter

cs.GT2019

Revenue-Optimal Deterministic Auctions for Multiple Buyers with Ordinal Preferences over Fixed-price Items

Will Ma

In this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ra…

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.GT20191 cited

Separation between Second Price Auctions with Personalized Reserves and the Revenue Optimal Auction

Will Ma, Balasubramanian Sivan

What fraction of the single item buyers setting's expected optimal revenue MyeRev can the second price auction with reserves achieve? In the special case where the buyers' valu…

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…