相关论文: Flashcard games
We establish regularity for functions satisfying a dynamic programming equation, which may arise for example from stochastic games or discretization schemes. Our results can also be utilized in obtaining regularity and existence results for…
Zeckendorf proved that any positive integer has a unique decomposition as a sum of non-consecutive Fibonacci numbers, indexed by $F_1 = 1, F_2 = 2, F_{n+1} = F_n + F_{n-1}$. Motivated by this result, Baird, Epstein, Flint, and Miller…
We introduce a novel class of Nash equilibrium seeking dynamics for non-cooperative games with a finite number of players, where the convergence to the Nash equilibrium is bounded by a KL function with a settling time that can be upper…
John von Neumann studied a simplified version of poker where the "deck" consists of infinitely many cards, in fact, all real numbers between $0$ and $1$. We harness the power of computation, both numeric and symbolic, to investigate analogs…
In this paper, we introduce the third party to achieve the Stackelberg equilibrium with the time inconsistency in three different Stackelberg games, which are the discrete-time games, the dynamic games, and the mean field games. Here all…
There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…
The motion of a spinning football brings forth the possible existence of a whole class of finite dynamical systems where there may be non-denumerably infinite number of fixed points. They defy the very traditional meaning of the fixed point…
This research project investigates the application of several computer vision techniques for playing card detection and recognition in the context of the popular casino game, blackjack. The primary objective is to develop a robust system…
In this article, we establish precise convergence rates of a general class of $N$-Player Stackelberg games to their mean field limits, which allows the response time delay of information, empirical distribution based interactions, and the…
This paper introduces a discrete-time stochastic game class on $\mathbb{Z}^d$, which plays the role of a toy model for the well-known problem of stochastic homogenization of Hamilton-Jacobi equations. Conditions are provided under which the…
Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial…
In this paper, we attempt to define and understand the orbits of the Koch snowflake fractal billiard $KS$. This is a priori a very difficult problem because $\partial(KS)$, the snowflake curve boundary of $KS$, is nowhere differentiable,…
Schmidt's game, and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the…
A finite impartial game is a two-player game in which the players take turns making moves and the game ends after finitely many moves. In this paper, we study a class of finite impartial games introduced by H.~Lenstra, which we call coin…
One of the major breakthroughs in science of the last (20th) century was building a bridge between the worlds of stochastic (random) systems and deterministic (dynamical) systems. It was started by the celebrated 1958 paper by…
The aim of this work is to put together two novel concepts from the theory of integrable billiards: billiard ordered games and confocal billiard books. Billiard books appeared recently in the work of Fomenko's school, in particular of V.…
This document describes concisely the ubiquitous class of exponential family distributions met in statistics. The first part recalls definitions and summarizes main properties and duality with Bregman divergences (all proofs are skipped).…
The study of linear-quadratic stochastic differential games on directed networks was initiated in Feng, Fouque \& Ichiba \cite{fengFouqueIchiba2020linearquadratic}. In that work, the game on a directed chain with finite or infinite players…
We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…
We investigate infinite games on finite graphs where the information flow is perturbed by nondeterministic signalling delays. It is known that such perturbations make synthesis problems virtually unsolvable, in the general case. On the…