25 citations · 143 across the 71 of their papers we have counts for
4 papers · 1 filter
Provable Sample Complexity Guarantees for Learning of Continuous-Action Graphical Games with Nonparametric Utilities
Adarsh Barik, Jean Honorio
In this paper, we study the problem of learning the exact structure of continuous-action games with non-parametric utility functions. We propose an regularized method whic…
Provable Computational and Statistical Guarantees for Efficient Learning of Continuous-Action Graphical Games
Adarsh Barik, Jean Honorio
In this paper, we study the problem of learning the set of pure strategy Nash equilibria and the exact structure of a continuous-action graphical game with quadratic payoffs by obs…
From Behavior to Sparse Graphical Games: Efficient Recovery of Equilibria
Asish Ghoshal, Jean Honorio
In this paper we study the problem of exact recovery of the pure-strategy Nash equilibria (PSNE) set of a graphical game from noisy observations of joint actions of the players alo…
On the Sample Complexity of Learning Graphical Games
Jean Honorio
We analyze the sample complexity of learning graphical games from purely behavioral data. We assume that we can only observe the players' joint actions and not their payoffs. We an…