Related papers: $F_\sigma$ Games and Reflection in $L(\mathbb{R})$
We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM…
We discuss quantitative Calder\'on-Zygmund estimates in $W^{2,2}$ for 2D viscous Hamilton-Jacobi equations with natural growth in the gradient. We apply the result to obtain the existence of classical solutions for stationary second order…
We propose in this paper a polynomial representation of TU-games, fuzzy measures, capacities, and more generally set functions. Our representation needs a countably infinite set of players and the natural ordering of finite sets of…
We study the existence of positional strategies for the protagonist in infinite duration games over arbitrary game graphs. We prove that prefix-independent objectives in $\Sigma_0^2$ which are positional and admit a (strongly) neutral…
Game comonads offer a categorical view of a number of model-comparison games central to model theory, such as pebble and Ehrenfeucht-Fra\"iss\'e games. Remarkably, the categories of coalgebras for these comonads capture preservation of…
We study the short-time existence and uniqueness of solutions to a coupled system of partial differential equations arising in mean field game theory. It has the generic form $$ \left\{ \begin{array}{c} -\partial_t u - \Delta u +…
We study representations of $GL_{n}(\mathbb{F}_{q})$ that are distinguished with respect to a symmetric subgroup $H=GL_{n}(\mathbb{F}_{q})^{\sigma}$, where $\sigma$ is an involution. We prove that those representations satisfy $\pi \cong…
We show that the problem of deciding whether in a multi-player perfect information recursive game (i.e. a stochastic game with terminal rewards) there exists a stationary Nash equilibrium ensuring each player a certain payoff is Existential…
We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove…
We consider a stationary Mean Field Games system defined on a network. In this framework, the transition conditions at the vertices play a crucial role: the ones here considered are based on the optimal control interpretation of the…
A notion of incentive for agents is introduced which leads to a very general notion of an equilibrium for a finite game. Sufficient conditions for the existence of these equilibria are given. Known existence theorems are shown to be…
We examine the relationship between Dependence Logic and game logics. A variant of Dynamic Game Logic, called Transition Logic, is developed, and we show that its relationship with Dependence Logic is comparable to the one between…
In this paper, we introduce an agent-based representation of games, in order to propose a compact representation for multi-party games in game theory. Our method is inspired by concepts in process theory and process algebra. In addition, we…
We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…
Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…
The Full Strategy Minority Game (FSMG) is an instance of the Minority Game (MG) which includes a single copy of every potential agent. In this work, we explicitly solve the FSMG thanks to certain symmetries of this game. Furthermore, by…
Game theory provides an effective way to model strategic interactions among rational agents. In the context of formal verification, these ideas can be used to produce guarantees on the correctness of multi-agent systems, with a diverse…
Subtraction games are a classical topic in Combinatorial Game Theory. A result of Golomb~(1966) shows that every subtraction game with a finite move set has an eventually periodic nim-sequence, but the known proof yields only an exponential…
Fictitious play (FP) is a history-based strategy to choose actions in normal-form games, where players best-respond to the empirical frequency of their opponents' past actions. While it is well-established that FP converges to the set of…
We examine the Zermelo Fraenkel set theory with Choice (ZFC) enhanced by one of the (structural) reflection principles down to a small cardinal and/or Recurrence Axioms defined below. The strongest forms of reflection principles spotlight…