Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Katrina Ligett
2010 – today
- 2013
[j5]Avrim Blum, Katrina Ligett, Aaron Roth: A learning theory approach to noninteractive database privacy. J. ACM 60(2): 12 (2013)- [c18]Arpita Ghosh, Katrina Ligett: Privacy and coordination: computing on databases with endogenous participation. ACM Conference on Electronic Commerce 2013: 543-560
- [c17]Euiwoong Lee, Katrina Ligett: Improved bounds on the price of stability in network cost sharing games. ACM Conference on Electronic Commerce 2013: 607-620
- 2012
- [j4]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth: The Power of Fair Pricing Mechanisms. Algorithmica 63(3): 634-644 (2012)
- [c16]Moritz Hardt, Katrina Ligett, Frank McSherry: A Simple and Practical Algorithm for Differentially Private Data Release. NIPS 2012: 2348-2356
- [c15]Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky: Beyond myopic best response (in Cournot competition). SODA 2012: 993-1005
- [c14]Katrina Ligett, Aaron Roth: Take It or Leave It: Running a Survey When Privacy Comes at a Cost. WINE 2012: 378-391
- [i6]Katrina Ligett, Aaron Roth: Take it or Leave it: Running a Survey when Privacy Comes at a Cost. CoRR abs/1202.4741 (2012)
- 2011
- [j3]Katrina Ligett, Georgios Piliouras: Beating the best Nash without regret. SIGecom Exchanges 10(1): 23-26 (2011)
- [c13]Robert D. Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos: Beyond the Nash Equilibrium Barrier. ICS 2011: 125-140
- [i5]Avrim Blum, Katrina Ligett, Aaron Roth: A Learning Theory Approach to Non-Interactive Database Privacy. CoRR abs/1109.2229 (2011)
- 2010
- [j2]Avrim Blum, Eyal Even-Dar, Katrina Ligett: Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games. Theory of Computing 6(1): 179-199 (2010)
- [c12]George Christodoulou, Katrina Ligett, Evangelia Pyrga: Contention Resolution under Selfishness. ICALP (2) 2010: 430-441
- [c11]Steve Chien, Katrina Ligett, Andrew McGregor: Space-Efficient Estimation of Robust Statistics and Distribution Testing. ICS 2010: 251-265
- [c10]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth: The Power of Fair Pricing Mechanisms. LATIN 2010: 554-564
- [c9]Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Combinatorial Optimization. SODA 2010: 1106-1125
- [i4]Jon M. Kleinberg, Katrina Ligett: Information-Sharing and Privacy in Social Networks. CoRR abs/1003.0469 (2010)
- [i3]Robert Kleinberg, Katrina Ligett: Privacy-Compatibility For General Utility Metrics. CoRR abs/1010.2705 (2010)
- [i2]Moritz Hardt, Katrina Ligett, Frank McSherry: A simple and practical algorithm for differentially private data release. CoRR abs/1012.4763 (2010)
2000 – 2009
- 2009
- [j1]Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett: Playing Games with Approximation Algorithms. SIAM J. Comput. 39(3): 1088-1106 (2009)
- [c8]Shuheng Zhou, Katrina Ligett, Larry A. Wasserman: Differential privacy with compression. ISIT 2009: 2718-2722
- [c7]George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee: On the Price of Stability for Undirected Network Design. WAOA 2009: 86-97
- [i1]Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar: Differentially Private Approximation Algorithms. CoRR abs/0903.4510 (2009)
- 2008
- [c6]Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth: The Price of Stochastic Anarchy. SAGT 2008: 303-314
- [c5]Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth: Regret minimization and the price of total anarchy. STOC 2008: 373-382
- [c4]Avrim Blum, Katrina Ligett, Aaron Roth: A learning theory approach to non-interactive database privacy. STOC 2008: 609-618
- 2007
- [c3]David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang: Compressing rectilinear pictures and minimizing access control lists. SODA 2007: 1066-1075
- [c2]Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett: Playing games with approximation algorithms. STOC 2007: 546-555
- 2006
- [c1]Avrim Blum, Eyal Even-Dar, Katrina Ligett: Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. PODC 2006: 45-52
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:51 CEST by the dblp team