相关论文: Flashcard games
We consider a general class of nonzero-sum $N$-player stochastic games with impulse controls, where players control the underlying dynamics with discrete interventions. We adopt a verification approach and provide sufficient conditions for…
We establish relationships between various topological selection games involving the space of minimal usco maps with various topologies, including the topology of pointwise convergence and the topology of uniform convergence on compact…
This article studies the kinetic dynamics of the rock-paper-scissors binary game. We first prove existence and uniqueness of the solution of the kinetic equation and subsequently we prove the rigorous derivation of the quasi-invariant limit…
We investigate the simulation methods for a large family of stable random fields that appeared in the recent literature, known as the Karlin stable set-indexed processes. We exploit a new representation and implement the procedure…
The 21-card trick is a way of dealing cards in order to predict the card selected by a volunteer. We give a mathematical explanation of why the well-known 21-card trick works using a simple linear discrete function. The function has a…
The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments…
We study the equilibrium fluctuations of an interacting particle system evolving on the discrete ring with $N\in\mathbb N$ points, denoted by $\mathbb T_N$, and with three species of particles that we name $A,B$ and $C$, but such that at…
We numerically exhibit strange scaling and temporal evolution of finite-size fluctuation in thermal equilibrium of a simple long-range interacting system. These phenomena are explained from the view point of existence of the Casimirs and…
Dynamic noncooperative game theory is a field of mathematics and economics in which a lot of research is being carried out at present featuring a great number of applications in many different areas of economics and management science like…
We recursively define a sequence $\{F_{n,k}\}_{n,k\in\mathbb N }$ and we prove that such sequence contains only the symbols $\{0,1\}.$ We investigate some number-theoretic properties of such sequence and of the way it can be generated. The…
We study financial systems from a game-theoretic standpoint. A financial system is represented by a network, where nodes correspond to firms, and directed labeled edges correspond to debt contracts between them. The existence of cycles in…
We consider the following two-player game: Maxi and Mini start with the empty graph on $n$ vertices and take turns, always adding one additional edge to the graph such that the chromatic number is at most $k$, where $k \in \mathbb{N}$ is a…
Historically, games of all kinds have often been the subject of study in scientific works of Computer Science, including the field of machine learning. By using machine learning techniques and applying them to a game with defined rules or a…
In this study, we investigate $N$-player stochastic differential games with regime switching, where the player dynamics are modulated by a finite-state Markov chain. We analyze the associated Nash system, which consists of a system of…
We define a family of vertex colouring games played over a pair of graphs or digraphs $(G,H)$ by players $\forall$ and $\exists$. These games arise from work on a longstanding open problem in algebraic logic. It is conjectured that there is…
Learning processes in games explain how players grapple with one another in seeking an equilibrium. We study a natural model of learning based on individual gradients in two-player continuous games. In such games, the arguably natural…
We start with the well-known game below: Two players hold a sheet of paper to their forehead on which a positive integer is written. The numbers are consecutive and each player can only see the number of the other one. In each time step,…
This paper studies the stabilization for a kind of linear and impulse control systems in finite-dimensional spaces, where impulse instants appear periodically. We present several characterizations on the stabilization; show how to design…
We introduce the game Slow $A$-Nim which generalizes a number of recently studied games. Slow $A$-Nim is played on $n$ stacks of tokens, and the set $A$ indicates the number of stacks a player can play on. Once a player has decided on the…
Recent techniques based on Mean Field Games (MFGs) allow the scalable analysis of multi-player games with many similar, rational agents. However, standard MFGs remain limited to homogeneous players that weakly influence each other, and…