Related papers: $F_\sigma$ Games and Reflection in $L(\mathbb{R})$

Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…

Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…

For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of…

We apply the generalized conditional gradient algorithm to potential mean field games and we show its well-posedeness. It turns out that this method can be interpreted as a learning method called fictitious play. More precisely, each step…

Let $p$ be a prime, $k$ a finite extension of $\mathbf{F}_p$ of cardinal $q$, $l$ a finite extension of $k$ of group $\Sigma=\mathrm{Gal}(l|k)$, and $T$ a subgroup of $l^\times$. Using the method of "little groups", we classify irreducible…

We consider an $\alpha$-relaxed projection $P_A^\alpha:H\to H$ given by $P_A^\alpha(x)=\alpha P_A(x)+(1-\alpha)x$ where $\alpha\in[0,1]$ and $P_A$ is the projection onto a non-empty, convex and closed subset $A$ of the real Hilbert space…

We consider a dynamical approach to game in extensive forms. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding…

We study positional properties in the context of game-based reactive synthesis. Our motivation stems from having a usable specification logic, for which tractable synthesis is guaranteed. We demonstrate that every $\omega$-regular…

We show a simple geometric procedure for an extension of a loop realized as the image $\Sigma ^{\ast}$ of a sharply transitive section in a subgroup $G^{\ast}$ of the projective linear group $PGL(n-1, \mathbb K)$ to a loop realized as the…

Game-theoretic characterizations of process equivalences traditionally form a central topic in concurrency; for example, most equivalences on the classical linear-time / branching-time spectrum come with such characterizations. Recent work…

The formulation of Mean Field Games (MFG) typically requires continuous differentiability of the Hamiltonian in order to determine the advective term in the Kolmogorov--Fokker--Planck equation for the density of players. However, in many…

We construct (\alpha ,\beta) and \alpha -winning sets in the sense of Schmidt's game, played on the support of certain measures (very friendly and awfully friendly measures) and show how to derive the Hausdorff dimension for some. In…

This paper presents a class of evolutive Mean Field Games with multiple solutions for all time horizons T and convex but non-smooth Hamiltonian H, as well as for smooth H and T large enough. The phenomenon is analyzed in both the PDE and…

Let $\mathrm{G} = \mathrm{Gl}_{n}(K)$, and $\mathrm{H} = \mathrm{G}^{\sigma}$ for $\sigma$ an involution of the form $g\rightarrow aga^{-1}$, It is known that for $K =\mathbb{Q}_q$ any irreducible representation of $\mathrm{G}$ with an…

We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial…

First-order game logic GL and the first-order modal mu-calculus Lmu are proved to be equiexpressive and equivalent, thereby fully aligning their expressive and deductive power. That is, there is a semantics-preserving translation from GL to…

We show a parallel repetition theorem for the entangled value $\omega^*(G)$ of any two-player one-round game $G$ where the questions $(x,y) \in \mathcal{X}\times\mathcal{Y}$ to Alice and Bob are drawn from a product distribution on…

Classically, any structure for a signature $\Sigma$ may be completed to a model of a desired regular theory $T$ by means of the chase construction or small object argument. Moreover, this exhibits $\mathrm{Mod}(T)$ as weakly reflective in…

We consider forward-forward Mean Field Game (MFG) models that arise in numerical approximations of stationary MFGs. First, we establish a link between these models and a class of hyperbolic conservation laws as well as certain nonlinear…

The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…