相关论文: Absorption Paths and Equilibria in Quitting Games

Sequential equilibrium is one of the most fundamental refinements of Nash equilibrium for games in extensive form. However, it is not defined for extensive-form games in which a player can choose among a continuum of actions. We define a…

Solutions to pursuit-evasion and surveillance-evasion differential games are typically computed and expressed using open-loop representations, with the synthesis of feedback strategies significantly less common. We propose a numerical…

We formulate a mean field game where each player stops a privately observed Brownian motion with absorption. Players are ranked according to their level of stopping and rewarded as a function of their relative rank. There is a unique mean…

Learning algorithms are essential for the applications of game theory in a networking environment. In dynamic and decentralized settings where the traffic, topology and channel states may vary over time and the communication between agents…

Which equilibria will arise in signaling games depends on how the receiver interprets deviations from the path of play. We develop a micro-foundation for these off-path beliefs, and an associated equilibrium refinement, in a model where…

Under non-exponential discounting, we develop a dynamic theory for stopping problems in continuous time. Our framework covers discount functions that induce decreasing impatience. Due to the inherent time inconsistency, we look for…

We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents, (II) atomic splittable players, (III) atomic non splittable…

The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in $NP \cap coNP$ which are not known to be in $P$. However, there are some…

We study a game of resource extraction of a common good under one-dimensional diffusive dynamics with player actions corresponding to singular stochastic control up to absorption at $0$, implying a trade-off between profitable resource…

Motivated by applications in optics and acoustics we develop a dynamical-system approach to describe absorption in chaotic systems. We introduce an operator formalism from which we obtain (i) a general formula for the escape rate $\kappa$…

We consider two-player games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequency-related properties: (i) all colors occur with the same asymptotic frequency, (ii) there…

Although the definition of what empathetic preferences exactly are is still evolving, there is a general consensus in the psychology, science and engineering communities that the evolution toward players' behaviors in interactive…

Can an absorbing game with rational data have an irrational limit value? Yes: In this note we provide the simplest examples where this phenomenon arises. That is, the following $3\times 3$ absorbing game \[ A = \begin{bmatrix} 1^* & 1^* &…

Stochastic games are fundamental in various applications, including the control of cyber-physical systems (CPS), where both controller and environment are modeled as players. Traditional algorithms typically aim to determine a single…

This paper presents a new solution concept for multiplayer stochastic games, namely, acceptable strategy profiles. For each player $i$ and state $s$ in a stochastic game, let $w_i(s)$ be a real number. A strategy profile is…

A novel modelling framework is proposed for the analysis of aggregative games on an infinite-time horizon, assuming that players are subject to heterogeneous periodic constraints. A new aggregative equilibrium notion is presented and the…

Three notions of random stopping times exist in the literature. We introduce two concepts of equivalence of random stopping times, motivated by optimal stopping problems and stopping games respectively. We prove that these two concepts…

A recent paper by Bhatia, Chin, Mani, and Mossel (2026) defined stochastic processes aimed at modeling the game of War for {\em two players} with $n$ cards. That paper showed that these models, assuming uniform random decks, are equivalent…

This paper examines the convergence of no-regret learning in games with continuous action sets. For concreteness, we focus on learning via "dual averaging", a widely used class of no-regret learning schemes where players take small steps…

We present a general field-theoretic strategy to analyze three connected families of continuous phase transitions which occur in nonequilibrium steady-states. We focus on transitions taking place between an active state and one absorbing…