<h1>Ligett, Katrina A.</h1>
<h2>Article 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>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>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>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>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 (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>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>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>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>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 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>
</ul>