25 citations · 143 across the 71 of their papers we have counts for
5 papers · 1 filter
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…
Reconstructing a Bounded-Degree Directed Tree Using Path Queries
Zhaosen Wang, Jean Honorio
We present a randomized algorithm for reconstructing directed rooted trees of nodes and node degree at most , by asking at most path queries. Each path query…
Information-Theoretic Lower Bounds for Recovery of Diffusion Network Structures
Keehwan Park, Jean Honorio
We study the information-theoretic lower bound of the sample complexity of the correct recovery of diffusion network structures. We introduce a discrete-time diffusion model based…
Information-theoretic limits of Bayesian network structure learning
Asish Ghoshal, Jean Honorio
In this paper, we study the information-theoretic limits of learning the structure of Bayesian networks (BNs), on discrete as well as continuous random variables, from a finite num…
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…