2 citations · 2 across the 2 of their papers we have counts for
5 papers
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…
Separators for Planar Graphs that are Almost Trees
Linda Cai, Sariel Har-Peled, Simiao Ye
We prove that a connected planar graph with vertices and edges has a vertex separator of size , and this separator can be computed in linear time.