English
Related papers

Related papers: Harder-Narasimhan games

200 papers

In this paper, we study deterministic mean field games for agents who operate in a bounded domain. In this case, the existence and uniqueness of Nash equilibria cannot be deduced as for unrestricted state space because, for a large set of…

Optimization and Control · Mathematics 2017-11-07 Piermarco Cannarsa , Rossana Capuani

Starting from our work on Harder-Narasimhan filtrations of finite flat group schemes over a $p$-adic field, we developp a theory of Harder-Narasimhan filtrations for $p$-divisible groups. We apply this to the study of the geometry of period…

Number Theory · Mathematics 2019-01-25 Laurent Fargues

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

In this paper we propose and analyze a class of $N$-player stochastic games that include finite fuel stochastic games as a special case. We first derive sufficient conditions for the Nash equilibrium (NE) in the form of a verification…

Mathematical Finance · Quantitative Finance 2021-10-26 Xin Guo , Wenpin Tang , Renyuan Xu

This paper presents a general existence and uniqueness result for mean field games equations on graphs ($\mathcal{G}$-MFG). In particular, our setting allows to take into account congestion effects of almost any form. These general…

Optimization and Control · Mathematics 2014-05-09 Olivier Guéant

Semidefinite programming can be considered over any real closed field, including fields of Puiseux series equipped with their nonarchimedean valuation. Nonarchimedean semidefinite programs encode parametric families of classical…

Optimization and Control · Mathematics 2018-02-22 Xavier Allamigeon , Stéphane Gaubert , Ricardo D. Katz , Mateusz Skomra

We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…

Logic · Mathematics 2024-11-08 Nicolas Chavarria

In all of the diverse areas of science where waves play an important role, one of the most fundamental solutions of the corresponding wave equation is a stationary wave with constant intensity. The most familiar example is that of a plane…

We give an example of an orthogonal bundle where the Harder-Narasimhan filtration, with respect to Gieseker semistability, of its underlying vector bundle does not correspond to any parabolic reduction of the orthogonal bundle. A similar…

Algebraic Geometry · Mathematics 2017-07-11 Indranil Biswas , Alfonso Zamora

This work presents a novel policy iteration algorithm to tackle nonzero-sum stochastic impulse games arising naturally in many applications. Despite the obvious impact of solving such problems, there are no suitable numerical methods…

Optimization and Control · Mathematics 2020-06-29 René Aïd , Francisco Bernal , Mohamed Mnif , Diego Zabaljauregui , Jorge P. Zubelli

We prove a scattering result near certain steady states for a Hartree equation for a random field. This equation describes the evolution of a system of infinitely many particles. It is an analogous formulation of the usual Hartree equation…

Analysis of PDEs · Mathematics 2020-07-02 Charles Collot , Anne-Sophie de Suzzoni

We establish the existence and uniqueness of distributed equilibria to possibly nonsymmetric $N$ player differential games with interactions through controls under displacement semimonotonicity assumptions. Surprisingly, the nonseparable…

Analysis of PDEs · Mathematics 2026-04-01 Hei Jie Lam , Alpár R. Mészáros

We consider two classes of constrained finite state-action stochastic games. First, we consider a two player nonzero sum single controller constrained stochastic game with both average and discounted cost criterion. We consider the same…

Optimization and Control · Mathematics 2012-06-11 Vikas Vikram Singh , N. Hemachandra

Potential games and decentralised partially observable MDPs (Dec-POMDPs) are two commonly used models of multi-agent interaction, for static optimisation and sequential decisionmaking settings, respectively. In this paper we introduce…

Computer Science and Game Theory · Computer Science 2012-02-20 Archie C. Chapman , Simon A. Williamson , Nicholas R. Jennings

We investigate stable homology of modules over a commutative noetherian ring $R$ with respect to a semidualzing module $C$, and give some vanishing results that improve/extend the known results. As a consequence, we show that the balance of…

Commutative Algebra · Mathematics 2017-09-11 Li Liang

In recent and past works, convexity is usually assumed on each individual part of the action functional in order to demonstrate the existence and uniqueness of a Nash equilibrium on some interval [0, T] (this meant that each hessian was…

Optimization and Control · Mathematics 2022-10-20 Daniel Block , Moises Reyes Rivas

For modules over an artin algebra a linear stability condition is given by a "central charge" and a nonlinear stability condition is given by the wall-crossing sequence of a "green path". Finite Harder-Narasimhan stratifications of the…

Representation Theory · Mathematics 2023-04-05 Kiyoshi Igusa

We are concerned with the mathematical study of the Mean Field Games system (MFGS). In the conventional setup, the MFGS is a system of two coupled nonlinear parabolic PDEs of the second order in a backward-forward manner, namely one…

Analysis of PDEs · Mathematics 2023-04-04 Michael V. Klibanov , Jingzhi Li , Hongyu Liu

Mean-field games (MFGs) are models for large populations of competing rational agents that seek to optimize a suitable functional. In the case of congestion, this functional takes into account the difficulty of moving in high-density areas.…

Analysis of PDEs · Mathematics 2017-10-05 David Evangelista , Rita Ferreira , Diogo A. Gomes , Levon Nurbekyan , Vardan Voskanyan

We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategies is undecidable, while the existence of a…

Computer Science and Game Theory · Computer Science 2011-09-29 Michael Ummels , Dominik Wojtczak