Anna R. Karlin

University of Washington — United States

Decision Sciences · Social Sciences

48h-index10.8kcitations193works1.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Auction Theory and Applications(59), Optimization and Search Problems(54), Consumer Market Behavior and Pricing(37), Complexity and Algorithms in Graphs(28), Advanced Data Storage Technologies(27)

Publications193 total

Price Stability and Improved Buyer Utility with Presentation Design: A Theoretical Study of the Amazon Buy Box
2025Open Access
Non-Adaptive Matroid Prophet Inequalities
Lecture notes in computer science·2024· 1 cited
Maintaining Matroid Intersections Online
Society for Industrial and Applied Mathematics eBooks·2024· 2 cited
Maintaining Matroid Intersections Online
arXiv (Cornell University)·2023Open Access
A (Slightly) Improved Approximation Algorithm for Metric TSP
Operations Research·2023· 31 cited
Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue
Mathematics of Operations Research·2023· 4 cited
A Deterministic Better-than-3/2 Approximation Algorithm for Metric TSP
Lecture notes in computer science·2023· 9 cited
A (Slightly) Improved Deterministic Approximation Algorithm for Metric TSP
arXiv (Cornell University)·2022Open Access
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)·2022· 12 cited
An improved approximation algorithm for the minimum <i>k</i> -edge connected multi-subgraph problem
2022· 6 citedOpen Access
Simple pricing schemes for consumers with evolving values
Games and Economic Behavior·2022· 2 cited
Matroid Partition Property and the Secretary Problem
arXiv (Cornell University)·2021Open Access
Approximately Revenue-Maximizing Auctions for Deliberative Agents
Proceedings of the AAAI Conference on Artificial Intelligence·2021· 9 citedOpen Access
A (slightly) improved approximation algorithm for metric TSP
2021· 113 cited
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP
arXiv (Cornell University)·2021Open Access
An Improved Approximation Algorithm for the Minimum $k$-Edge Connected Multi-Subgraph Problem
arXiv (Cornell University)·2021· 1 citedOpen Access
Beyond Competitive Analysis
Cambridge University Press eBooks·2020
Non-Adaptive Matroid Prophet Inequalities
arXiv (Cornell University)·2020· 1 citedOpen Access
A (Slightly) Improved Approximation Algorithm for Metric TSP
arXiv (Cornell University)·2020· 1 citedOpen Access
An improved approximation algorithm for TSP in the half integral case
2020· 1 citedOpen Access
page 1 of 10Next →

Frequent Co-authors

Jason D. Hartline(8), Henry M. Levy(6), Yossi Azar(5), Andrei Broder(5), Eli Upfal(5), Mark S. Manasse(5), Amos Fiat(4), Jared Saia(4), Pei Cao(4), Edward W. Felten(4), Kai Li(4), Prabhakar Raghavan(4), Stefan Savage(3), David Wetherall(3), Alec Wolman(3), Nitin Sharma(3), Neal Cardwell(3), Michael J. Feeley(3), Susan Owicki(3), Andrew V. Goldberg(3)