<h1>Ligett, Katrina A.</h1>
<h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Cai, Yang and Echenique, Federico, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200709-084932341">Third-Party Data Providers Ruin Simple Mechanisms</a>; ISBN 9781450379854; SIGMETRICS '20 Abstracts; ACM SIGMETRICS Performance Evaluation Review; Vol. 48; No. 1; 103; <a href="https://doi.org/10.1145/3410048.3410108">10.1145/3410048.3410108</a></li>
<li>Cai, Yang and Echenique, Federico, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190626-155536214">Third-Party Data Providers Ruin Simple Mechanisms</a>; Proceedings of the ACM on Measurement and Analysis of Computing Systems; Vol. 4; No. 1; Art. No. 12; <a href="https://doi.org/10.1145/3379478">10.1145/3379478</a></li>
<li>Bhaskar, Umang and Ligett, Katrina, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180622-082816994">Achieving target equilibria in network routing games without knowing the latency functions</a>; Games and Economic Behavior; Vol. 118; 533-569; <a href="https://doi.org/10.1016/j.geb.2018.02.009">10.1016/j.geb.2018.02.009</a></li>
<li>Ligett, Katrina and Shenfeld, Moshe (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190626-101449888">A necessary and sufficient stability notion for adaptive generalization</a>; <a href="https://doi.org/10.48550/arXiv.1906.00930">10.48550/arXiv.1906.00930</a></li>
<li>Alabi, Daniel and Kalai, Adam Tauman, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190626-145729225">Learning to Prune: Speeding up Repeated Computations</a>; <a href="https://doi.org/10.48550/arXiv.1904.11875">10.48550/arXiv.1904.11875</a></li>
<li>Bechavod, Yahav and Ligett, Katrina, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190626-152715232">Equal Opportunity in Online Classification with Partial Feedback</a>; <a href="https://doi.org/10.48550/arXiv.1902.02242">10.48550/arXiv.1902.02242</a></li>
<li>Immorlica, Nicole and Ligett, Katrina, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190111-072027347">Access to Population-Level Signaling as a Source of Inequality</a>; ISBN 978-1-4503-6125-5; Proceedings of the Conference on Fairness, Accountability, and Transparency; 249-258; <a href="https://doi.org/10.1145/3287560.3287579">10.1145/3287560.3287579</a></li>
<li>Fiat, Amos and Koutsoupias, Elias, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190312-141425964">Beyond myopic best response (in Cournot competition)</a>; Games and Economic Behavior; Vol. 113; 38-57; <a href="https://doi.org/10.1016/j.geb.2013.12.006">10.1016/j.geb.2013.12.006</a></li>
<li>Böhme, Rainer and Clayton, Richard, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190110-110039117">Special Issue on the Economics of Security and Privacy: Guest Editors' Introduction</a>; ACM Transactions on Internet Technology; Vol. 18; No. 4; Art. No. 47; <a href="https://doi.org/10.1145/3216902">10.1145/3216902</a></li>
<li>Xu, Yunjian and Ligett, Katrina (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180816-074937577">Commitment in first-price auctions</a>; Economic Theory; Vol. 66; No. 2; 449-489; <a href="https://doi.org/10.1007/s00199-017-1069-5">10.1007/s00199-017-1069-5</a></li>
<li>Ligett, Katrina and Neel, Seth, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190107-104411349">Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained ERM</a>; <a href="https://doi.org/10.48550/arXiv.1705.10829">10.48550/arXiv.1705.10829</a></li>
<li>Bechavod, Yahav and Ligett, Katrina (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190627-153828844">Penalizing Unfairness in Binary Classification</a>; <a href="https://doi.org/10.48550/arXiv.1707.00044">10.48550/arXiv.1707.00044</a></li>
<li>Cummings, Rachel and Ligett, Katrina, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161117-133623412">The Strange Case of Privacy in Equilibrium Models</a>; ISBN 978-1-4503-3936-0; Proceedings of the 2016 ACM Conference on Economics and Computation; 659; <a href="https://doi.org/10.1145/2940716.2940740">10.1145/2940716.2940740</a></li>
<li>Cummings, Rachel and Ligett, Katrina, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190627-154059380">Adaptive Learning with Robust Generalization Guarantees</a>; Proceedings of Machine Learning Research; Vol. 49; 772-814; <a href="https://doi.org/10.48550/arXiv.1602.07726">10.48550/arXiv.1602.07726</a></li>
<li>Kong, Yuqing and Schoenebeck, Grant, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190628-082029235">Putting Peer Prediction Under the Micro(economic)scope and Making Truth-telling Focal</a>; <a href="https://doi.org/10.48550/arXiv.1603.07319">10.48550/arXiv.1603.07319</a></li>
<li>Ziani, Juba and Chandrasekaran, Venkat, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190627-103855805">Efficiently characterizing games consistent with perturbed equilibrium observations</a>; <a href="https://doi.org/10.48550/arXiv.1603.01318">10.48550/arXiv.1603.01318</a></li>
<li>Cummings, Rachel and Ligett, Katrina, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160120-105900294">Coordination Complexity: Small Information Coordinating Large Populations</a>; ISBN 978-1-4503-4057-1; Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science; 281-290; <a href="https://doi.org/10.1145/2840728.2840767">10.1145/2840728.2840767</a></li>
<li>Xu, Yunjian and Ligett, Katrina (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160105-095011433">Commitment in First-Price Auctions</a>; ISBN 978-3-662-48432-6; Algorithmic Game Theory; 299; <a href="https://doi.org/10.1007/978-3-662-48433-3_23">10.1007/978-3-662-48433-3_23</a></li>
<li>Barman, Siddharth and Ligett, Katrina, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160106-134033532">Approximating Nash Equilibria in Tree Polymatrix Games</a>; ISBN 978-3-662-48432-6; Algorithmic Game Theory; <a href="https://doi.org/10.1007/978-3-662-48433-3_22">10.1007/978-3-662-48433-3_22</a></li>
<li>Cummings, Rachel and Ioannidis, Stratis, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190627-150412956">Truthful Linear Regression</a>; <a href="https://doi.org/10.48550/arXiv.1506.03489">10.48550/arXiv.1506.03489</a></li>
<li>Barman, Siddharth and Ligett, Katrina (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151124-112840356">Finding any nontrivial coarse correlated equilibrium is hard</a>; ACM SIGecom Exchanges; Vol. 14; No. 1; 76-79; <a href="https://doi.org/10.1145/2845926.2845929">10.1145/2845926.2845929</a></li>
<li>Barman, Siddharth and Ligett, Katrina (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150715-141510461">Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard</a>; ISBN 978-1-4503-3410-5; Proceedings of the Sixteenth ACM Conference on Economics and Computation; 815-816; <a href="https://doi.org/10.1145/2764468.2764497">10.1145/2764468.2764497</a></li>
<li>Cummings, Rachel and Ligett, Katrina, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150218-142919409">Accuracy for Sale: Aggregating Data with a Variance Constraint</a>; ISBN 978-1-4503-3333-7; ITCS'15: Innovations in Theoretical Computer Science; 317-324; <a href="https://doi.org/10.1145/2688073.2688106">10.1145/2688073.2688106</a></li>
<li>Bhaskar, Umang and Ligett, Katrina (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150220-135314566">Network improvement for equilibrium routing</a>; ACM SIGecom Exchanges; Vol. 13; No. 2; 36-40; <a href="https://doi.org/10.1145/2728732.2728737">10.1145/2728732.2728737</a></li>
<li>Christodoulou, George and Ligett, Katrina, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20141208-082730675">Contention Resolution under Selfishness</a>; Algorithmica; Vol. 70; No. 4; 675-693; <a href="https://doi.org/10.1007/s00453-013-9773-4">10.1007/s00453-013-9773-4</a></li>
<li>Bhaskar, Umang and Ligett, Katrina, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688">Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions</a>; ISBN 978-1-4799-6517-5; IEEE 55th Annual Symposium on Foundations of Computer Science; 31-40; <a href="https://doi.org/10.1109/FOCS.2014.12">10.1109/FOCS.2014.12</a></li>
<li>Ghosh, Arpita and Ligett, Katrina, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140804-112502954">Buying Private Data without Verification</a>; ISBN 978-1-4503-2565-3; Proceedings of the Fifteenth ACM Conference on Economics and Computation; 931-948; <a href="https://doi.org/10.1145/2600057.2602902">10.1145/2600057.2602902</a></li>
<li>Heffetz, Ori and Ligett, Katrina (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20141204-135134569">Privacy and Data-Based Research</a>; Journal of Economic Perspectives; Vol. 28; No. 2; 75-98; <a href="https://doi.org/10.1257/jep.28.2.75">10.1257/jep.28.2.75</a></li>
<li>Bhaskar, Umang and Ligett, Katrina, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687">Network Improvement for Equilibrium Routing</a>; ISBN 978-3-319-07556-3; Integer Programming and Combinatorial Optimization; 138-149</li>
<li>Kleinberg, Jon and Ligett, Katrina (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140814-132525010">Information-sharing in social networks</a>; Games and Economic Behavior; Vol. 82; 702-716; <a href="https://doi.org/10.1016/j.geb.2013.10.002">10.1016/j.geb.2013.10.002</a></li>
<li>Ghosh, Arpita and Ligett, Katrina (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170125-140637576">Privacy as a coordination game</a>; ISBN 978-1-4799-3410-2; 51st Annual Allerton Conference on Communication, Control, and Computing; 1608-1615; <a href="https://doi.org/10.1109/Allerton.2013.6736721">10.1109/Allerton.2013.6736721</a></li>
<li>Andrew, Lachlan and Barman, Siddharth, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20131008-164143666">A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret</a>; ISBN 978-1-4503-1900-3; Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems (SIGMETRICS '13); 329-330; <a href="https://doi.org/10.1145/2465529.2465533">10.1145/2465529.2465533</a></li>
<li>Andrew, Lachlan and Barman, Siddharth, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160420-130614870">A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret</a>; ACM SIGMETRICS Performance Evaluation Review; Vol. 41; No. 1; 329-330; <a href="https://doi.org/10.1145/2494232.2465533">10.1145/2494232.2465533</a></li>
<li>Ghosh, Arpita and Ligett, Katrina (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20131009-104946452">Privacy and Coordination: Computing on Databases with Endogenous Participation</a>; ISBN 978-1-4503-1962-1; EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce; 543-560; <a href="https://doi.org/10.1145/2482540.2482585">10.1145/2482540.2482585</a></li>
<li>Lee, Euiwoong and Ligett, Katrina (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20131009-110149445">Improved Bounds on the Price of Stability in Network Cost Sharing Games</a>; ISBN 978-1-4503-1962-1; EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce; 607-620; <a href="https://doi.org/10.1145/2482540.2482562">10.1145/2482540.2482562</a></li>
<li>Blum, Avrim and Ligett, Katrina, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130618-102022824">A Learning Theory Approach to Noninteractive Database Privacy</a>; Journal of the ACM; Vol. 60; No. 2; Art. No. 12; <a href="https://doi.org/10.1145/2450142.2450148">10.1145/2450142.2450148</a></li>
<li>Chung, Christine and Ligett, Katrina, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120319-102934819">The Power of Fair Pricing Mechanisms</a>; Algorithmica; Vol. 63; No. 3; 634-644; <a href="https://doi.org/10.1007/s00453-011-9587-1">10.1007/s00453-011-9587-1</a></li>
<li>Ligett, Katrina and Roth, Aaron (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190628-104835073">Take it or Leave it: Running a Survey when Privacy Comes at a Cost</a>; <a href="https://doi.org/10.48550/arXiv.1202.4741">10.48550/arXiv.1202.4741</a></li>
<li>Fiat, Amos and Koutsoupias, Elias, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120615-115818156">Beyond myopic best response (in Cournot competition)</a>; ISBN 9781611972108; Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms; 993-1005</li>
<li>Ligett, Katrina and Piliouras, Georgios (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190111-090750274">Beating the best Nash without regret</a>; ACM SIGecom Exchanges; Vol. 10; No. 1; 23-26; <a href="https://doi.org/10.1145/1978721.1978727">10.1145/1978721.1978727</a></li>
<li>Hardt, Moritz and Ligett, Katrina, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190628-094218811">A simple and practical algorithm for differentially private data release</a>; <a href="https://doi.org/10.48550/arXiv.1012.4763">10.48550/arXiv.1012.4763</a></li>
<li>Kleinberg, Robert and Ligett, Katrina (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190702-104130244">Privacy-Compatibility For General Utility Metrics</a>; <a href="https://doi.org/10.48550/arXiv.1010.2705">10.48550/arXiv.1010.2705</a></li>
<li>Kleinberg, Jon and Ligett, Katrina (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190702-110206311">Information-Sharing and Privacy in Social Networks</a>; <a href="https://doi.org/10.48550/arXiv.1003.0469">10.48550/arXiv.1003.0469</a></li>
<li>Christodoulou, George and Ligett, Katrina, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20141208-131734269">Contention Resolution under Selfishness</a>; ISBN 978-3-642-14161-4; Automata, Languages and Programming; 430-441</li>
<li>Gupta, Anupam and Ligett, Katrina, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190110-141744321">Differentially private combinatorial optimization</a>; ISBN 978-0-898716-98-6; Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms; 1106-1125; <a href="https://doi.org/10.48550/arXiv.0903.4510">10.48550/arXiv.0903.4510</a></li>
<li>Zhou, Shuheng and Ligett, Katrina, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190702-110751042">Differential Privacy with Compression</a>; <a href="https://doi.org/10.48550/arXiv.0901.1365">10.48550/arXiv.0901.1365</a></li>
<li>Blum, Avrim and Ligett, Katrina, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190114-152232213">A learning theory approach to non-interactive database privacy</a>; ISBN 978-1-60558-047-0; Proceedings of the fortieth annual ACM symposium on Theory of computing; 609-618; <a href="https://doi.org/10.1145/1374376.1374464">10.1145/1374376.1374464</a></li>
<li>Blum, Avrim and Hajiaghayi, MohammadTaghi, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190111-151102188">Regret minimization and the price of total anarchy</a>; ISBN 978-1-60558-047-0; Proceedings of the fortieth annual ACM symposium on Theory of computing; 373-382; <a href="https://doi.org/10.1145/1374376.1374430">10.1145/1374376.1374430</a></li>
<li>Kakade, Sham M. and Kalai, Adam Tauman, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190114-151448803">Playing games with approximation algorithms</a>; ISBN 978-1-59593-631-8; Proceedings of the thirty-ninth annual ACM symposium on Theory of computing; 546-555; <a href="https://doi.org/10.1145/1250790.1250870">10.1145/1250790.1250870</a></li>
<li>Applegate, David A. and Calinescu, Gruia, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190110-140236006">Compressing rectilinear pictures and minimizing access control lists</a>; ISBN 978-0-898716-24-5; Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms; 1066-1075</li>
<li>Blum, Avrim and Even-Dar, Eyal, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190111-133629898">Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games</a>; ISBN 1-59593-384-0; Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing; 45-52; <a href="https://doi.org/10.1145/1146381.1146392">10.1145/1146381.1146392</a></li>
</ul>