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

Trend · papers per month

92184275367 · Jun 202019922001200920172026
48 results for sequential game theory

SLHF uses sequential game theory to optimize preferences from human feedback.

problem Optimizing preferences from human feedback in sequential settings.
method SLHF frames the problem as a sequential-move game between Leader and Follower, decomposing the optimization into refinement and adversarial optimization.
result SLHF achieves strong alignment across diverse preference datasets and scales to large models.

We consider the problem of sequential prediction and provide tools to study the minimax value of the associated game. Classical statistical learning theory provides several useful complexity measures to study learning with i.i.d. data. Our proposed sequential complexities can be seen as extensions of these measures to …

2010-06-06abs ↗pdf ↗

pFedGame uses game theory for decentralized federated learning in dynamic networks.

problem Performance bottlenecks, data bias, model convergence issues, and model poisoning attacks in federated learning.
method pFedGame employs game theory to decentralize federated learning, avoiding a central aggregation server and addressing dynamic network challenges.
result pFedGame achieves higher accuracy (over 70%) in heterogeneous data compared to existing methods.

Algorithm learns to play against unknown opponents in sequential games.

problem Designing strategies for a learner to interact with an unknown opponent in repeated sequential games.
method Kernel-based regularity assumptions and a novel algorithm combining bilevel optimization and online learning.
result Algorithm achieves sublinear regret guarantees and is effective in specific game settings.

New approach for adaptive conformal inference using Blackwell's theory.

problem Non-exchangeable environments in sequential conformal inference.
method Reinterpretation of ACI as a game, construction of coverage and efficiency objectives, approachability strategy.
result Algorithm achieves strong theoretical guarantees and practical insights.

As we show using the notion of equilibrium in the theory of infinite sequential games, bubbles and escalations are rational for economic and environmental agents, who believe in an infinite world. This goes against a vision of a self regulating, wise and pacific economy in equilibrium. In other words, in this context, …

2013-05-01abs ↗pdf ↗

Game theory finds nowadays a broad range of applications in engineering and machine learning. However, in a derivative-free, expensive black-box context, very few algorithmic solutions are available to find game equilibria. Here, we propose a novel Gaussian-process based approach for solving games in this context. We f…

2016-11-08abs ↗pdf ↗

Deep reinforcement learning has shown its success in game playing. However, 2.5D fighting games would be a challenging task to handle due to ambiguity in visual appearances like height or depth of the characters. Moreover, actions in such games typically involve particular sequential action orders, which also makes the…

2018-05-05abs ↗pdf ↗

Study of portfolio management under relative performance concerns using mean field games.

problem Portfolio management problems under relative performance concerns.
method Forward utilities of CARA type, mean field games, best response and equilibrium strategies.
result Solve forward-utility finite player game and mean-field game under asset specialization.

Study optimal policy regret in partially observable Markov games with adaptive opponents.

problem Optimal sequential decision-making in partially observable environments against strategic, adaptive opponents.
method An epoch-based optimistic maximum-likelihood algorithm that selects one policy per epoch using confidence sets built cumulatively from past data.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) policy regret for fixed problem parameters, with explicit dependence on horizon, adversary memory, confidence radius, and aggregate Eluder dimension.

Federated learning linked to mean-field games for large-scale learning.

problem Large-scale distributed and privacy-preserving learning algorithms.
method Established a connection between federated learning and mean-field games, presenting federated learning as a differential game.
result Properties of the equilibrium of the federated learning game were discussed.

New discrete-time model shows insider trading dynamics.

problem Modeling insider trading with discrete time and noise traders.
method Formulated as a game with three types of traders, including an insider, noise traders, and a market maker. Proved existence of sequential Kyle equilibrium for various distributions and information flows.
result Equilibria exist in mixed strategies but not in pure strategies, unlike in Kyle's original model.

EBIs/ESOs substantially change the traditional production/service function because ESOs/EBIs can have different psychological effects(motivation or de-motivation), and can create intangible capital and different economic payoffs. Although Game Theory is flawed, it can be helpful in describing interactions in ESO/EBIs t…

2020-02-15abs ↗pdf ↗

Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss and receives a feedback signal, both of which are fixed functions of the action a…

2011-02-10abs ↗pdf ↗

The game theory techniques are used to find the equilibrium of a market. Game theory refers to the ways in which strategic interactions among economic agents produce outcomes with respect to the preferences (or utilities) of those agents, where the outcomes in question might have been intended by none of the agents. Th…

2012-10-23abs ↗pdf ↗

Recent advances in bandit tools and techniques for sequential learning are steadily enabling new applications and are promising the resolution of a range of challenging related problems. We study the game tree search problem, where the goal is to quickly identify the optimal move in a given game tree by sequentially sa…

2017-06-09abs ↗pdf ↗

IDS algorithm optimizes sequential decisions in various monitoring settings.

problem Optimizing sequential decisions in complex monitoring scenarios.
method Information-directed sampling (IDS) algorithm for linear partial monitoring.
result IDS achieves nearly worst-case rate optimality in finite-action games.

We investigate how reinforcement learning can be used to train level-designing agents. This represents a new approach to procedural content generation in games, where level design is framed as a game, and the content generator itself is learned. By seeing the design problem as a sequential task, we can use reinforcemen…

2020-01-24abs ↗pdf ↗

The paper extends game theory using Hodge theory on graphs.

problem Generalizing Shapley's value allocation formula for cooperative games on graphs.
method Connecting stochastic path integrals to Hodge-theoretic Poisson's equations on graphs.
result The value allocation operator is the solution to Poisson's equation in combinatorial Hodge theory.

Many tasks in modern machine learning can be formulated as finding equilibria in \emph{sequential} games. In particular, two-player zero-sum sequential games, also known as minimax optimization, have received growing interest. It is tempting to apply gradient descent to solve minimax optimization given its popularity a…

2019-10-16abs ↗pdf ↗

New algorithms achieve near-optimal cumulative loss in nonparametric online learning and games.

problem Fast rates of convergence in nonparametric online regression and classification.
method Randomized proper learning algorithms, hierarchical aggregation, multi-scale extension, stability proof.
result Achieved near-optimal cumulative loss bounds for real-valued and binary games.

GeoShapley uses game theory to measure spatial effects in ML models.

problem Measuring the impact of location on machine learning model predictions.
method Extends Shapley value framework to quantify spatial effects in various ML models.
result Validated GeoShapley values against known processes and demonstrated utility in house price modeling.

Generative ML learns optimal pursuit trajectories in pursuit-evasion games.

problem Optimizing Blue's pursuit trajectory to intercept Red in a game of pursuit-evasion.
method Applying generative machine learning to learn optimal action policies for Blue.
result Generative ML models can learn relevant representations for pursuit-evasion dynamics.

Paper defines saddle points in asymmetric Dynkin games using martingale theory.

problem Tackles saddle point conditions in asymmetric Dynkin games with partial information.
method Uses martingale theory to identify super and submartingales related to equilibrium payoffs.
result Characterizes saddle point strategies in terms of equilibrium payoffs' dynamics and Doob-Meyer decompositions.

Unified framework for estimating reward functions in competitive games.

problem Estimating unknown reward functions in competitive games.
method Unified framework with entropy regularization for reward function recovery.
result Strong theoretical guarantees and practical effectiveness demonstrated.

Algorithm identifies best arm in combinatorial bandits with semi-bandit feedback.

problem Identifying the best arm in combinatorial bandits with semi-bandit feedback.
method Interpreted as a sequential zero-sum game, developed a CombGame meta-algorithm with finite time guarantees.
result First computationally efficient algorithm that is asymptotically optimal and has competitive empirical performance.

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.

We study an original problem of pure exploration in a strategic bandit model motivated by Monte Carlo Tree Search. It consists in identifying the best action in a game, when the player may sample random outcomes of sequentially chosen pairs of actions. We propose two strategies for the fixed-confidence setting: Maximin…

2016-02-15abs ↗pdf ↗

The paper analyzes strategic interactions in a multi-agent reinsurance chain using game theory.

problem Strategic behavior and competition among insurers and reinsurers in a multi-layer reinsurance chain.
method Employed Stackelberg differential games and non-zero-sum game models to characterize strategic interactions. Used dynamic programming and game theory to derive equilibrium strategies for investment and reinsurance.
result Intensified competition leads to reduced safety loadings in reinsurance contracts.

Unified framework for feature-based explanations using ANOVA and game theory.

problem Differences between feature-based explanations methods limit their applicability.
method Introduces a unified framework combining fANOVA and cooperative game theory.
result Uncovered similarities and differences between various explanation techniques.

New framework recovers reward and rationality parameters from game behavior.

problem Statistical ambiguity in identifying reward and rationality parameters in competitive games.
method Blind Inverse Game Theory (Blind-IGT) using entropy-regularized Quantal Response Equilibrium and Normalized Least Squares (NLS) estimator.
result Optimal convergence rate of O(N1/2)\mathcal{O}(N^{-1/2}) for joint parameter recovery.

Online learning algorithms have impressive convergence properties when it comes to risk minimization and convex games on very large problems. However, they are inherently sequential in their design which prevents them from taking advantage of modern multi-core architectures. In this paper we prove that online learning …

2009-11-03abs ↗pdf ↗