Linda Cai

According to our database, Linda Cai authored at least 14 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Faster Diffusion-based Sampling with Randomized Midpoints: Sequential and Parallel.

Shivam Gupta, Linda Cai, Sitan Chen

CoRR, 2024

Bundling in Oligopoly: Revenue Maximization with Single-Item Competitors.

Linda Cai, Moshe Babaioff, Brendan Lucier

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

Profitable Manipulations of Cryptographic Self-Selection Are Statistically Detectable.

Linda Cai, Jingyi Liu, S. Matthew Weinberg, Chenghan Zhou

Proceedings of the 6th Conference on Advances in Financial Technologies, 2024

2023

Recent Developments in Pandora's Box Problem: Variants and Applications.

Hedyeh Beyhaghi, Linda Cai

SIGecom Exch., 2023

Baechi: Fast Device Placement of Machine Learning Graphs.

Beomyeol Jeon, Linda Cai, Chirag Shetty, Pallavi Srivastava, Jintao Jiang, Xiaolan Ke, Yitao Meng, Cong Xie, Indranil Gupta

CoRR, 2023

Selling to Multiple No-Regret Buyers.

Linda Cai, S. Matthew Weinberg, Evan Wildenhain, Shirley Zhang

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Optimal Stopping with Multi-dimensional Comparative Loss Aversion.

Linda Cai, Joshua Gardner, S. Matthew Weinberg

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS.

Hedyeh Beyhaghi, Linda Cai

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

The Short-Side Advantage in Random Matching Markets.

Linda Cai, Clayton Thomas

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

2021

99% Revenue with Constant Enhanced Competition.

Linda Cai, Raghuvansh R. Saxena

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard.

Linda Cai, Clayton Thomas, S. Matthew Weinberg

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Baechi: fast device placement of machine learning graphs.

Beomyeol Jeon, Linda Cai, Pallavi Srivastava, Jintao Jiang, Xiaolan Ke, Yitao Meng, Cong Xie, Indranil Gupta

Proceedings of the SoCC '20: ACM Symposium on Cloud Computing, 2020

2019

Representing All Stable Matchings by Walking a Maximal Chain.

Linda Cai, Clayton Thomas

CoRR, 2019

2018

Separators for Planar Graphs that are Almost Trees.

Linda Cai, Sariel Har-Peled, Simiao Ye

CoRR, 2018