@article{https://resolver.caltech.edu/CaltechAUTHORS:20200709-084932341,
    title = "Third-Party Data Providers Ruin Simple Mechanisms",
    journal = "ACM SIGMETRICS Performance Evaluation Review",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200709-084932341",
    id = "record",
    isbn = "9781450379854",
    issn = "0163-5999",
    doi = "10.1145/3410048.3410108",
    volume = "48"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190626-155536214,
    title = "Third-Party Data Providers Ruin Simple Mechanisms",
    journal = "Proceedings of the ACM on Measurement and Analysis of Computing Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190626-155536214",
    id = "record",
    issn = "2476-1249",
    doi = "10.1145/3379478",
    volume = "4"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180622-082816994,
    title = "Achieving target equilibria in network routing games without knowing the latency functions",
    journal = "Games and Economic Behavior",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180622-082816994",
    id = "record",
    issn = "0899-8256",
    doi = "10.1016/j.geb.2018.02.009",
    volume = "118"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190702-110206311,
    title = "Information-Sharing and Privacy in Social Networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190702-110206311",
    id = "record",
    doi = "10.48550/arXiv.1003.0469"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190702-110751042,
    title = "Differential Privacy with Compression",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190702-110751042",
    id = "record",
    doi = "10.48550/arXiv.0901.1365"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190702-104130244,
    title = "Privacy-Compatibility For General Utility Metrics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190702-104130244",
    id = "record",
    doi = "10.48550/arXiv.1010.2705"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190628-082029235,
    title = "Putting Peer Prediction Under the Micro(economic)scope and Making Truth-telling Focal",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190628-082029235",
    id = "record",
    doi = "10.48550/arXiv.1603.07319"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190628-094218811,
    title = "A simple and practical algorithm for differentially private data release",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190628-094218811",
    id = "record",
    doi = "10.48550/arXiv.1012.4763"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190628-104835073,
    title = "Take it or Leave it: Running a Survey when Privacy Comes at a Cost",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190628-104835073",
    id = "record",
    doi = "10.48550/arXiv.1202.4741"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190627-103855805,
    title = "Efficiently characterizing games consistent with perturbed equilibrium observations",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190627-103855805",
    id = "record",
    doi = "10.48550/arXiv.1603.01318"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190626-152715232,
    title = "Equal Opportunity in Online Classification with Partial Feedback",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190626-152715232",
    id = "record",
    doi = "10.48550/arXiv.1902.02242"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190627-150412956,
    title = "Truthful Linear Regression",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190627-150412956",
    id = "record",
    doi = "10.48550/arXiv.1506.03489"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190627-153828844,
    title = "Penalizing Unfairness in Binary Classification",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190627-153828844",
    id = "record",
    doi = "10.48550/arXiv.1707.00044"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190626-101449888,
    title = "A necessary and sufficient stability notion for adaptive generalization",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190626-101449888",
    id = "record",
    doi = "10.48550/arXiv.1906.00930"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190626-145729225,
    title = "Learning to Prune: Speeding up Repeated Computations",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190626-145729225",
    id = "record",
    doi = "10.48550/arXiv.1904.11875"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190312-141425964,
    title = "Beyond myopic best response (in Cournot competition)",
    journal = "Games and Economic Behavior",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190312-141425964",
    id = "record",
    issn = "0899-8256",
    doi = "10.1016/j.geb.2013.12.006",
    volume = "113"
}


@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",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190111-072027347",
    id = "record",
    isbn = "978-1-4503-6125-5",
    doi = "10.1145/3287560.3287579"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190110-110039117,
    title = "Special Issue on the Economics of Security and Privacy: Guest Editors' Introduction",
    journal = "ACM Transactions on Internet Technology",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190110-110039117",
    id = "record",
    issn = "1533-5399",
    doi = "10.1145/3216902",
    volume = "18"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180816-074937577,
    title = "Commitment in first-price auctions",
    journal = "Economic Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180816-074937577",
    id = "record",
    issn = "0938-2259",
    doi = "10.1007/s00199-017-1069-5",
    volume = "66"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190107-104411349,
    chapter = "Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained ERM",
    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",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161117-133623412",
    id = "record",
    isbn = "978-1-4503-3936-0",
    doi = "10.1145/2940716.2940740"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190627-154059380,
    title = "Adaptive Learning with Robust Generalization Guarantees",
    journal = "Proceedings of Machine Learning Research",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190627-154059380",
    id = "record",
    issn = "2640-3498",
    doi = "10.48550/arXiv.1602.07726",
    volume = "49"
}


@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",
    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:20160105-095011433,
    title = "Algorithmic Game Theory",
    chapter = "Commitment in First-Price Auctions",
    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:20160106-134033532,
    title = "Algorithmic Game Theory",
    chapter = "Approximating Nash Equilibria in Tree Polymatrix Games",
    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"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20151124-112840356,
    title = "Finding any nontrivial coarse correlated equilibrium is hard",
    journal = "ACM SIGecom Exchanges",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20151124-112840356",
    id = "record",
    issn = "1551-9031",
    doi = "10.1145/2845926.2845929",
    volume = "14"
}


@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",
    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",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150218-142919409",
    id = "record",
    isbn = "978-1-4503-3333-7",
    doi = "10.1145/2688073.2688106"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20141208-082730675,
    title = "Contention Resolution under Selfishness",
    journal = "Algorithmica",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20141208-082730675",
    id = "record",
    issn = "0178-4617",
    doi = "10.1007/s00453-013-9773-4",
    volume = "70"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150220-135314566,
    title = "Network improvement for equilibrium routing",
    journal = "ACM SIGecom Exchanges",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150220-135314566",
    id = "record",
    issn = "1551-9031",
    doi = "10.1145/2728732.2728737",
    volume = "13"
}


@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",
    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",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140804-112502954",
    id = "record",
    isbn = "978-1-4503-2565-3",
    doi = "10.1145/2600057.2602902"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20141204-135134569,
    title = "Privacy and Data-Based Research",
    journal = "Journal of Economic Perspectives",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20141204-135134569",
    id = "record",
    issn = "0895-3309",
    doi = "10.1257/jep.28.2.75",
    volume = "28"
}


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


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140814-132525010,
    title = "Information-sharing in social networks",
    journal = "Games and Economic Behavior",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140814-132525010",
    id = "record",
    issn = "0899-8256",
    doi = "10.1016/j.geb.2013.10.002",
    volume = "82"
}


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


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160420-130614870,
    title = "A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret",
    journal = "ACM SIGMETRICS Performance Evaluation Review",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160420-130614870",
    id = "record",
    issn = "0163-5999",
    doi = "10.1145/2494232.2465533",
    volume = "41"
}


@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",
    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: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",
    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: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",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20131008-164143666",
    id = "record",
    isbn = "978-1-4503-1900-3",
    doi = "10.1145/2465529.2465533"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20130618-102022824,
    title = "A Learning Theory Approach to Noninteractive Database Privacy",
    journal = "Journal of the ACM",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130618-102022824",
    id = "record",
    issn = "0004-5411",
    doi = "10.1145/2450142.2450148",
    volume = "60"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120319-102934819,
    title = "The Power of Fair Pricing Mechanisms",
    journal = "Algorithmica",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120319-102934819",
    id = "record",
    issn = "0178-4617",
    doi = "10.1007/s00453-011-9587-1",
    volume = "63"
}


@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)",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120615-115818156",
    id = "record",
    isbn = "9781611972108"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190111-090750274,
    title = "Beating the best Nash without regret",
    journal = "ACM SIGecom Exchanges",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190111-090750274",
    id = "record",
    issn = "1551-9031",
    doi = "10.1145/1978721.1978727",
    volume = "10"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20141208-131734269,
    title = "Automata, Languages and Programming",
    chapter = "Contention Resolution under Selfishness",
    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",
    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",
    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",
    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",
    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",
    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",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190111-133629898",
    id = "record",
    isbn = "1-59593-384-0",
    doi = "10.1145/1146381.1146392"
}