default search action
Linda Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Linda Cai, Jingyi Liu, S. Matthew Weinberg, Chenghan Zhou:
Profitable Manipulations of Cryptographic Self-Selection Are Statistically Detectable. AFT 2024: 30:1-30:23 - [c8]Linda Cai
, Moshe Babaioff
Bundling in Oligopoly: Revenue Maximization with Single-Item Competitors. EC 2024: 465 - [i13]Shivam Gupta, Linda Cai, Sitan Chen:
Faster Diffusion-based Sampling with Randomized Midpoints: Sequential and Parallel. CoRR abs/2406.00924 (2024) - [i12]Moshe Babaioff, Linda Cai, Brendan Lucier:
Bundling in Oligopoly: Revenue Maximization with Single-Item Competitors. CoRR abs/2406.13835 (2024) - [i11]Linda Cai, Jingyi Liu, S. Matthew Weinberg, Chenghan Zhou:
Profitable Manipulations of Cryptographic Self-Selection are Statistically Detectable. CoRR abs/2407.16949 (2024) - 2023
- [j1]Hedyeh Beyhaghi, Linda Cai:
Recent Developments in Pandora's Box Problem: Variants and Applications. SIGecom Exch. 21(1): 20-34 (2023) - [c7]Hedyeh Beyhaghi, Linda Cai:
Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS. STOC 2023: 803-816 - [c6]Linda Cai, Joshua Gardner, S. Matthew Weinberg:
Optimal Stopping with Multi-dimensional Comparative Loss Aversion. WINE 2023: 95-112 - [c5]Linda Cai, S. Matthew Weinberg, Evan Wildenhain, Shirley Zhang:
Selling to Multiple No-Regret Buyers. WINE 2023: 113-129 - [i10]Beomyeol Jeon, Linda Cai, Chirag Shetty, Pallavi Srivastava, Jintao Jiang, Xiaolan Ke, Yitao Meng, Cong Xie, Indranil Gupta:
Baechi: Fast Device Placement of Machine Learning Graphs. CoRR abs/2301.08695 (2023) - [i9]Linda Cai, S. Matthew Weinberg, Evan Wildenhain, Shirley Zhang:
Selling to Multiple No-Regret Buyers. CoRR abs/2307.04175 (2023) - [i8]Hedyeh Beyhaghi, Linda Cai:
Recent Developments in Pandora's Box Problem: Variants and Applications. CoRR abs/2308.12242 (2023) - [i7]Linda Cai, Joshua Gardner, S. Matthew Weinberg:
Optimal Stopping with Multi-Dimensional Comparative Loss Aversion. CoRR abs/2309.14555 (2023) - 2022
- [c4]Linda Cai, Clayton Thomas:
The Short-Side Advantage in Random Matching Markets. SOSA 2022: 257-267 - [i6]Hedyeh Beyhaghi, Linda Cai:
Pandora's Problem with Nonobligatory Inspection: Optimal Structure and a PTAS. CoRR abs/2212.01524 (2022) - 2021
- [c3]Linda Cai, Raghuvansh R. Saxena:
99% Revenue with Constant Enhanced Competition. EC 2021: 224-241 - [i5]Linda Cai, Raghuvansh R. Saxena:
99% Revenue with Constant Enhanced Competition. CoRR abs/2105.08292 (2021) - 2020
- [c2]Beomyeol Jeon
Baechi: fast device placement of machine learning graphs. SoCC 2020: 416-430 - [c1]Linda Cai, Clayton Thomas, S. Matthew Weinberg
Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms When Demand Queries Are NP-Hard. ITCS 2020: 61:1-61:32
2010 – 2019
- 2019
- [i4]Linda Cai, Clayton Thomas, S. Matthew Weinberg:
Implementation in Advised Strategies: Welfare Guarantees from Posted-Price Mechanisms when Demand Queries are NP-hard. CoRR abs/1910.04342 (2019) - [i3]Linda Cai, Clayton Thomas:
Representing All Stable Matchings by Walking a Maximal Chain. CoRR abs/1910.04401 (2019) - [i2]Linda Cai, Clayton Thomas:
The Short-Side Advantage in Random Matching Markets. CoRR abs/1910.04406 (2019) - 2018
- [i1]Linda Cai, Sariel Har-Peled, Simiao Ye:
Separators for Planar Graphs that are Almost Trees. CoRR abs/1808.02815 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: