CaltechAUTHORS
  A Caltech Library Service

Efficiently characterizing games consistent with perturbed equilibrium observations

Ziani, Juba and Chandrasekaran, Venkat and Ligett, Katrina (2016) Efficiently characterizing games consistent with perturbed equilibrium observations. . (Unpublished) http://resolver.caltech.edu/CaltechAUTHORS:20190627-103855805

[img] PDF - Submitted Version
See Usage Policy.

591Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20190627-103855805

Abstract

We study the problem of characterizing the set of games that are consistent with observed equilibrium play. Our contribution is to develop and analyze a new methodology based on convex optimization to address this problem for many classes of games and observation models of interest. Our approach provides a sharp, computationally efficient characterization of the extent to which a particular set of observations constrains the space of games that could have generated them. This allows us to solve a number of variants of this problem as well as to quantify the power of games from particular classes (e.g., zero-sum, potential, linearly parameterized) to explain player behavior. We illustrate our approach with numerical simulations.


Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription
http://arxiv.org/abs/1603.01318arXivDiscussion Paper
ORCID:
AuthorORCID
Ligett, Katrina0000-0003-2780-6656
Additional Information:We thank Federico Echenique, Denis Nekipelov, Matt Shum, and Vasilis Syrgkanis for extremely helpful comments and suggestions. Ziani's research was funded in part by NSF grant CNS-1254169. Chandrasekaran's research was funded in part by NSF awards CCF-1350590 and CCF-1637598, Air Force Office of Scientific Research grants FA9550-14-1-0098 and FA9550-16-1-0210, and the Sloan research fellowship. Ligett's research was funded in part by ISF grant 1044/16, NSF grants CNS-1254169 and CNS-1518941, a subcontract under the DARPA Brandeis Project, and the Hebrew University Cybersecurity Research Center in conjunction with the Israel National Cyber Bureau in the Prime Minister's Office. Ligett's work was done in part while the author was visiting the Simons Institute for the Theory of Computing at Berkeley.
Funders:
Funding AgencyGrant Number
NSFCNS-1254169
NSFCCF-1350590
NSFCCF-1637598
Air Force Office of Scientific Research (AFOSR)FA9550-14-1-0098
Air Force Office of Scientific Research (AFOSR)FA9550-16-1-0210
Alfred P. Sloan FoundationUNSPECIFIED
Israel Science Foundation1044/16
NSFCNS-1254169
NSFCNS-1518941
Defense Advanced Research Projects Agency (DARPA)UNSPECIFIED
Hebrew University of JerusalemUNSPECIFIED
Israel National Cyber BureauUNSPECIFIED
Record Number:CaltechAUTHORS:20190627-103855805
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20190627-103855805
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:96783
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:27 Jun 2019 18:39
Last Modified:27 Jun 2019 18:39

Repository Staff Only: item control page