We study the Spohn conditional independence (CI) varieties of an $n$-player game for one-edge Bayesian networks on $n$ binary random variables. For generic payoff tables we prove that the Spohn CI variety is an irreducible complete intersection curve (Nash conditional independence curve) in the Segre variety $(\mathbb P^{1})^{n-2} \times \mathbb P^3$ and we give an explicit formula for its degree and genus. We show that any affine real algebraic variety $S \subseteq \mathbb{R}^m$ defined by $k$ polynomials with $k<m$ can be represented as the Spohn CI variety of an $n$-player game for one-edge Bayesian networks on $n$ binary random variables.Comment: 23 pages. Accepted for presentation at MEGA 2022, Krako
Supplementary material to the paper “Network formation with non-symmetric players and chance moves”...
First Version: November 2004, This Version: October 2015This paper provides a sufficient condition f...
In this article we show that the price of stability of shapley network design games on undirected gr...
An n-person game is specified by n tensors of the same format. We view its equilibria as points in t...
An $n$-person game is specified by $n$ tensors of the same format. We view its equilibria as points ...
An n-person game is specified by n tensors of the same format. We view its equilibria as points in t...
An n-person game is specified by n tensors of the same format. We view its equilibria as points in t...
We consider the problem of estimating the marginal independence structure of a Bayesian network from...
AbstractConditional independence models in the Gaussian case are algebraic varieties in the cone of ...
AbstractWe study the algebraic varieties defined by the conditional independence statements of Bayes...
AbstractConditional independence models in the Gaussian case are algebraic varieties in the cone of ...
Multinomial Bayesian networks with hidden variables are real algebraic varieties. Thus, they are the...
The semi-random graph process is a single player game in which the player is initially presented an ...
The semi-random graph process is a single player game in which the player is initially presented an ...
We develop the necessary theory in computational algebraic geometry to place Bayesian networks into ...
Supplementary material to the paper “Network formation with non-symmetric players and chance moves”...
First Version: November 2004, This Version: October 2015This paper provides a sufficient condition f...
In this article we show that the price of stability of shapley network design games on undirected gr...
An n-person game is specified by n tensors of the same format. We view its equilibria as points in t...
An $n$-person game is specified by $n$ tensors of the same format. We view its equilibria as points ...
An n-person game is specified by n tensors of the same format. We view its equilibria as points in t...
An n-person game is specified by n tensors of the same format. We view its equilibria as points in t...
We consider the problem of estimating the marginal independence structure of a Bayesian network from...
AbstractConditional independence models in the Gaussian case are algebraic varieties in the cone of ...
AbstractWe study the algebraic varieties defined by the conditional independence statements of Bayes...
AbstractConditional independence models in the Gaussian case are algebraic varieties in the cone of ...
Multinomial Bayesian networks with hidden variables are real algebraic varieties. Thus, they are the...
The semi-random graph process is a single player game in which the player is initially presented an ...
The semi-random graph process is a single player game in which the player is initially presented an ...
We develop the necessary theory in computational algebraic geometry to place Bayesian networks into ...
Supplementary material to the paper “Network formation with non-symmetric players and chance moves”...
First Version: November 2004, This Version: October 2015This paper provides a sufficient condition f...
In this article we show that the price of stability of shapley network design games on undirected gr...