Ligett, Katrina A.

Book Chapter from CaltechAUTHORS

• Immorlica, Nicole and Ligett, Katrina, et el. (2019) Access to Population-Level Signaling as a Source of Inequality; ISBN 978-1-4503-6125-5; Proceedings of the Conference on Fairness, Accountability, and Transparency; 249-258; 10.1145/3287560.3287579
• Ligett, Katrina and Neel, Seth, et el. (2017) Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained ERM; 10.48550/arXiv.1705.10829
• Cummings, Rachel and Ligett, Katrina, et el. (2016) The Strange Case of Privacy in Equilibrium Models; ISBN 978-1-4503-3936-0; Proceedings of the 2016 ACM Conference on Economics and Computation; 659; 10.1145/2940716.2940740
• Cummings, Rachel and Ligett, Katrina, et el. (2016) Coordination Complexity: Small Information Coordinating Large Populations; ISBN 978-1-4503-4057-1; Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science; 281-290; 10.1145/2840728.2840767
• Barman, Siddharth and Ligett, Katrina, et el. (2015) Approximating Nash Equilibria in Tree Polymatrix Games; ISBN 978-3-662-48432-6; Algorithmic Game Theory; 10.1007/978-3-662-48433-3_22
• Xu, Yunjian and Ligett, Katrina (2015) Commitment in First-Price Auctions; ISBN 978-3-662-48432-6; Algorithmic Game Theory; 299; 10.1007/978-3-662-48433-3_23
• Barman, Siddharth and Ligett, Katrina (2015) Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard; ISBN 978-1-4503-3410-5; Proceedings of the Sixteenth ACM Conference on Economics and Computation; 815-816; 10.1145/2764468.2764497
• Cummings, Rachel and Ligett, Katrina, et el. (2015) Accuracy for Sale: Aggregating Data with a Variance Constraint; ISBN 978-1-4503-3333-7; ITCS'15: Innovations in Theoretical Computer Science; 317-324; 10.1145/2688073.2688106
• Bhaskar, Umang and Ligett, Katrina, et el. (2014) Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions; ISBN 978-1-4799-6517-5; IEEE 55th Annual Symposium on Foundations of Computer Science; 31-40; 10.1109/FOCS.2014.12
• Ghosh, Arpita and Ligett, Katrina, et el. (2014) Buying Private Data without Verification; ISBN 978-1-4503-2565-3; Proceedings of the Fifteenth ACM Conference on Economics and Computation; 931-948; 10.1145/2600057.2602902
• Bhaskar, Umang and Ligett, Katrina, et el. (2014) Network Improvement for Equilibrium Routing; ISBN 978-3-319-07556-3; Integer Programming and Combinatorial Optimization; 138-149
• Ghosh, Arpita and Ligett, Katrina (2013) Privacy as a coordination game; ISBN 978-1-4799-3410-2; 51st Annual Allerton Conference on Communication, Control, and Computing; 1608-1615; 10.1109/Allerton.2013.6736721
• Lee, Euiwoong and Ligett, Katrina (2013) Improved Bounds on the Price of Stability in Network Cost Sharing Games; ISBN 978-1-4503-1962-1; EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce; 607-620; 10.1145/2482540.2482562
• Andrew, Lachlan and Barman, Siddharth, et el. (2013) A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret; ISBN 978-1-4503-1900-3; Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems (SIGMETRICS '13); 329-330; 10.1145/2465529.2465533
• Ghosh, Arpita and Ligett, Katrina (2013) Privacy and Coordination: Computing on Databases with Endogenous Participation; ISBN 978-1-4503-1962-1; EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce; 543-560; 10.1145/2482540.2482585
• Fiat, Amos and Koutsoupias, Elias, et el. (2012) Beyond myopic best response (in Cournot competition); ISBN 9781611972108; Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms; 993-1005
• Christodoulou, George and Ligett, Katrina, et el. (2010) Contention Resolution under Selfishness; ISBN 978-3-642-14161-4; Automata, Languages and Programming; 430-441
• Gupta, Anupam and Ligett, Katrina, et el. (2009) Differentially private combinatorial optimization; ISBN 978-0-898716-98-6; Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms; 1106-1125; 10.48550/arXiv.0903.4510
• Blum, Avrim and Hajiaghayi, MohammadTaghi, et el. (2008) Regret minimization and the price of total anarchy; ISBN 978-1-60558-047-0; Proceedings of the fortieth annual ACM symposium on Theory of computing; 373-382; 10.1145/1374376.1374430
• Blum, Avrim and Ligett, Katrina, et el. (2008) A learning theory approach to non-interactive database privacy; ISBN 978-1-60558-047-0; Proceedings of the fortieth annual ACM symposium on Theory of computing; 609-618; 10.1145/1374376.1374464
• Kakade, Sham M. and Kalai, Adam Tauman, et el. (2007) Playing games with approximation algorithms; ISBN 978-1-59593-631-8; Proceedings of the thirty-ninth annual ACM symposium on Theory of computing; 546-555; 10.1145/1250790.1250870
• Applegate, David A. and Calinescu, Gruia, et el. (2007) Compressing rectilinear pictures and minimizing access control lists; ISBN 978-0-898716-24-5; Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms; 1066-1075
• Blum, Avrim and Even-Dar, Eyal, et el. (2006) Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games; ISBN 1-59593-384-0; Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing; 45-52; 10.1145/1146381.1146392