Katrina Ligett, Ph.D. - Publications

Affiliations: 
2009 Carnegie Mellon University, Pittsburgh, PA 
Area:
Computer Science

17 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Dughmi S, Ligett K, Lucier B. Introduction to the Special Issue – Algorithmic Game Theory – STOC/FOCS/SODA 2014-2015 Games and Economic Behavior. 118: 493. DOI: 10.1016/J.Geb.2019.10.010  0.393
2019 Bhaskar U, Ligett K, Schulman LJ, Swamy C. Achieving target equilibria in network routing games without knowing the latency functions Games and Economic Behavior. 118: 533-569. DOI: 10.1016/J.Geb.2018.02.009  0.346
2015 Barman S, Ligett K. Finding any nontrivial coarse correlated equilibrium is hard Ec 2015 - Proceedings of the 2015 Acm Conference On Economics and Computation. 815-816. DOI: 10.1145/2845926.2845929  0.439
2015 Xu Y, Ligett K. Commitment in first-price auctions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9347: 299. DOI: 10.1007/S00199-017-1069-5  0.386
2015 Barman S, Ligett K, Piliouras G. Approximating nash equilibria in tree polymatrix games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9347: 285-296. DOI: 10.1007/978-3-662-48433-3_22  0.371
2014 Heffetz O, Ligett K. Privacy and data-based research Journal of Economic Perspectives. 28: 75-98. DOI: 10.2139/Ssrn.2324830  0.326
2014 Bhaskar U, Ligett K, Schulman LJ. Network improvement for equilibrium routing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8494: 138-149. DOI: 10.1145/2728732.2728737  0.366
2014 Bhaskar U, Ligett K, Schulman LJ, Swamy C. Achieving target equilibria in network routing games without knowing the latency functions Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 31-40. DOI: 10.1109/FOCS.2014.12  0.309
2014 Christodoulou G, Ligett K, Pyrga E. Contention Resolution under Selfishness Algorithmica. 70: 675-693. DOI: 10.1007/S00453-013-9773-4  0.322
2013 Blum A, Ligett K, Roth A. A learning theory approach to noninteractive database privacy Journal of the Acm. 60. DOI: 10.1145/2450142.2450148  0.553
2012 Fiat A, Koutsoupias E, Ligett K, Mansour Y, Olonetsky S. Beyond myopic best response (in Cournot competition) Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 993-1005. DOI: 10.1016/J.Geb.2013.12.006  0.35
2012 Hardt M, Ligett K, McSherry F. A simple and practical algorithm for differentially private data release Advances in Neural Information Processing Systems. 3: 2339-2347.  0.395
2011 ligett K, Piliouras G. Beating the best Nash without regret Sigecom Exchanges. 10: 23-26. DOI: 10.1145/1978721.1978727  0.342
2011 Chung C, Ligett K, Pruhs K, Roth A. The Power of Fair Pricing Mechanisms Algorithmica (New York). 1-11. DOI: 10.1007/S00453-011-9587-1  0.519
2010 Blum A, Even-Dar E, Ligett K. Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games Theory of Computing. 6: 179-199. DOI: 10.4086/Toc.2010.V006A008  0.552
2007 Kakade SM, Kalai AT, Ligett K. Playing games with approximation algorithms Proceedings of the Annual Acm Symposium On Theory of Computing. 546-555. DOI: 10.1137/070701704  0.576
2006 Blum A, Even-Dar E, Ligett K. Routing without regret: On convergence to nash equilibria of regret-minimizing algorithms in routing games Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 2006: 45-52.  0.403
Show low-probability matches.