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,695 papers · 148 categories

Trend · papers per month

142284425567 · Jun 202019922001200920172026
48 results for distributional Nash equilibrium

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.

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.

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.

Policy mirror ascent achieves Nash equilibrium in mean field games without a population generative model.

problem Achieving Nash equilibrium in mean field games without a population generative model.
method Policy mirror ascent, contractive operator, single-path TD learning.
result Policy mirror ascent converges to Nash equilibrium within O~(ε2)\widetilde{\mathcal{O}}(\varepsilon^{-2}) samples.

New systemic risk models for banks choosing their group memberships.

problem Analyzing systemic risk for banks in disjoint and overlapping groups.
method Proposed new models with realistic game features, introducing Nash equilibrium for optimal solution.
result Explicit solution for risk allocation and existence/uniqueness of Nash equilibrium.

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.

Study optimal transport for robust optimization, showing how adversary's strategy relates to regularization.

problem Optimizing under uncertain parameters with a fictitious adversary reshaping a reference distribution.
method Introduces optimal transport and regularization to relate robustification to variation and Lipschitz norms.
result Conditions for existence and computability of Nash equilibrium between decision-maker and adversary.

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.

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.

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.

Proves minimax sample complexity for turn-based stochastic games.

problem Proving theoretical guarantees for reinforcement learning in turn-based stochastic games.
method Developing absorbing TBSG and reward perturbation techniques to handle statistical dependence.
result Empirical Nash equilibrium strategy approximates true Nash equilibrium in turn-based stochastic games.

Deep fictitious play converges to Nash equilibrium in stochastic differential games.

problem Finding Nash equilibrium in large stochastic differential games.
method Decouples the game into sub-optimization problems and solves each player's optimal strategy with deep BSDE method.
result Deep fictitious play converges to the true Nash equilibrium.

The paper develops a new algorithm for constructing minimax estimators using online learning techniques.

problem Designing minimax estimators for probability distribution parameters.
method Viewing the problem as a zero-sum game and using online learning with non-convex losses to find a Nash equilibrium.
result The algorithm constructs both a minimax estimator and a least favorable prior.

Proposes a new criterion for selecting Nash equilibria considering both utility and inequality.

problem Finding a fair Nash equilibrium in group decision-making.
method Introduces entropy-norm space for geometric selection of strict Nash equilibria.
result The closest entropy-norm pair to the largest entropy-norm pair in rescaled space is the most suitable equilibrium.

In this paper we review our earlier work on quantum computing and the Nash Equilibrium, in particular, tracing the history of the discovery of new Nash Equilibria and then reviewing the ways in which quantum computing may be expected to generate new classes of Nash equilibria. We then extend this work through a substan…

2007-07-03abs ↗pdf ↗

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.

Paper analyzes adversarial attacks and defenses using game theory.

problem Unclear conditions for optimal attacks and defenses in adversarial learning.
method Game-theoretic framework with locally linear decision boundary model.
result Fast Gradient Method attack and Randomized Smoothing defense form a Nash Equilibrium.

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.

Save for some special cases, current training methods for Generative Adversarial Networks (GANs) are at best guaranteed to converge to a `local Nash equilibrium` (LNE). Such LNEs, however, can be arbitrarily far from an actual Nash equilibrium (NE), which implies that there are no guarantees on the quality of the found…

2018-06-18abs ↗pdf ↗

Agents trained with reinforcement learning deviate from Nash equilibrium in optimal execution game.

problem Deviation of reinforcement learning strategies from Nash equilibrium in optimal execution game.
method Two-player optimal execution game with reinforcement learning algorithms (Double Deep Q-Learning).
result Strategies learned by agents deviate significantly from Nash equilibrium, exhibiting supra-competitive solutions.

Data-driven modeling increasingly requires to find a Nash equilibrium in multi-player games, e.g. when training GANs. In this paper, we analyse a new extra-gradient method for Nash equilibrium finding, that performs gradient extrapolations and updates on a random subset of players at each iteration. This approach prova…

2019-05-29abs ↗pdf ↗

Study Nash competition among dealers quoting prices to clients with unknown trading motives.

problem Adverse selection and inventory costs in dealer-client interactions.
method Analyzes one-shot Nash competition with unknown client type and inventory constraints.
result Unique symmetric Nash equilibrium exists and can be characterized by a nonlinear ODE.

New algorithms converge faster to Nash equilibrium in zero-sum games with bandit feedback.

problem Learning in zero-sum games with bandit feedback without communication.
method Developed two uncoupled algorithms achieving optimal rate of Ω(T1/4)Ω(T^{-1/4}).
result Achieved optimal rate of Ω(T1/4)Ω(T^{-1/4}) for convergence of policy profiles to Nash equilibrium.

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.

In this paper we use game theory to model poisoning attack scenarios. We prove the non-existence of pure strategy Nash Equilibrium in the attacker and defender game. We then propose a mixed extension of our game model and an algorithm to approximate the Nash Equilibrium strategy for the defender. We then demonstrate th…

2019-06-07abs ↗pdf ↗

In his lectures at College de France, P.L. Lions introduced the concept of Master equation, see [5] for Mean Field Games. It is introduced in a heuristic fashion, from the system of partial differential equations, associated to a Nash equilibrium for a large, but finite, number of players. The method, also explained in…

2014-04-16abs ↗pdf ↗

Two firms compete in a financial market, choosing dividend strategies to avoid default and maximize profits.

problem Strategic interaction between two financially constrained firms in a market with default risk.
method Construct Nash equilibria in feedback form for a class of two-person stochastic games of singular control.
result Explicit identification of optimal strategies and equilibrium payoffs for different initial conditions.

Study equilibrium consumption habits in a large population using mean field games.

problem Equilibrium consumption under external habit formation in a large population.
method Formulated and solved mean field games for linear and multiplicative habit formation preferences, constructed approximate Nash equilibria for large n-player games.
result Characterized mean field equilibrium strategies and derived financial implications.

Decentralized algorithm reduces regret and converges to Nash equilibrium in online congestion games.

problem Online congestion games with exponential action sets and strict Nash equilibria.
method CongestEXP algorithm using exponential weights method.
result CongestEXP achieves O(kFT)O(kF\sqrt{T}) regret bound and almost exponential convergence to strict 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 ↗

Optimal algorithm for two-player zero-sum games with linear parameterization.

problem Finding Nash Equilibrium in two-player zero-sum Markov games with linear transition.
method Nash-UCRL algorithm, Coarse Correlated Equilibrium, Optimism-in-Face-of-Uncertainty.
result Proves ildeO(dHT) ilde{O}(dH\sqrt{T}) regret bound, matching lower bound up to logarithmic factors.