4,331+ open-access research outputs.
J. Conway defined useful operations on the Class of combinatorial games and also introduced a notion of equivalence between games. Conway showed that, under his equivalence, games form a Group. Howeveโฆ
In this letter, we study a model-based inverse problem for infinite-horizon linear-quadratic differential games with descriptor dynamics. Specifically, we seek to identify the set of all cost functionโฆ
Revealing the interaction topology underlying strategic behavior is fundamental to prediction, intervention, and policy design in networked systems. Yet the interaction matrix is often unobservable, aโฆ
We study stochastic differential games with $N$ players, where interactions are determined by sequences of graphs in which the number of neighbours of each node remains bounded as $N$ grows, such as cโฆ
Lutwak's affine quermassintegral theory is a foundational component of modern affine Brunn--Minkowski theory. Developed in the 1980s, it provides affine analogues of the classical quermassintegrals anโฆ
This paper develops a deep policy iteration method for high-dimensional finite-horizon mean-field games. We reformulate the game as a regenerative problem with deterministic cycles, which allows policโฆ
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in $n \leqslant 4$ variables including all Landau--Ginzburg models for smooth Fano threefolds wiโฆ
This paper studies the Nash equilibrium seeking problem for stochastic games under heavy-tailed noise. The gradient noise is considered to have a finite $\delta$-th moment ($1<\delta\le 2$), which genโฆ
We show the subgroup of 20 nonzero fourth powers in the finite field of order 81 is a cap set. Similarly, the subgroup of 9 nonzero seventh powers in the field of order 64 is a cap set. These are the โฆ
Our research is closely related to ontological studies in mathematics. It provides crucial insights into the nature of decisions and strategies characterized by Markov moments. In a stopping game, aโฆ
We compute the Atiyah Real $K$-theory of $C_2$-equivariant projective spaces and construct immersions of such spaces into multiples of the regular representation. These computations are made tractableโฆ
We study the control of rumor propagation in large networked populations by using Stackelberg graphon games. We first introduce a principal who wants to incentivize the spread of her preferred news anโฆ
Game-theoretic characterizations of selection principles provide a powerful framework for analyzing covering properties through strategic interactions. For a Tychonoff space $X$ and a non-trivial metrโฆ
In many applications, including Stackelberg games, machine learning, and power systems \cite{Mackay2018Selftuning,Heinrich1952The,Wang2021Bi-Level}, the decisions in a minimax optimization problem canโฆ
This paper investigates a class of linear-quadratic-Gaussian risk-sensitive graphon mean-field games, involving an asymptotically infinite population of heterogeneous agents distributed across an asymโฆ
This paper presents a computational study of P-positions (losing positions for the player to move) in 4 x n Chomp, the combinatorial game played on a 4 x n rectangular grid. An optimized C++ solver wiโฆ
By results of Dantzig (1951) and Adler (2013), computing the optimal solutions of a linear program is equivalent to finding optimal strategies in zero-sum bimatrix games. Dantzig's original result wasโฆ
We study linear quadratic dynamic games where players are uncertain about each other's control policies or goals and consequently seek to be strategically robust. Building on recent work on strategicaโฆ
This paper addresses a Stackelberg stochastic linear-quadratic (LQ) differential game under closed-loop information, a problem inherently time-inconsistent. Existing approaches rely on solving two couโฆ
We introduce a class of robust control problems formulated in min-max form, in which the principal agent is viewed as a central planner facing Nature. The agent's cost is a nonlinear function of all iโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ