A Finite Characterization of Perfect Equilibria

11/02/2021
by   Ivonne Callejas, et al.
0

Govindan and Klumpp [7] provided a characterization of perfect equilibria using Lexicographic Probability Systems (LPSs). Their characterization was essentially finite in that they showed that there exists a finite bound on the number of levels in the LPS, but they did not compute it explicitly. In this note, we draw on two recent developments in Real Algebraic Geometry to obtain a formula for this bound.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/22/2021

Well-Founded Extensive Games with Perfect Information

We consider extensive games with perfect information with well-founded g...
01/26/2021

Subgame-perfect Equilibria in Mean-payoff Games

In this paper, we provide an effective characterization of all the subga...
03/16/2022

Subgame-perfect Equilibria in Mean-payoff Games (journal version)

In this paper, we provide an effective characterization of all the subga...
08/23/2021

QDEF and Its Approximations in OBDM

Given an input dataset (i.e., a set of tuples), query definability in On...
07/22/2019

A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator

Brandenburger, Friedenberg, and Keisler provide an epistemic characteriz...
08/24/2021

A Game Characterization for Contrasimilarity

We present the first game characterization of contrasimilarity, the weak...
01/14/2022

Geometry of Dependency Equilibria

An n-person game is specified by n tensors of the same format. We view i...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.