Related papers: Increasing the second uniform indiscernible by str…
Aiming to provide a new class of game dynamics with good long-term rationality properties, we derive a second-order inertial system that builds on the widely studied "heavy ball with friction" optimization method. By exploiting a well-known…
We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
We obtain a exponential large deviation upper bound for continuous observables on suspension semiflows over a non-uniformly expanding base transformation with non-flat singularities and/or discontinuities, where the roof function defining…
Usually, to apply game-theoretic methods, we must specify utilities precisely, and we run the risk that the solutions we compute are not robust to errors in this specification. Ordinal games provide an attractive alternative: they require…
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 metrizable arc-connected topological group…
Here, we prove the existence of smooth solutions for mean-field games with a singular mean-field coupling; that is, a coupling in the Hamilton-Jacobi equation of the form $g(m)=-m^{-\alpha}$. We consider stationary and time-dependent…
We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…
The purpose of this article is to show that an intrinsic noise with values in the space ${\mathcal P}({\mathbb R})$ of $1d$ probability measures may force uniqueness to first order mean field games. The structure of the noise is inspired…
We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…
Using the notion of visibility representations, our paper establishes a new property of instances of the Nondeterministic Constraint Logic (NCL) problem (a PSPACE-complete problem that is very convenient to prove the PSPACE-hardness of…
Broadbent and G\"oller (FSTTCS 2012) proved the undecidability of bisimulation equivalence for processes generated by epsilon-free second-order pushdown automata. We add a few remarks concerning the used proof technique, called Defender's…
We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, "Simple unified form for the major no-hidden-variables theorems," Phys.…
Hopping forcing is a single player combinatorial game in which the player is presented a graph on $n$ vertices, some of which are initially blue with the remaining vertices being white. In each round $t$, a blue vertex $v$ with all…
Deep learning is built on the foundational guarantee that gradient descent on an objective function converges to local minima. Unfortunately, this guarantee fails in settings, such as generative adversarial nets, that exhibit multiple…
We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular…
Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…
We show that computing approximate stationary Markov coarse correlated equilibria (CCE) in general-sum stochastic games is computationally intractable, even when there are two players, the game is turn-based, the discount factor is an…
We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current…
In this paper we study second order stationary Mean Field Game systems under density constraints on a bounded domain $\Omega \subset \mathbb{R}^d$. We show the existence of weak solutions for power-like Hamiltonians with arbitrary order of…