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

316293124 · Jun 202019922001200920172026
48 results for correlated equilibrium

The paper introduces Robust Correlated Equilibrium for games with time-varying costs and proposes an algorithm to achieve it.

problem Games with time-varying costs and disturbances.
method Proposes Robust Correlated Equilibrium and a decentralized algorithm to learn optimal strategies.
result The algorithm converges to the Robust Correlated Equilibrium, showing no regret for each controller.

Study insurance pricing under correlation ambiguity without increasing prices or reducing utility.

problem Understanding the dependence structure between insurance and financial risks.
method Dynamic equilibrium analysis of insurance pricing with worst-case beliefs.
result Correlation ambiguity does not necessarily increase insurance prices or reduce insurers' utility.

We introduce CSE for MLSF games and devise online learning algorithms for achieving no-external Stackelberg-regret.

problem Learning equilibrium in leader-follower games with noisy bandit feedback.
method Proposed Correlated Stackelberg Equilibrium (CSE) and online learning algorithms balancing exploration and exploitation.
result Achieves no-external Stackelberg-regret, converging to approximate CSE.

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.

We consider a market model that consists of financial investors and producers of a commodity. Producers optionally store some production for future sale and go short on forward contracts to hedge the uncertainty of the future commodity price. Financial investors take positions in these contracts in order to diversify t…

2015-02-02abs ↗pdf ↗

Path-independent equilibrium models improve network performance on harder problems.

problem Improving network performance on harder problem instances.
method Investigated path-independent equilibrium models and their impact on network performance.
result Path independence correlates with better performance on harder problem instances.

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.

This paper introduces Schur-constant equilibrium distribution models of dimension n for arithmetic non-negative random variables. Such a model is defined through the (several orders) equilibrium distributions of a univariate survival function. First, the bivariate case is considered and analyzed in depth, stressing the…

2017-09-28abs ↗pdf ↗

Correlations and other collective phenomena in a schematic model of heterogeneous binary agents (individual spin-glass samples) are considered on the complete graph and also on 2d and 3d regular lattices. The system's stochastic dynamics is studied by numerical simulations. The dynamics is so slow that one can meaningf…

2012-10-11abs ↗pdf ↗

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.

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.

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.

This paper tackles traffic volume estimation challenges with a deep learning method.

problem Underdetermined and non-equilibrium traffic flows.
method Graph-based deep learning method with adaptive attention mechanisms.
result The proposed model achieves high accuracy even with low sensor coverage.

V-learning tackles multiagent reinforcement learning by reducing sample complexity.

problem Curse of multiagents in multiagent reinforcement learning.
method V-learning is a fully decentralized algorithm that learns Nash, correlated, and coarse correlated equilibria.
result V-learning achieves sample complexity that scales with the maximum number of actions per agent, not the joint action space.

The paper solves a portfolio selection problem in incomplete markets by balancing utility and risk.

problem Time-inconsistent portfolio selection in incomplete markets.
method Characterizes equilibrium via a coupled quadratic BSDE system, introduces approximate equilibrium for general cases.
result Established existence theory for equilibrium strategies in special and general cases.

New methods learn correlated equilibria in large games without structural assumptions.

problem Learning correlated equilibria in large, anonymous games with exponential player count.
method Developed Mean-Field correlated and coarse-correlated equilibria, and used classical algorithms to learn them efficiently.
result Efficiently learned correlated equilibria in all games without structural assumptions.

Modeling price formation in intraday electricity markets with renewable generation.

problem Price formation and optimal trading strategies in intraday electricity markets with intermittent renewable generation.
method Developed a tractable equilibrium model using stochastic control theory to identify optimal strategies and exhibit Nash equilibrium.
result Identified optimal trading strategies and exhibited Nash equilibrium in closed form for a finite number of agents and in the asymptotic framework of mean field games.

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.

A new model for heterogeneous populations optimizes consumption and investment over short horizons.

problem Optimizing consumption and investment in economies with a heterogeneous population over short time periods.
method Continuous-time general equilibrium framework with Brownian flow on a type space, solving vanishing-horizon problems under relative-income criteria.
result Existence and characterization of short-horizon Duesenberry equilibrium, with sharp asset-pricing implications.

The paper models insurance market dynamics under uncertainty and financial frictions.

problem Modeling insurer behavior under uncertainty and financial frictions.
method Dynamic equilibrium model of insurance market with competitive insurers maximizing shareholder value.
result Investment can lead to lower insurance prices and negative loadings under certain conditions.

The paper explores how mining costs, rewards, and blockchain security are interconnected.

problem Understanding the interdependencies between mining costs, mining rewards, and blockchain security.
method Theoretical derivation and empirical analysis using daily crypto market data and autoregressive distributed lag approach.
result Cryptocurrency price and mining rewards are intrinsically linked to blockchain security outcomes.

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.

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.

Develops a game-theoretic approach to solve SGEP efficiently.

problem Efficiently solving the symmetric generalized eigenvalue problem for large datasets.
method Formulates SGEP as a Nash equilibrium in a game-theoretic context and develops a parallelizable algorithm.
result Achieves O(dk)O(dk) runtime complexity, making it feasible for large-scale problems.

Paper develops efficient algorithms for learning rationalizable equilibria in multiplayer games.

problem Learning rationalizable behavior in multiplayer games under bandit feedback.
method New algorithms for finding rationalizable Coarse Correlated Equilibria and Correlated Equilibria with polynomial sample complexity.
result Achieved polynomial sample complexity for learning rationalizable equilibria, improving over existing exponential complexity.

Financial markets are prominent examples for highly non-stationary systems. Sample averaged observables such as variances and correlation coefficients strongly depend on the time window in which they are evaluated. This implies severe limitations for approaches in the spirit of standard equilibrium statistical mechanic…

2013-04-18abs ↗pdf ↗

The study uses the Merton model to estimate PD and finds a phase transition affecting convergence speed.

problem Estimating the probability of default (PD) using limited historical data.
method Adopted the Merton model and analyzed phase transitions in default correlation.
result PD estimation converges slowly when temporal correlation decays by power law less than one.

Statistical evaluations of the economic mobility of a society are more difficult than measurements of the income distribution, because they require to follow the evolution of the individuals' income for at least one or two generations. In micro-to-macro theoretical models of economic exchanges based on kinetic equation…

2015-01-27abs ↗pdf ↗

Novel algorithms for multi-agent reinforcement learning reduce sample complexity.

problem Efficiently learning Nash equilibria in multi-agent settings.
method Information-Directed Sampling (IDS) principles applied to multi-agent reinforcement learning.
result Sample-efficient algorithms for learning Nash equilibria in various multi-agent settings.

This study quantifies systemic importance in global banks using a continuous framework that amplifies localized shocks.

problem Analyzing financial contagion and systemic risk in global banks.
method Developed a continuous framework incorporating geographic proximity and interbank network linkages, using a master equation and Feynman-Kac representation.
result The amplification factor correctly identifies systemically important institutions and predicts crisis outcomes.

New research shows no-regret learning is impossible in Markov games under certain assumptions.

problem Achieving no-regret learning in decentralized Markov games.
method Novel application of aggregation techniques from online learning to prove lower bounds.
result No polynomial-time algorithm exists for independent no-regret learning in general-sum Markov games.

We found that factors decay over time, with momentum fitting best.

problem Understanding how factors decay over time and their impact on performance.
method Derived a hyperbolic decay model for factors, tested against linear and exponential alternatives.
result Momentum exhibits hyperbolic decay, outperforming linear and exponential models.

Two-cycle GEILA equilibria are OLG equilibria and vice versa, with applications to indeterminacy and bubbles.

problem Relationship between GEILA and OLG models.
method Proof of equilibrium equivalence and application to indeterminacy and bubbles.
result GEILA and OLG models are equivalent under certain conditions.

We prove the existence of a Radner equilibrium in a model with proportional transaction costs on an infinite time horizon and analyze the effect of transaction costs on the endogenously determined interest rate. Two agents receive exogenous, unspanned income and choose between consumption and investing into an annuity.…

2017-02-06abs ↗pdf ↗