@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190111-072027347,
    title = "Proceedings of the Conference on Fairness, Accountability, and Transparency",
    chapter = "Access to Population-Level Signaling as a Source of Inequality",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190111-072027347",
    id = "record",
    isbn = "978-1-4503-6125-5",
    doi = "10.1145/3287560.3287579"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190107-104411349,
    chapter = "Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained ERM",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190107-104411349",
    id = "record",
    doi = "10.48550/arXiv.1705.10829"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161117-133623412,
    title = "Proceedings of the 2016 ACM Conference on Economics and Computation",
    chapter = "The Strange Case of Privacy in Equilibrium Models",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161117-133623412",
    id = "record",
    isbn = "978-1-4503-3936-0",
    doi = "10.1145/2940716.2940740"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160120-105900294,
    title = "Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science",
    chapter = "Coordination Complexity: Small Information Coordinating Large Populations",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160120-105900294",
    id = "record",
    isbn = "978-1-4503-4057-1",
    doi = "10.1145/2840728.2840767"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160106-134033532,
    title = "Algorithmic Game Theory",
    chapter = "Approximating Nash Equilibria in Tree Polymatrix Games",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160106-134033532",
    id = "record",
    isbn = "978-3-662-48432-6",
    doi = "10.1007/978-3-662-48433-3\_22"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160105-095011433,
    title = "Algorithmic Game Theory",
    chapter = "Commitment in First-Price Auctions",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160105-095011433",
    id = "record",
    isbn = "978-3-662-48432-6",
    doi = "10.1007/978-3-662-48433-3\_23"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150715-141510461,
    title = "Proceedings of the Sixteenth ACM Conference on Economics and Computation",
    chapter = "Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150715-141510461",
    id = "record",
    isbn = "978-1-4503-3410-5",
    doi = "10.1145/2764468.2764497"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150218-142919409,
    title = "ITCS'15: Innovations in Theoretical Computer Science",
    chapter = "Accuracy for Sale: Aggregating Data with a Variance Constraint",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150218-142919409",
    id = "record",
    isbn = "978-1-4503-3333-7",
    doi = "10.1145/2688073.2688106"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688,
    title = "IEEE 55th Annual Symposium on Foundations of Computer Science",
    chapter = "Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160105-073143688",
    id = "record",
    isbn = "978-1-4799-6517-5",
    doi = "10.1109/FOCS.2014.12"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20140804-112502954,
    title = "Proceedings of the Fifteenth ACM Conference on Economics and Computation",
    chapter = "Buying Private Data without Verification",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140804-112502954",
    id = "record",
    isbn = "978-1-4503-2565-3",
    doi = "10.1145/2600057.2602902"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687,
    title = "Integer Programming and Combinatorial Optimization",
    chapter = "Network Improvement for Equilibrium Routing",
    year = "2014",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150223-101614687",
    id = "record",
    isbn = "978-3-319-07556-3"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170125-140637576,
    title = "51st Annual Allerton Conference on Communication, Control, and Computing",
    chapter = "Privacy as a coordination game",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170125-140637576",
    id = "record",
    isbn = "978-1-4799-3410-2",
    doi = "10.1109/Allerton.2013.6736721"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20131009-104946452,
    title = "EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce",
    chapter = "Privacy and Coordination: Computing on Databases with Endogenous Participation",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20131009-104946452",
    id = "record",
    isbn = "978-1-4503-1962-1",
    doi = "10.1145/2482540.2482585"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20131008-164143666,
    title = "Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems (SIGMETRICS '13)",
    chapter = "A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20131008-164143666",
    id = "record",
    isbn = "978-1-4503-1900-3",
    doi = "10.1145/2465529.2465533"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20131009-110149445,
    title = "EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce",
    chapter = "Improved Bounds on the Price of Stability in Network Cost Sharing Games",
    year = "2013",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20131009-110149445",
    id = "record",
    isbn = "978-1-4503-1962-1",
    doi = "10.1145/2482540.2482562"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120615-115818156,
    title = "Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms",
    chapter = "Beyond myopic best response (in Cournot competition)",
    year = "2012",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120615-115818156",
    id = "record",
    isbn = "9781611972108"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20141208-131734269,
    title = "Automata, Languages and Programming",
    chapter = "Contention Resolution under Selfishness",
    year = "2010",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20141208-131734269",
    id = "record",
    isbn = "978-3-642-14161-4"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190110-141744321,
    title = "Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms",
    chapter = "Differentially private combinatorial optimization",
    year = "2009",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190110-141744321",
    id = "record",
    isbn = "978-0-898716-98-6",
    doi = "10.48550/arXiv.0903.4510"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190114-152232213,
    title = "Proceedings of the fortieth annual ACM symposium on Theory of computing",
    chapter = "A learning theory approach to non-interactive database privacy",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190114-152232213",
    id = "record",
    isbn = "978-1-60558-047-0",
    doi = "10.1145/1374376.1374464"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190111-151102188,
    title = "Proceedings of the fortieth annual ACM symposium on Theory of computing",
    chapter = "Regret minimization and the price of total anarchy",
    year = "2008",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190111-151102188",
    id = "record",
    isbn = "978-1-60558-047-0",
    doi = "10.1145/1374376.1374430"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190114-151448803,
    title = "Proceedings of the thirty-ninth annual ACM symposium on Theory of computing",
    chapter = "Playing games with approximation algorithms",
    year = "2007",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190114-151448803",
    id = "record",
    isbn = "978-1-59593-631-8",
    doi = "10.1145/1250790.1250870"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190110-140236006,
    title = "Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms",
    chapter = "Compressing rectilinear pictures and minimizing access control lists",
    year = "2007",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190110-140236006",
    id = "record",
    isbn = "978-0-898716-24-5"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190111-133629898,
    title = "Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing",
    chapter = "Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games",
    year = "2006",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190111-133629898",
    id = "record",
    isbn = "1-59593-384-0",
    doi = "10.1145/1146381.1146392"
}