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

275582109 · Jun 202019922001200920172026
48 results for Markov perfect equilibrium

The paper analyzes strategic irreversible investments with novel dynamic strategies.

problem Tradeoff between preemption incentives and option value of waiting in oligopolistic markets.
method Developed novel Markov perfect equilibrium to handle singular control of optimal investment.
result Simpler strategies lead to a 'preemption trap' with zero net present values.

The paper addresses dynamic capital structure models with defaultable debt, proving existence and uniqueness.

problem Dynamic capital structure models with an investor break-even condition may not generate a contraction mapping.
method Provided an example and used a dual problem and change of measure to prove existence and uniqueness.
result A unique Markov-perfect equilibrium exists where firm decisions reflect state-dependent targets.

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 1/T1/\sqrt{T} convergence rate.
result IXOMD achieves 1/T1/\sqrt{T} convergence rate to NE.

Counterfactual Regret Minimization (CFR) has found success in settings like poker which have both terminal states and perfect recall. We seek to understand how to relax these requirements. As a first step, we introduce a simple algorithm, local no-regret learning (LONR), which uses a Q-learning-like update rule to allo…

2019-10-07abs ↗pdf ↗

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.

The paper analyzes trade execution strategies for large traders in a stochastic market environment.

problem Analyzing trade execution strategies in a stochastic market with price impact.
method Formulated a Markov game model and used backward induction method of dynamic programming.
result Explicit closed-form execution strategy at Markov perfect equilibrium.

Study efficient offline RL in Markov games with general models.

problem Learn approximate equilibria from offline data in Markov games.
method Use Bellman-consistent pessimism for interval estimation and optimize gap relaxation.
result First framework for sample-efficient offline learning in Markov games, handling all equilibria.

Investor selects portfolios based on news attention in a hidden Markov model.

problem Mean-variance portfolio selection in a dynamic attention context.
method Closed-loop equilibrium strategies via extended HJB equation and Markov chain approximation.
result Equilibrium strategies found through iterative algorithm and numerical examples.

The existence of stationary Markov perfect equilibria in stochastic games is shown under a general condition called "(decomposable) coarser transition kernels". This result covers various earlier existence results on correlated equilibria, noisy stochastic games, stochastic games with finite actions and state-independe…

2013-11-07abs ↗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.

The paper explores triangulations of spheres and projective spaces, focusing on Hopf triangulations and equilibrium structures.

problem Investigating simplicial versions of sphere decompositions and their applications to projective spaces.
method Developing Hopf triangulations and equilibrium triangulations of spheres and projective spaces, focusing on the central torus and its properties.
result No perfect equilibrium triangulation of CP3\mathbb{C}P^3 exists, while CP2\mathbb{C}P^2 has a unique perfect equilibrium triangulation.

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.

We solve a continuous-time game-theoretic problem for Kihlstrom-Mirman preferences.

problem Dynamic inconsistency in preferences due to multiattribute utility theory.
method Formalized an equilibrium control theory for continuous-time Markov processes.
result Equilibrium strategy and value function as solution to extended HJB system.

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…

2013-03-06abs ↗pdf ↗

This paper improves sample efficiency for learning equilibria in multi-player games.

problem Sample-efficient learning of equilibria in games with many players.
method Designs algorithms for learning CCE and CE with polynomial sample complexity in the number of players.
result First to show polynomial sample complexity for learning CCE and CE in multi-player games.

Efficient reinforcement learning for simultaneous-move zero-sum games using optimistic value iteration.

problem Learning optimal strategies in simultaneous-move zero-sum Markov games with function approximation.
method Developed an optimistic variant of least-squares minimax value iteration algorithm for offline and online settings.
result Achieved an upper bound of ildeO(d3H3T) ilde O(\sqrt{d^3 H^3 T}) on duality gap and regret.

New assumptions and algorithm solve offline two-player zero-sum Markov games.

problem Solving offline two-player zero-sum Markov games under insufficient assumptions.
method Proposed unilateral concentration assumption and pessimism-type algorithm.
result Algorithm efficiently learns Nash equilibrium under unilateral concentration.

Given a hyperbolic domain, the nearest point retraction is a conformally natural homotopy equivalence from the domain to the boundary of the convex core of its complement. Marden and Markovic showed that if the domain is uniformly perfect, then there exists a conformally natural quasiconformal map which admits a bounde…

2011-10-10abs ↗pdf ↗

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.

Algorithm finds ε-equilibrium policies for multi-agent Markov games with hidden low-rank structure.

problem Designing efficient algorithms for multi-agent Markov games with unknown representation and hidden low-rank structure.
method Model-based and model-free approaches using representation learning to construct an effective representation from data.
result Achieves poly(H,d,A,1/ε)(H,d,A,1/\varepsilon) sample complexity for both model-based and model-free approaches.

This paper formulates a model of utility for a continuous time framework that captures the decision-maker's concern with ambiguity about both volatility and drift. Corresponding extensions of some basic results in asset pricing theory are presented. First, we derive arbitrage-free pricing rules based on hedging argumen…

2013-01-20abs ↗pdf ↗

In a continuous time stochastic economy, this paper considers the problem of consumption and investment in a financial market in which the representative investor exhibits a change in the discount rate. The investment opportunities are a stock and a riskless account. The market coefficients and discount factor switches…

2011-07-10abs ↗pdf ↗

New RL algorithms find SNE in Markov games with myopic followers.

problem Finding SNE in Markov games with myopic followers.
method Optimistic and pessimistic variants of least-squares value iteration, incorporating function approximation.
result First provably efficient RL algorithms for SNEs in general-sum Markov games with myopic followers.

Our study shows that many firms would accumulate at zero output level (namely, Bankruptcy status) if a perfectly competitive market reaches full employment (namely, those people who should obtain employment have obtained employment). As a result, appearance of economic crisis is determined by two points; that is, (a). …

2010-10-22abs ↗pdf ↗

Model equilibrium price in intraday electricity markets with uncertainty.

problem Formulate equilibrium model for intraday electricity trading with balancing constraints and uncertainty.
method Develop equilibrium model with agents' balancing constraints, forecasted consumption, production uncertainties, and Markov chain outages.
result Existence and uniqueness of equilibrium price as a martingale, with insights into price formation and impact of uncertainty.

Algorithm learns robust equilibrium in online Markov games with interactive data.

problem Sim-to-real gap in reinforcement learning.
method Distributionally robust RL with minimum value assumption, least square value iteration.
result Sample-efficient algorithm for robust equilibrium in online Markov games.

New algorithm improves sample efficiency for zero-sum Markov games.

problem Improving sample efficiency for model-free algorithms in zero-sum Markov games.
method Proposes a model-free stage-based Q-learning algorithm using variance reduction techniques.
result Achieves optimal sample complexity for finding ε-optimal Nash Equilibrium.

Tax systems ensure sustainable economic development by adjusting production technologies and gross output volumes.

problem Ensuring sustainable economic development through optimal tax systems.
method Explicit formulas and mathematical proofs for tax systems based on production technologies and gross output volumes.
result The vector of gross output must belong to the interior of the cone formed by the columns of the total cost matrix under perfect taxation systems.

Proves simplicity of Lyapunov exponents for specific Anosov flows.

problem Proving all Lyapunov exponents have multiplicity 1 for certain Anosov flows.
method Perturbative results for flows, modification of eigenvalues, Markov partition, and simplicity criterion.
result In a C1C^1-open and CkC^k-dense set of Anosov flows, all Lyapunov exponents have multiplicity 1.

New findings show pure strategy equilibria are more robust in a war of attrition game.

problem Analyzing a game of war of attrition under complete information.
method Examined the stability of equilibria in pure and mixed strategies under varying payoffs.
result Pure strategy equilibria are more robust to perturbations of the canonical model.

Paper connects RL and non-equilibrium statistical mechanics for entropy-regularized RL.

problem Obtaining analytical solutions for entropy-regularized RL.
method Mapping RL to non-equilibrium statistical mechanics, applying large deviation theory.
result Derives exact analytical results for optimal policy and dynamics in MDPs.