Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for dynamic Nash equilibrium

By generalizing the measurements on the game experiments of mixed strategy Nash equilibrium, we study the dynamical pattern in a representative dynamic stochastic general equilibrium (DSGE). The DSGE model describes the entanglements of the three variables (output gap [yy], inflation [ππ] and nominal interest rate [$…

2014-10-30abs ↗pdf ↗

Algorithm learns Nash equilibria in stochastic games using entropy-regularized policies.

problem Learning Nash equilibria in zero-sum stochastic games is computationally expensive.
method Entropy-regularized soft policies for Q-function updates.
result Algorithm converges to Nash equilibrium under certain conditions.

New algorithm for solving minimax problems over distributions converges to Nash equilibrium.

problem Solving minimax problems over probability distributions.
method Symmetric Mean-field Langevin Dynamics (MFL-AG and MFL-ABR) with weighted averaging and best response dynamics.
result Converges to mixed Nash equilibrium with average-iterate and last-iterate convergence.

Method identifies mixed Nash equilibria in high dimensions for training mixtures of GANs.

problem Finding Nash equilibria in two-player zero-sum continuous games, especially in high dimensions.
method Parametrizing mixed strategies as mixtures of particles, updating their positions and weights using gradient descent-ascent.
result Global convergence to an approximate equilibrium for the related Langevin gradient-ascent dynamic.

The paper examines Nash equilibrium in GANs for stationary Gaussian processes.

problem Existence and uniqueness of Nash equilibrium in GANs for stationary Gaussian processes.
method Analyzes the existence of Nash equilibrium in GANs for stationary Gaussian processes, considering different discriminator families.
result The existence of Nash equilibrium depends on the discriminator family and symmetry properties of the generator family.

Dynamic pricing policy converges to Nash equilibrium with low regret.

problem Sequential price competition among sellers over multiple periods.
method Semi-parametric least-squares estimation of s-concave demand functions.
result Prices converge to Nash equilibrium with rate O(T1/7)O(T^{-1/7}) and sellers incur regret O(T5/7)O(T^{5/7}).

Modeling dealer competition, internalisation and externalisation impact market dynamics and costs.

problem Understanding and optimizing dealer competition in risky asset markets.
method Variational approach to derive Nash equilibrium for dealer competition.
result Dealers using internalisation are incentivized to increase externalisation, leading to higher hedging costs and wider spreads.

Paper analyzes strategic underreporting in competitive insurance markets.

problem Strategic underreporting by insureds in competitive insurance markets.
method Develops a dynamic insurance market model with two competing companies and a continuum of insureds, examines the interaction between strategic underreporting and competitive pricing under a Bonus-Malus System framework.
result Establishes the existence and uniqueness of the insureds' optimal reporting barrier and its dependence on BMS premiums; proves the existence of Nash equilibrium premium strategies.

Paper tackles stochastic control with mean and higher-order moments, finding Nash equilibria.

problem Time-inconsistent stochastic control problems with mean and higher-order moments.
method Developed closed-loop and open-loop Nash equilibrium controls using PDEs and maximum principles.
result Identical closed-loop and open-loop Nash equilibria controls, independent of state value and random path.

A game-theoretic analysis of DEX competition through dynamic trading fees.

problem Competition between decentralized exchanges (DEXs) and their impact on trading fees and slippage.
method Characterization of an approximate Nash equilibrium via coupled system of partial differential equations and closed-form expressions for equilibrium fees.
result The equilibrium trading fees shift from the oracle price to a weighted average of the oracle and competitors' exchange rates under competition.

Study Nash equilibria in mean field portfolio games with consumption.

problem Finding Nash equilibria in mean field portfolio games with consumption.
method Established a correspondence between equilibria and solutions to FBSDEs, using martingale and dynamic programming principles.
result Proved the uniqueness of Nash equilibrium in closed form under certain conditions.

Paper proposes a mean-field gradient descent for zero-sum games, proving convergence to Nash equilibrium.

problem Finding mixed Nash equilibria in zero-sum games with multiple players.
method Mean-field gradient descent dynamics with time-averaging, incorporating exponentially discounted gradients.
result Exponential convergence rate to mixed Nash equilibrium with respect to total variation metric.

Model analyzes competitive pricing strategies in large markets of perishable products.

problem Maximizing profits in a competitive market of perishable products.
method Mean-field competition model, Hamilton-Jacobi-Bellman equation, iterative numerical algorithm.
result Properties of equilibrium pricing strategies and market dynamics.

Investors' strategic trading affects asset prices, modeled as a game.

problem Investors' trading rates influence asset prices in dynamic markets.
method Model as a non-zero sum singular stochastic differential game, establishing equivalence between best-response and auxiliary control problems.
result Unique Nash equilibrium is deterministic with a closed-form solution.

Efficient algorithm converges to Nash equilibrium in bilinear problems with bandit feedback.

problem Learning dynamics in bilinear saddle-point problems with bandit feedback.
method Uncoupled learning algorithm combining experimental design and FTRL with a tailored regularizer.
result Last-iterate convergence rate of ildeO(T1/4) ilde{O}(T^{-1/4}) in high probability.

Study of LQ MFGs in infinite-dimensional Hilbert spaces.

problem Mean field games in infinite-dimensional settings with stochastic dynamics.
method Analysis of coupled semilinear infinite-dimensional stochastic evolution equations, development of Nash equilibrium.
result Characterization of unique Nash equilibrium in the limit of many agents.

Investigates portfolio selection among competitive agents with mean-variance preferences.

problem Optimizing portfolios with multi-agent competition and relative wealth comparison.
method Reformulated as a constrained, non-homogeneous stochastic linear-quadratic control problem; derived optimal feedback strategies; used decoupling techniques and fixed-point theory to solve nonlinear BSDEs.
result Characterized three scenarios based on market and competition parameters: unique Nash equilibrium, no Nash equilibrium, or infinitely many Nash equilibria.

Algorithm finds Nash equilibria in complex games with function approximation.

problem Learning Nash equilibria in two-player zero-sum Markov Games with nonlinear function approximation.
method Online learning algorithm using upper and lower confidence bounds derived from optimism in the face of uncertainty.
result Achieves O(T)O(\sqrt{T}) regret with polynomial complexity, under mild assumptions.

In this note, we present an existence result of a Nash equilibrium between electricity producers selling their production on an electricity market and buying CO2 emission allowances on an auction carbon market. The producers' strategies integrate the coupling of the two markets via the cost functions of the electricity…

2013-11-06abs ↗pdf ↗

Improved SEG method converges to Nash equilibrium in bilinear games.

problem Stochastic bilinear minimax optimization problem
method Stochastic ExtraGradient (SEG) method with constant step size, iteration averaging, and scheduled restarting.
result Provable convergence to Nash equilibrium under standard settings, optimal convergence rate in interpolation setting.

Study Nash equilibrium in mean field portfolio games with random market parameters.

problem Modeling wealth and relative performance in competitive financial markets.
method Martingale optimality principle approach to characterize Nash equilibrium in mean field FBSDE.
result Unique Nash equilibrium found under weak interaction assumption and market parameters independence.

Study analyzes market equilibrium returns with price impact and transaction costs.

problem Modeling equilibrium returns in markets with strategic order placement and transaction costs.
method Analyzes frictionless and transaction-cost markets, characterizes Nash equilibrium via FBSDEs.
result Equilibrium returns are affected by transaction costs, especially with noise traders.

PAPAL algorithm finds mixed Nash equilibria in continuous games.

problem Finding mixed Nash equilibria in non-convex, non-concave games.
method Particle-based Primal-Dual Algorithm (PAPAL) for weakly entropy-regularized min-max optimization.
result PAPAL offers non-asymptotic convergence guarantees for εε-mixed Nash equilibrium.

This paper analyzes how multiple investors can exploit relative arbitrage opportunities.

problem Analyzing how multiple investors can exploit relative arbitrage opportunities.
method Constructing a well-posed market dynamical system of McKean-Vlasov type, deriving optimal strategies, and finding Nash equilibrium.
result The conditions for relative arbitrage opportunities among competitive investors are derived.

A RL approach finds Nash equilibrium for turn-based zero-sum games.

problem Finding Nash equilibrium in two-player turn-based zero-sum games.
method EIS method combining exploration, policy improvement, and supervised learning.
result EIS method finds an ε-approximate value function of Nash equilibrium in O(ε^(-(d+4))) steps.

This paper investigates the equilibrium interactions between trading targets and private information in a multi-period Kyle (1985) market. There are two investors who each follow dynamic trading strategies: A strategic portfolio rebalancer who engages in order splitting to reach a cumulative trading target and an uncon…

2015-02-07abs ↗pdf ↗

Study on local convergence of min-max algorithms to differential equilibria on Riemannian manifolds.

problem Solving zero-sum differential games on Riemannian manifolds.
method Analysis of two simultaneous min-max algorithms, ττ-GDA and ττ-SGA, to differential Stackelberg and Nash equilibria, with conditions for linear convergence and asymptotic approximation.
result Established sufficient conditions for linear convergence of ττ-GDA and demonstrated faster convergence of ττ-SGA in some cases.

Deep neural network solves large multi-agent games for Markovian Nash equilibrium.

problem Finding Markovian Nash equilibrium in large multi-agent stochastic differential games.
method Reformulate as decoupled decision problems, solve iteratively using deep BSDE method.
result Proposed algorithm accurately finds Nash equilibrium in large games.

The paper explores how regularization can lead to convergence in imperfect information games.

problem Finding equilibrium in imperfect information games with imperfect information.
method Investigates Follow the Regularized Leader dynamics and how adding a regularization term can lead to strong convergence guarantees.
result The approach leads to algorithms that converge exactly to the Nash equilibrium in imperfect information games.

The paper analyzes optimal investment strategies in a game with jump risk, deriving mean field equilibria.

problem Optimal investment strategies in a game with jump risk and peer competition.
method Formulated mean field game and n-player game models, characterized equilibrium states, and derived approximation errors.
result Explicit mean field equilibrium and approximate Nash equilibrium for large n-player games.

This paper tackles global Nash equilibrium in non-convex multi-player games.

problem Challenges in finding global Nash equilibrium due to non-convexity.
method Conjugate transformation and variational inequality formulation to prove existence and design algorithms.
result Designs an ODE-based algorithm with exponential convergence rate and proves its effectiveness in practical scenarios.

Novel approach to Nash equilibrium in mean-field stochastic games with operator resolvents.

problem Finding Nash equilibrium in mean-field stochastic games with mean-field interaction.
method Proposed a novel approach to derive Nash equilibrium semi-explicitly using operator resolvents and stochastic Fredholm equations.
result Equilibrium of the NN-player game converges to mean-field equilibrium, and ε\varepsilon-Nash equilibrium derived as a by-product.

Investigates time-inconsistent portfolio selection under MMV preferences.

problem Time-inconsistent optimal strategies for MMV preferences.
method Nash equilibrium controls for MMV and MV preferences, solving FBSDE and HJB equations.
result MMV optimal strategies lead to higher investment amounts than MV strategies, narrowing over time.