3 citations · 9 across the 11 of their papers we have counts for
6 papers · 1 filter
Recent Developments in Pandora's Box Problem: Variants and Applications
Hedyeh Beyhaghi, Linda Cai
In 1979, Weitzman introduced Pandora's box problem as a framework for sequential search with costly inspections. Recently, there has been a surge of interest in Pandora's box probl…
Selling to Multiple No-Regret Buyers
Linda Cai, S. Matthew Weinberg, Evan Wildenhain +1
We consider the problem of repeatedly auctioning a single item to multiple i.i.d buyers who each use a no-regret learning algorithm to bid over time. In particular, we study the se…
99% Revenue with Constant Enhanced Competition
Linda Cai, Raghuvansh R. Saxena
The enhanced competition paradigm is an attempt at bridging the gap between simple and optimal auctions. In this line of work, given an auction setting with items and bidde…
Representing All Stable Matchings by Walking a Maximal Chain
Linda Cai, Clayton Thomas
The seminal book of Gusfield and Irving [GI89] provides a compact and algorithmically useful way to represent the collection of stable matches corresponding to a given set of prefe…
The Short-Side Advantage in Random Matching Markets
Linda Cai, Clayton Thomas
A breakthrough of Ashlagi, Kanoria, and Leshno [AKL17] found that imbalance in the number of agents on either side of a random matching market has a profound effect on the market's…
Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms when Demand Queries are NP-hard
Linda Cai, Clayton Thomas, S. Matthew Weinberg
State-of-the-art posted-price mechanisms for submodular bidders with items achieve approximation guarantees of [Assadi and Singla, 2019]. Their truthfulnes…