Undiscounted Equilibrium in Positive Recursive Absorbing Games with Non-Rectangular Absorption Structure

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Solan, Eilon, Vieille, Nicolas
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866914179593535488
author Solan, Eilon
Vieille, Nicolas
author_facet Solan, Eilon
Vieille, Nicolas
contents An absorbing game is a stochastic game with a single nonabsorbing state. Such a game is called recursive if all players receive a payoff of 0 in the nonabsorbing state, and positive if all payoffs in absorbing states are positive. An action profile is nonabsorbing if, when it is played, the game remains in the nonabsorbing state with probability 1. The set of nonabsorbing action profiles can be partitioned into the connected components of an undirected graph, whose vertices are these profiles, with two vertices joined by an edge whenever the corresponding profiles differ in the action of a single player. A connected component is said to be rectangular if it is the Cartesian product of subsets of the players' action sets. We prove that every positive recursive absorbing game whose nonabsorbing components are all non-rectangular admits an undiscounted equilibrium payoff.
format Preprint
id arxiv_https___arxiv_org_abs_2512_04306
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Undiscounted Equilibrium in Positive Recursive Absorbing Games with Non-Rectangular Absorption Structure
Solan, Eilon
Vieille, Nicolas
Optimization and Control
91A15, 91A06
An absorbing game is a stochastic game with a single nonabsorbing state. Such a game is called recursive if all players receive a payoff of 0 in the nonabsorbing state, and positive if all payoffs in absorbing states are positive. An action profile is nonabsorbing if, when it is played, the game remains in the nonabsorbing state with probability 1. The set of nonabsorbing action profiles can be partitioned into the connected components of an undirected graph, whose vertices are these profiles, with two vertices joined by an edge whenever the corresponding profiles differ in the action of a single player. A connected component is said to be rectangular if it is the Cartesian product of subsets of the players' action sets. We prove that every positive recursive absorbing game whose nonabsorbing components are all non-rectangular admits an undiscounted equilibrium payoff.
title Undiscounted Equilibrium in Positive Recursive Absorbing Games with Non-Rectangular Absorption Structure
topic Optimization and Control
91A15, 91A06
url https://arxiv.org/abs/2512.04306