Geometry of Dependency Equilibria

01/14/2022
by   Irem Portakal, et al.
0

An n-person game is specified by n tensors of the same format. We view its equilibria as points in that tensor space. Dependency equilibria are defined by linear constraints on conditional probabilities, and thus by determinantal quadrics in the tensor entries. These equations cut out the Spohn variety, named after the philosopher who introduced dependency equilibria. The Nash equilibria among these are the tensors of rank one. We study the real algebraic geometry of the Spohn variety. This variety is rational, except for 2 × 2 games, when it is an elliptic curve. For 3 × 2 games, it is a del Pezzo surface of degree two. We characterize the payoff regions and their boundaries using oriented matroids, and we develop the connection to Bayesian networks in statistics.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2019

Berge equilibria in n-person 2-strategy games

An algorithm for finding all Berge equilibria in the sense of Zhukovskii...
research
12/11/2018

Fast Algorithms for Rank-1 Bimatrix Games

The rank of a bimatrix game is the matrix rank of the sum of the two pay...
research
04/22/2021

Nash Equilibria of The Multiplayer Colonel Blotto Game on Arbitrary Measure Spaces

The Colonel Blotto Problem proposed by Borel in 1921 has served as a wid...
research
04/04/2020

Bistable Probabilities: A Unified Framework for Studying Rationality and Irrationality in Classical and Quantum Games

This article presents a unified probabilistic framework that allows both...
research
01/06/2015

The Quadrifocal Variety

Multi-view Geometry is reviewed from an Algebraic Geometry perspective a...
research
12/03/2019

CheasePy

CheasePy is code written in Python to run the CHEASE (Cubic Hermite Elem...
research
11/02/2021

A Finite Characterization of Perfect Equilibria

Govindan and Klumpp [7] provided a characterization of perfect equilibri...

Please sign up or login with your details

Forgot password? Click here to reset