<h1>Ligett, Katrina A.</h1>
<h2>Book Chapter from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<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>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>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: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>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, 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>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>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>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>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>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>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>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>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>