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

6.3%12.5%18.8%25.0% · Apr 199319922001200920172026
48 results for continuous games

The paper proposes a method to learn the structure of continuous-action games with non-parametric utilities using a limited number of samples.

problem Learning the exact structure of continuous-action games with non-parametric utility functions.
method An 1\ell_1 regularized method that encourages sparsity of the Fourier transform coefficients of the utility functions, accessed via a few Nash equilibria and their noisy utilities.
result The method recovers the exact structure of the utility functions and the game structure with provable theoretical guarantees.

Study proves value of non-Markovian games with partial, asymmetric info.

problem Value of non-Markovian Dynkin games with partial and asymmetric information.
method Probabilistic and functional analytic approach based on Sion's min-max theorem.
result Existence of optimal strategies for both players in randomised stopping times.

Motivated by the recent applications of game-theoretical learning techniques to the design of distributed control systems, we study a class of control problems that can be formulated as potential games with continuous action sets, and we propose an actor-critic reinforcement learning algorithm that provably converges t…

2014-12-01abs ↗pdf ↗

This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's value to be continuous with respect to the time horizon are obtained using recent …

2014-11-17abs ↗pdf ↗

Study policy gradient for large-agent mean-field control and game in continuous time.

problem Optimal policy learning for large number of agents in continuous-time mean-field systems.
method Policy gradient method applied to linear-quadratic mean-field control and game models.
result Policy gradient converges to optimal solution at a linear rate for both mean-field control and game.

Gradient-based methods for games suffer from discrete update steps that cause drift, affecting performance.

problem Gradient-based methods for two-player games suffer from drift due to discrete update steps.
method Derived modified continuous dynamical systems to closely follow the discrete dynamics of games.
result Identified distinct components of discretization drift that can alter or destabilize game performance.

We show that the shortfall risk of binomial approximations of game (Israeli) options converges to the shortfall risk in the corresponding Black--Scholes market considering Lipschitz continuous path-dependent payoffs for both discrete- and continuous-time cases. These results are new also for usual American style option…

2008-11-12abs ↗pdf ↗

New framework for analyzing games with multi-dimensional singular controls and non-linear jumps.

problem Analyzing games with multi-dimensional singular controls and non-linear jump impacts.
method Probabilistic framework with novel class of MFGs (MFGs of parametrisations).
result Existence of equilibria and equivalence with MFGs of singular controls.

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.

A core novelty of Alpha Zero is the interleaving of tree search and deep learning, which has proven very successful in board games like Chess, Shogi and Go. These games have a discrete action space. However, many real-world reinforcement learning domains have continuous action spaces, for example in robotic control, na…

2018-05-24abs ↗pdf ↗

In this paper we consider Dynkin's games with payoffs which are functions of an underlying process. Assuming extended weak convergence of underlying processes {S(n)}n=0\{S^{(n)}\}_{n=0}^{\infty} to a limit process SS we prove convergence Dynkin's games values corresponding to {S(n)}n=0\{S^{(n)}\}_{n=0}^{\infty} to the Dynkin's game…

2009-08-25abs ↗pdf ↗

In this paper we study iterative procedures for stationary equilibria in games with large number of players. Most of learning algorithms for games with continuous action spaces are limited to strict contraction best reply maps in which the Banach-Picard iteration converges with geometrical convergence rate. When the be…

2012-10-17abs ↗pdf ↗

Paper studies convergence of Mean-Field GDA dynamics for MNE of continuous games.

problem Finding mixed Nash equilibria in continuous games.
method Two-scale Mean-Field Gradient Descent Ascent dynamics.
result Two-scale Mean-Field GDA converges exponentially to MNE without convexity assumptions.

Novel approach finds implicit regularisation in two-player games using BEA.

problem Understanding implicit regularisation in two-player games.
method Using backward error analysis to construct continuous-time flows with gradient-eligible vector fields.
result Identifies new implicit regularisation effects in two-player games.

Graphon game model simplifies stochastic interactions among agents.

problem Complex interactions among heterogeneous agents in stochastic games.
method Introduced a discrete-time graphon game formulation with a representative player.
result Existence and uniqueness of graphon equilibrium proven with mild assumptions.

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.

We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend on the amount wagered on those outcomes. By varying the `reality map', which rel…

2009-02-01abs ↗pdf ↗

This paper studies a two-person trading game in continuous time that generalizes Garivaltis (2018) to allow for stock prices that both jump and diffuse. Analogous to Bell and Cover (1988) in discrete time, the players start by choosing fair randomizations of the initial dollar, by exchanging it for a random wealth whos…

2018-12-11abs ↗pdf ↗

Study on convergence of Langevin dynamics for zero-sum games in probability distributions.

problem Analyzing convergence of Langevin dynamics for zero-sum games in probability distributions.
method Proved exponential and biased convergence guarantees for mean-field and finite-particle min-max Langevin dynamics.
result Explicit iteration complexity for finite-particle algorithms to approximate equilibrium distributions.

Stackelberg Games are gaining importance in the last years due to the raise of Adversarial Machine Learning (AML). Within this context, a new paradigm must be faced: in classical game theory, intervening agents were humans whose decisions are generally discrete and low dimensional. In AML, decisions are made by algorit…

2019-08-19abs ↗pdf ↗

End-to-end model predicts multiagent trajectories using game theory and neural nets.

problem Predicting trajectories of interacting agents in complex scenarios.
method Hybrid neural net with game-theoretic reasoning, using implicit layers to map preferences to Nash equilibria.
result Trains an interpretable model that predicts future trajectories and transfers to decision making.

Paper presents a new approach to a strategic insider equilibrium problem in continuous time.

problem Continuous time Kyle-Back model between insider and market marker.
method Uses forward-backward stochastic differential equations (FBSDEs) for characterization of equilibria.
result Characterizes all equilibria through FBSDEs and shows uniqueness of equilibrium without Markovian restrictions.

We justify and give error estimates for binomial approximations of game (Israeli) options in the Black--Scholes market with Lipschitz continuous path dependent payoffs which are new also for usual American style options. We show also that rational (optimal) exercise times and hedging self-financing portfolios of binomi…

2006-07-05abs ↗pdf ↗

The paper simplifies multi-agent RL dynamics in finite-state Markov games using homogenization.

problem Approximating complex multi-agent reinforcement learning dynamics in finite-state Markov games.
method Rescaling learning process by reducing learning rate and increasing update frequency, proving convergence to an ODE.
result The rescaled process converges to an ODE that approximates the agent's learning dynamics.

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.

A new definition of events of game-theoretic probability zero in continuous time is proposed and used to prove results suggesting that trading in financial markets results in the emergence of properties usually associated with randomness. This paper concentrates on "qualitative" results, stated in terms of order (or or…

2007-12-08abs ↗pdf ↗

We formulate a general framework for competitive gradient-based learning that encompasses a wide breadth of multi-agent learning algorithms, and analyze the limiting behavior of competitive gradient-based learning algorithms using dynamical systems theory. For both general-sum and potential games, we characterize a non…

2018-04-16abs ↗pdf ↗

We use martingale and stochastic analysis techniques to study a continuous-time optimal stopping problem, in which the decision maker uses a dynamic convex risk measure to evaluate future rewards. We also find a saddle point for an equivalent zero-sum game of control and stopping, between an agent (the "stopper") who c…

2009-09-27abs ↗pdf ↗

Game contingent claims (GCCs) generalize American contingent claims by allowing the writer to recall the option as long as it is not exercised, at the price of paying some penalty. In incomplete markets, an appealing approach is to analyze GCCs like their European and American counterparts by solving option holder's an…

2017-07-28abs ↗pdf ↗

Existence of strong randomized equilibria in mean-field games with common noise.

problem Existence of strong solutions in mean-field games of optimal stopping.
method Connection with Bank-El Karoui's representation problem and continuity assumptions.
result Existence of strong randomized mean-field equilibrium under certain conditions.

We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at each step, one ends up with systematic loses, whereas a periodic or random seque…

2002-12-16abs ↗pdf ↗

Financial markets investors are involved in many games -- they must interact with other agents to achieve their goals. Among them are those directly connected with their activity on markets but one cannot neglect other aspects that influence human decisions and their performance as investors. Distinguishing all subgame…

2007-09-30abs ↗pdf ↗