We study an infinite-horizon discrete-time optimal stopping problem under non-exponential discounting. A new method, which we call the iterative approach, is developed to find subgame perfect Nash equilibria. When the discount function induces decreasing impatience, we establish the existence of an equilibrium through …
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
48 results for “subgame perfect Nash equilibrium”
Modeling reinsurance market, we find subgame perfect Nash equilibria.
problem Optimizing reinsurance market with multiple insurers and reinsurers.
method Sequential game with Subgame Perfect Nash Equilibria analysis.
result Characterized subgame perfect Nash equilibria in some market cases.
A \emph{new} notion of equilibrium, which we call \emph{strong equilibrium}, is introduced for time-inconsistent stopping problems in continuous time. Compared to the existing notions introduced in ArXiv: 1502.03998 and ArXiv: 1709.05181, which in this paper are called \emph{mild equilibrium} and \emph{weak equilibrium…
A moment constraint that limits the number of dividends in the optimal dividend problem is suggested. This leads to a new type of time-inconsistent stochastic impulse control problem. First, the optimal solution in the precommitment sense is derived. Second, the problem is formulated as an intrapersonal sequential dyna…
Inspired by Strotz's consistent planning strategy, we formulate the infinite horizon mean-variance stopping problem as a subgame perfect Nash equilibrium in order to determine time consistent strategies with no regret. Equilibria among stopping times or randomized stopping times may not exist. This motivates us to cons…
In this paper we propose the notion of dynamic deviation measure, as a dynamic time-consistent extension of the (static) notion of deviation measure. To achieve time-consistency we require that a dynamic deviation measures satisfies a generalised conditional variance formula. We show that, under a domination condition,…
We consider a time-consistent mean-variance portfolio selection problem of an insurer and allow for the incorporation of basis (mortality) risk. The optimal solution is identified with a Nash subgame perfect equilibrium. We characterize an optimal strategy as solution of a system of partial integro-differential equatio…
Study Nash equilibrium between broker and trader in a lit exchange with price impact.
problem Optimizing trading strategies between informed and uninformed traders with broker's inventory penalties.
method Characterized Nash equilibrium through FBSDEs, solved explicitly.
result Explicit solution to trading strategies of broker and informed trader.
DREAM learns optimal strategies in imperfect games without needing a simulator.
problem Learning optimal strategies in imperfect-information games with multiple agents.
method DREAM is a deep reinforcement learning algorithm that converges to Nash Equilibria and coarse correlated equilibria.
result DREAM achieves state-of-the-art performance in benchmark games and is competitive with simulator-based algorithms.
In this paper we extend the investigation into the transition from sure to probabilistic sniping as introduced in Menkveld and Zoican \cite{mz2017}. In that paper, the authors introduce a stylized version of a competitive game in which high frequency traders (HFTs) interact with each other and liquidity traders. The au…
Optimizes asset allocation for risk measures in a Lévy market.
problem Maximizing time-consistent mean-risk reward with general risk measures.
method Uses a generalized Lévy market model and Hamilton-Jacobi-Bellman equation.
result Deterministic optimal solution under certain conditions.
This paper considers the optimal portfolio selection problem in a dynamic multi-period stochastic framework with regime switching. The risk preferences are of exponential (CARA) type with an absolute coefficient of risk aversion which changes with the regime. The market model is incomplete and there are two risky asset…
This paper considers the problem of consumption and investment in a financial market within a continuous time stochastic economy. The investor exhibits a change in the discount rate. The investment opportunities are a stock and a riskless account. The market coefficients and discount factor switch according to a finite…
Model-Free Learning for Two-Player Zero-Sum Partially Observable Markov Games with Perfect Recallstat.ML
Algorithm learns NE in imperfect information games with imperfect feedback.
problem Learning Nash equilibrium in imperfect information games with bandit feedback.
method IXOMD algorithm for model-free learning with convergence rate.
result IXOMD achieves convergence rate to NE.
Study optimal portfolio strategies with time-varying discount rates.
problem Optimizing portfolio decisions with a non-constant discount rate.
method Introduced subgame perfect strategies to handle time inconsistency, using fixed point iteration to find the utility-weighted discount rate.
result Subgame perfect strategies are equivalent to optimal strategies under certain utility function assumptions.
We consider the problem of portfolio optimization with a correlation constraint. The framework is the multiperiod stochastic financial market setting with one tradable stock, stochastic income and a non-tradable index. The correlation constraint is imposed on the portfolio and the non-tradable index at some benchmark t…
An unconventional approach for optimal stopping under model ambiguity is introduced. Besides ambiguity itself, we take into account how ambiguity-averse an agent is. This inclusion of ambiguity attitude, via an -maxmin nonlinear expectation, renders the stopping problem time-inconsistent. We look for subgame perfect…
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.
Paper tackles time inconsistency in portfolio management with stochastic volatility and power utility.
problem Time inconsistency in portfolio management with stochastic volatility and power utility.
method Extended Hamilton Jacobi Bellman (HJB) equation, fixed point iteration, and linear parabolic PDE.
result Subgame perfect strategies are characterized and solved through numerical experiments.
Paper tackles hidden game problem in AI alignment and language games.
problem Hidden game problem in AI alignment and language games.
method Developed a composition of regret minimization techniques to discover and exploit hidden structures.
result Achieved optimal external and swap regret bounds for rapid convergence to correlated equilibria.
Investment strategies for rank-dependent utility agents are derived in a continuous-time market.
problem Time inconsistency in rank-dependent utility models.
method Study of consistent planners seeking intra-personal equilibrium strategies.
result Explicit final wealth profile replicating equilibrium strategies, with scaling function derived.
GANs may not have Nash equilibria, but proximal training can find solutions.
problem Existence of Nash equilibria in GANs optimization.
method Proximal training approach to find solutions.
result Proximal training finds solutions to GAN problems.
Investor optimizes portfolio under dynamic risk preferences.
problem Optimizing investment under uncertain future risk attitudes.
method Developed a general equilibrium framework and solved for subgame-perfect equilibrium policies.
result Equilibrium policies include a novel hedging component to counteract anticipated risk aversion changes.
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…
Proposes a robust equilibrium strategy for mean-variance portfolio selection.
problem Time-inconsistency in mean-variance portfolio selection.
method Introduces a novel definition of robust equilibrium strategy and solves the corresponding PDE system.
result A classical solution to the PDE system implies a robust equilibrium strategy.
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.
Mean Field Portfolio Gamesq-fin.MF
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 Nash equilibrium in non-zero-sum game with Bermudan strategies.
problem Optimizing pay-offs in non-linear non-zero-sum games.
method Recursive construction to find Nash equilibrium.
result Existence of Nash equilibrium in non-zero-sum game.
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.
In this paper, we investigate the Merton portfolio management problem in the context of non-exponential discounting. This gives rise to time-inconsistency of the decision-maker. If the decision-maker at time t=0 can commit his/her successors, he/she can choose the policy that is optimal from his/her point of view, and …
Learning Nash Equilibria in Zero-Sum Stochastic Games via Entropy-Regularized Policy Approximationcs.LG
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.
Policy Gradient Methods Find the Nash Equilibrium in N-player General-sum Linear-quadratic Gamesmath.OC
Policy gradient methods find Nash equilibrium in noisy games.
problem Finding Nash equilibrium in noisy games.
method Policy gradient methods with noise added.
result Policy gradient methods converge to Nash equilibrium in noisy games.
Study shows how multiple traders can trade together without excessive price impact.
problem Coordination issues in trading to exploit a common signal.
method Closed-loop Nash competition model for stochastic differential games.
result Excessive trading reduced but not significantly for practical parameters.
Study Nash equilibrium between broker and informed trader in dealer and lit markets.
problem Nash equilibrium between broker and informed trader in dealer and lit markets with partial information.
method Convex analysis, FBSDEs, polynomial approximation.
result Existence and uniqueness of Nash equilibrium for short time horizons.
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 -player game converges to mean-field equilibrium, and -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.
Transient market impact explained via Nash equilibrium in a game.
problem Understanding the transient nature of market impact.
method Analyzing a game between a trader and an arbitrageur, deriving decay kernels.
result Implied transient impact can be derived from trader behavior at Nash equilibrium.
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.
Entropy-Norm space for geometric selection of strict Nash equilibria in n-person gamesphysics.soc-ph
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…
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…
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 samples.
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…