Most existing results about last-iterate convergence of learning dynamics are limited to two-
player zero-sum games, and only apply under rigid assumptions about what dynamics the …

In this paper we introduce a novel flow representation for finite games in strategic form. This
representation allows us to develop a canonical direct sum decomposition of an arbitrary …

We consider discrete-time learning dynamics in finite strategic form games, and show that
games that are close to a potential game inherit many of the dynamical properties of …

Potential games are a special class of games for which many adaptive user dynamics
converge to a Nash equilibrium. In this article, we study properties of near-potential games …

A vector space structure is proposed for the set of finite games with fixed numbers of players
and strategies for each players. Two statical equivalences are used to reduce the dimension …

A new kind of finite games, called quasi-potential game (QPG), including ordinal QPG,
weighted QPG, and exact QPG, is proposed. It is proved that though a QPG may not be a …

In this paper, we propose an algorithm to verify whether a finite game is a coset weighted
potential game (WPG) without pre-knowledge on its coset weights. This algorithm can also …

Orthogonal direct-sum decompositions of finite games into potential, harmonic and
nonstrategic components exist in the literature. In this paper we study the issue of …

This letter presents an extended analysis and a novel upper bound of the subclass of Linear
Quadratic Near Potential Differential Games (LQ NPDG). LQ NPDGs are a subclass of …

Game-theoretic approaches are envisioned to bring human-like reasoning skills and
decision-making processes for autonomous vehicles (AVs). However, challenges including …