English
Related papers

Related papers: The consistency strength of long projective determ…

200 papers

We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on…

Logic in Computer Science · Computer Science 2026-03-25 Valérie Berthé , Toghrul Karimov , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , James Worrell

Coherent sets of desirable gamble sets is used as a model for representing an agents opinions and choice preferences under uncertainty. In this paper we provide some results about the axioms required for coherence and the natural extension…

Artificial Intelligence · Computer Science 2024-05-17 Catrin Campbell-Moore

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

Dynamical Systems · Mathematics 2018-11-19 Fabien Durand , Valérie Goyheneche

H\"older stability estimate and uniqueness are proven for a retrospective problem of Mean Field Games with a non-quadratic Hamiltonian. The previous result was only for the quadratic Hamiltonian. The main tool is the apparatus of Carleman…

Analysis of PDEs · Mathematics 2023-11-02 Michael V. Klibanov , Mikhail Y. Kokurin , Jingzhi Li

Leveraging tools from the study of linear fractional transformations and algebraic Riccati equations, a local characterization of consistent conjectural variations equilibrium is given for two player games on continuous action spaces with…

Computer Science and Game Theory · Computer Science 2023-06-07 Daniel J. Calderone , Benjamin J. Chasnov , Samuel A. Burden , Lillian J. Ratliff

Concavity and its refinements underpin tractability in multiplayer games, where players independently choose actions to maximize their own payoffs which depend on other players' actions. In concave games, where players' strategy sets are…

Computer Science and Game Theory · Computer Science 2025-12-12 Vincent Leon , Iosif Sakos , Ryann Sim , Antonios Varvitsiotis

In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). The winner is the first one to claim all the edges of some…

Discrete Mathematics · Computer Science 2015-07-19 Asaf Ferber , Pascal Pfister

We consider a system of mean field games with local coupling in the deterministic limit. Under general structure conditions on the Hamiltonian and coupling, we prove existence and uniqueness of the weak solution, characterizing this…

Optimization and Control · Mathematics 2014-01-09 Pierre Cardaliaguet , Philip Jameson Graber

We investigate forms of filter extension properties in the two-cardinal setting involving filters on $P_\kappa(\lambda)$. We generalize the filter games introduced by Holy and Schlicht in \cite{HolySchlicht:HierarchyRamseyLikeCardinals} to…

Logic · Mathematics 2026-02-20 Tom Benhamou , Victoria Gitman

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

Logic · Mathematics 2023-02-17 Saharon Shelah , Alexander Usvyatsov

We study the canonical signaling game, endowing the sender with commitment power: before learning the state, sender designs a strategy, which maps the state into a probability distribution over actions. We provide a geometric…

Theoretical Economics · Economics 2025-02-04 Raphael Boleslavsky , Mehdi Shadmehr

We prove that the determinacy of Gale-Stewart games whose winning sets are infinitary rational relations accepted by 2-tape B\"uchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a…

Logic in Computer Science · Computer Science 2013-12-16 Olivier Finkel

We prove a theorem computing the number of solutions to a system of equations which is generic subject to the sparsity conditions embodied in a graph. We apply this theorem to games obeying graphical models and to extensive-form games. We…

Commutative Algebra · Mathematics 2007-05-23 Ruchira S. Datta

The paper is devoted to inverse Stackelberg games with many players. We consider both static and differential games. The main assumption of the paper is the compactness of the strategy sets. We obtain the characterization of inverse…

Optimization and Control · Mathematics 2014-04-21 Yurii Averboukh

We extend Solovay's theorem about definable subsets of the Baire space to the generalized Baire space ${}^\lambda\lambda$, where $\lambda$ is an uncountable cardinal with $\lambda^{<\lambda}=\lambda$. In the first main theorem, we show that…

Logic · Mathematics 2017-06-14 Philipp Schlicht

Coalition formation over graphs is a well studied class of games whose players are vertices and feasible coalitions must be connected subgraphs. In this setting, the existence and computation of equilibria, under various notions of…

Computer Science and Game Theory · Computer Science 2024-08-22 Angelo Fanelli , Laurent Gourvès , Ayumi Igarashi , Luca Moscardelli

We consider solutions satisfying the Neumann zero boundary condition and a linearized mean field game system in $\Omega \times (0,T)$, where $\Omega$ is a bounded domain in $\mathbb{R}^d$ and $(0,T)$ is the time interval. We prove two kinds…

Analysis of PDEs · Mathematics 2023-04-13 Hongyu Liu , Masahiro Yamamoto

We consider the dynamics, existence and stability of the equilibrium states for large populations of individuals who can play various types of non--cooperative games. The players imitate the most attractive strategies, and the choice is…

Adaptation and Self-Organizing Systems · Physics 2012-04-02 Tadeusz Platkowski , Jan Zakrzewski

We use the indirect evolutionary approach to study evolutionarily stable preferences against multiple mutations in single- and multi-population matching settings, respectively. Players choose strategies to maximize their subjective…

Computer Science and Game Theory · Computer Science 2025-07-08 Yu-Sung Tu , Wei-Torng Juang

We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously;…

Computer Science and Game Theory · Computer Science 2012-01-04 Krishnendu Chatterjee