English
Related papers

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

200 papers

In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…

Logic · Mathematics 2022-06-16 Fedor Pakhomov , James Walsh

While the general theory for the terminal-initial value problem for mean-field games (MFGs) has achieved a substantial progress, the corresponding forward-forward problem is still poorly understood - even in the one-dimensional setting.…

Analysis of PDEs · Mathematics 2016-06-30 Diogo Gomes , Levon Nurbekyan , Marc Sedjro

In this paper, we prove the existence of the equilibrium in choice for games in choice form. These games have recently been introduced by A. Stefanescu, M. Ferrara and M. V. Stefanescu. Our results link the recent research to the older…

Optimization and Control · Mathematics 2016-04-05 Monica Patriche

Parsimonious games are a subset of constant sum homogeneous weighted majority games unequivocally described by their free type representation vector. We show that the minimal winning quota of parsimonious games satisfies a second order,…

Dynamical Systems · Mathematics 2014-02-21 Flavio Pressacco , Giacomo Plazzotta , Laura Ziani

We show that Optimistic Hedge -- a common variant of multiplicative-weights-updates with recency bias -- attains ${\rm poly}(\log T)$ regret in multi-player general-sum games. In particular, when every player of the game uses Optimistic…

Machine Learning · Computer Science 2023-01-26 Constantinos Daskalakis , Maxwell Fishelson , Noah Golowich

This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…

Optimization and Control · Mathematics 2016-05-17 Monica Patriche

Let $G$ be a definable group in a $p$-adically closed field $M$. We show that $G$ has finitely satisfiable generics (fsg) if and only if $G$ is definably compact. The case $M = \mathbb{Q}_p$ was previously proved by Onshuus and Pillay.

Logic · Mathematics 2022-03-30 Will Johnson

Let $K/\mathbf{Q}_p$ be an unramified extension of degree $f$ with residue field $k$. Let $\sigma$ be an irreducible representation of $\mathrm{GL}_n(k)$ over $\overline{\mathbf{F}}_p$. For $n\ge 3$, we prove that the universal…

Number Theory · Mathematics 2026-05-19 Zachary Feng , Heejong Lee , Ray Li , Vaughan McDonald , Nischay Reddy

Empirical game-theoretic analysis (EGTA) is primarily focused on learning the equilibria of simulation-based games. Recent approaches have tackled this problem by learning a uniform approximation of the game's utilities, and then applying…

Computer Science and Game Theory · Computer Science 2022-08-15 Cyrus Cousins , Bhaskar Mishra , Enrique Areyan Viqueira , Amy Greenwald

Let A and B be two first order structures of the same relational vocabulary L. The Ehrenfeucht-Fraisse-game of length gamma of A and B denoted by EFG_gamma(A,B) is defined as follows: There are two players called for all and exists. First…

Logic · Mathematics 2007-05-23 Tapani Hyttinen , Saharon Shelah , Jouko Väänänen

In this brief note, we prove that the existence of Nash equilibria on integer programming games is $\Sigma^p_2$-complete.

Computational Complexity · Computer Science 2019-07-30 Margarida Carvalho

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…

Computer Science and Game Theory · Computer Science 2016-07-13 Stéphane Le Roux , Arno Pauly

In this paper we study a zero-sum switching game and its verification theorems expressed in terms of either a system of Reflected Backward Stochastic Differential Equations (RBSDEs in short) with bilateral interconnected obstacles or a…

Probability · Mathematics 2020-06-30 Said Hamadène , Tingshu Mu

We study mean field games and corresponding $N$-player games in continuous time over a finite time horizon where the position of each agent belongs to a finite state space. As opposed to previous works on finite state mean field games, we…

Probability · Mathematics 2018-02-01 Alekos Cecchin , Markus Fischer

In this paper we consider extended stationary mean field games, that is mean-field games which depend on the velocity field of the players. We prove various a-priori estimates which generalize the results for quasi-variational mean field…

Analysis of PDEs · Mathematics 2013-05-14 Diogo A. Gomes , Stefania Patrizi , Vardan Voskanyan

We introduce a simple extensive-form algorithm for finding equilibria of two-player, zero-sum games. The algorithm is realization equivalent to a generalized form of Fictitious Play. We compare its performance to that of a similar…

Computer Science and Game Theory · Computer Science 2023-10-17 Tim P. Schulze

This paper develops a linear programming approach for mean field games with reflected jump-diffusion dynamics. We first prove the equivalence between the mean field equilibria in the linear programming formulation and those in the weak…

Optimization and Control · Mathematics 2025-11-14 Zongxia Liang , Xiang Yu , Keyu Zhang

Mean field games allow to describe tractable models of dynamic games with a continuum of players, explicit interaction and heterogeneous states. Thus, these models are of great interest for socio-economic applications. A particular class of…

Optimization and Control · Mathematics 2020-10-20 Berenice Anne Neumann

We study projective stationary sets. The Projective Stationary Reflection principle is the statement that every projective stationary set contains an increasing continuous $\in$--chain of length $\omega_1$. We show that if Martin's Maximum…

Logic · Mathematics 2009-09-25 Qi Feng , Thomas Jech

Correlated equilibria are a fundamental solution concept in game theory. However, despite decades of research, the complexity beyond games of polynomial type -- such as extensive-form games, congestion or routing games, and more broadly…

Computer Science and Game Theory · Computer Science 2026-05-19 Ioannis Anagnostides , Constantinos Daskalakis , Gabriele Farina , Noah Golowich , Tuomas Sandholm , Brian Hu Zhang