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.

169,341 papers · 148 categories

Trend · papers per month

15314661 · Feb 202019922001200920182026
48 results for strategic games

Symmetric game analysis shows Nash equilibria in three strategic states.

problem Analyzing Nash equilibria in a symmetric multi-player zero-sum game with two strategic variables.
method Using the minimax theorem by Sion to show equivalence of Nash equilibria.
result Nash equilibria are equivalent in three strategic states.

New games model strategic interactions in incomplete information settings.

problem Modeling strategic interactions in incomplete information settings.
method Introduced new games that map input to private player types, aggregate strategies, and converge to near-Nash equilibria.
result Games can recover meaningful strategic interactions from real data.

The paper analyzes trading strategies in a competitive market with incomplete information.

problem Strategic trading under uncertainty when firms lack full knowledge of competitors' strategies.
method Bayesian games framework to incorporate uncertainty and derive optimal trading strategies.
result Uncertainty significantly impacts trading strategies compared to complete information scenarios.

New findings show strategic interactions can undermine model expressiveness in machine learning.

problem How strategic interactions affect model performance in machine learning.
method Analyzing model expressiveness and strategic interactions in various machine learning settings.
result Optimizing over less expressive model classes can lead to better equilibrium outcomes in strategic environments.

The paper analyzes how mutable blockchain protocols affect miner behavior and strategic stability.

problem The mutability of blockchain protocols undermines long-term planning and cooperative equilibria.
method Integrates Austrian capital theory with repeated game theory to examine miner behavior under different institutional conditions.
result Effective time preference increases when protocol rules are mutable, leading to political rent-seeking and undermining strategic coherence.

The paper solves a differential game to find optimal extraction and taxation of strategic natural resources.

problem Optimal extraction and taxation of nonrenewable natural resources under fluctuating market values.
method Formulated as a differential game with two players: mining company and government agency. Proved Nash equilibrium existence and solved Hamilton Jacobi Isaacs equations.
result Closed-form solutions for value functions, optimal extraction and taxation rates.

New framework shows strategic behavior is actually a form of causal modeling.

problem Designing classifiers that incentivize strategic behavior to improve quality.
method Developed a causal framework to distinguish between gaming and improvement.
result Proved any procedure for designing incentive classifiers must solve a causal inference problem.

Study explores optimal strategies in games with multiple players and mean-field interactions.

problem Optimal strategies in games with multiple players and mean-field interactions.
method Exploration of three different notions of optimality, including mean-field control solution, mean-field coarse correlated equilibria, and mean-field Nash equilibria.
result Approximation of cooperative and competitive equilibria in large NN-player games by mean-field control and mean-field equilibria.

Analyzes gaming in federated learning systems and provides design principles.

problem Gaming and cooperation in federated learning systems under partial observability.
method Developed an analytical framework to separate welfare-improving behavior from metric gaming.
result Derived threshold conditions for deterring harmful gaming and preserving cooperation.

The paper analyzes strategic behavior in reinsurance transactions leading to Nash equilibria.

problem Strategic behavior in reinsurance transactions affecting risk aversion and welfare gains.
method Identifying Nash equilibria within a class of risk measures.
result At strictly beneficial Nash equilibria, agents appear homogeneous in risk preferences.

DefogGAN predicts hidden RTS game information to aid strategic decision-making.

problem Predicting hidden information in real-time strategy games like StarCraft.
method Conditional Generative Adversarial Network (GAN) with pyramidal reconstruction loss.
result DefogGAN predicts enemy buildings and combat units as accurately as professional players.

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 ↗

New approach reduces simulator exploitation by improving strategic robustness.

problem Simulator exploitation leading to reality gap between simulation and real-world performance.
method Formulated as a zero-sum minimax game, providing theoretical guarantees and a convergent active data selection algorithm.
result Proves convergence and reduces prediction error in strategically important regions by 1.5-2.2 times.

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.

New algorithms optimize decision rules in strategic scenarios, minimizing prediction risk and incentivizing better outcomes.

problem Strategic agents manipulate features to improve outcomes, complicating decision-making models.
method Efficient algorithms for learning decision rules that minimize prediction risk, incentivize better outcomes, and estimate true model coefficients.
result Optimal decision rules can be learned through testing and observing agent responses, circumventing hardness results.

Study strategic competition in commodity markets using impulse-switching controls.

problem Strategic competition between upstream and downstream firms in commodity markets.
method Non-zero-sum stochastic differential game with mixed impulse/switching controls.
result Multiple Nash equilibria found, depending on the number of switches by the downstream firm.

User strategization undermines algorithmic trustworthiness.

problem User strategic behavior corrupts algorithmic data and trust.
method Modeling user-platform interactions as a game, analyzing strategic behavior's short-term benefits and long-term harms.
result User strategization can initially benefit platforms but ultimately harms their ability to make accurate decisions.

Two firms compete in a financial market, choosing dividend strategies to avoid default and maximize profits.

problem Strategic interaction between two financially constrained firms in a market with default risk.
method Construct Nash equilibria in feedback form for a class of two-person stochastic games of singular control.
result Explicit identification of optimal strategies and equilibrium payoffs for different initial conditions.

Game theory models storage investment to balance market competition and profits.

problem Strategic storage investment impacts electricity market prices and revenues.
method Formulated a non-cooperative game between investors to model strategic storage decisions.
result Increasing storage capacity reduces individual profits but increases total investment.

New approach reduces simulator exploitation by learning robust models.

problem Simulator exploitation leading to reality gap in reinforcement learning.
method Formulated as a zero-sum minimax game between model player and policy player, providing theoretical guarantees and a convergent active data selection algorithm.
result Reduces prediction error in strategically important regions by 1.5-2.2 times and enables near-optimal real-world performance.

Modeling incentives for content creators on algorithm-curated platforms.

problem Maximizing exposure for content creators on algorithmic platforms.
method Formalized exposure game model, proving effects of algorithmic choices on equilibria, proposing tools for finding equilibria.
result Algorithmic choices significantly affect content exposure and creator behavior.

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.

Strategic feature manipulation helps learners identify meaningful variables in online regression settings.

problem Strategic feature manipulation poses a challenge for learners in online regression settings.
method Investigates how strategic feature manipulation by individuals can help learners recover meaningful features.
result Simple learner behavior can help accurately recover meaningful features and incentivize feature improvement.

The paper develops classifiers that encourage positive adaptation in machine learning settings.

problem Strategic behavior by decision subjects leads to performance loss in machine learning models.
method Formulates a two-stage game to characterize optimal strategies for model designers and decision subjects.
result Trained classifiers maintain accuracy while inducing higher improvement and less manipulation.

This work explains crises in markets without external news using bounded rational agents.

problem Inability to model out-of-equilibrium dynamics in economic markets.
method Modeling bounded rational strategic reasoning in multi-agent market games.
result Bounded rational strategic reasoning can lead to endogenously emerging crises.

Algorithm learns optimal coordination for strategic agents in uncertain settings.

problem Optimizing rewards for strategic agents with private types and actions.
method Combines delaying mechanism, reward angle estimation, and LinUCB algorithm.
result Near optimal regret bound of O~(T)\tilde{O}(\sqrt{T}) for learning optimal policy.

Study explores algorithmic collusion in repeated games using various learning dynamics.

problem Understanding algorithmic collusion in repeated games with different learning dynamics.
method Examines QQ-learning, gradient learning, and other dynamics in a general repeated game setting.
result Characterizes the set of payoff vectors achievable by these dynamics, revealing possibilities for collusion.

Decentralised optimisation tasks are important components of multi-agent systems. These tasks can be interpreted as n-player potential games: therefore game-theoretic learning algorithms can be used to solve decentralised optimisation tasks. Fictitious play is the canonical example of these algorithms. Nevertheless fic…

2013-01-15abs ↗pdf ↗

Paper studies competitive networks where teams aim to minimize their own objectives, adapting to each other's strategies.

problem Competitive networks where teams have conflicting objectives.
method Proposes diffusion learning algorithms for two classes of network games: zero-sum and non-zero-sum.
result Stability performance of proposed algorithms analyzed and demonstrated through experiments.

Modeling European spot power markets with game theory for Nash equilibria.

problem Optimizing electricity markets with risk-averse players and constraints.
method Game-theoretic framework with Jacobi and Gauss-Seidel schemes for approximate Nash equilibria.
result Innovative risk aversion model reduces price dimensionality and ensures boundedness.