Study Nash equilibrium in non-zero-sum game with Bermudan strategies.
problem Optimizing pay-offs in non-linear non-zero-sum games.
method Recursive construction to find Nash equilibrium.
result Existence of Nash equilibrium in non-zero-sum game.
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
48 results for “strategy games”
In this paper we use game theory to model poisoning attack scenarios. We prove the non-existence of pure strategy Nash Equilibrium in the attacker and defender game. We then propose a mixed extension of our game model and an algorithm to approximate the Nash Equilibrium strategy for the defender. We then demonstrate th…
A game theory study on optimal hiding and searching strategies in discrete locations.
problem Optimal hiding and searching strategies in a two-person zero-sum game between a hider and a searcher.
method Proved the existence of optimal strategies, developed an algorithm to compute them, and compared with a simple strategy.
result Optimal hiding strategy involves hiding in each location with nonzero probability, and optimal searching strategy can be constructed with up to n simple sequences.
We introduce a new class of context dependent, incomplete information games to serve as structured prediction models for settings with significant strategic interactions. Our games map the input context to outcomes by first condensing the input into private player types that specify the utilities, weighted interactions…
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.
Optimal strategies are found for a repeated betting game using diffusion approximation.
problem Finding optimal strategies for a repeated betting game with i.i.d. outcomes.
method Constructing a diffusion approximation of the repeated game and analyzing the wealth share process.
result Necessary and sufficient conditions for the wealth share process to be transient or recurrent are derived.
We study multistep Bayesian betting strategies in coin-tossing games in the framework of game-theoretic probability of Shafer and Vovk (2001). We show that by a countable mixture of these strategies, a gambler or an investor can exploit arbitrary patterns of deviations of nature's moves from independent Bernoulli trial…
New method detects heuristics in complex game strategies.
problem Understanding decision-making in games with infinite strategy spaces.
method Introducing decoupled strategies to detect convergence towards Nash equilibria.
result Predictive measure ΔD reveals participants' actions with high success rate.
Study learns optimal strategies in imperfect information games with self-play.
problem Learning optimal strategies in imperfect information games.
method Proposes Follow the Regularized Leader (FTRL) algorithms for imperfect information games.
result Proposes two FTRL algorithms: Balanced FTRL and Adaptive FTRL.
In this expository paper we illustrate the generality of game theoretic probability protocols of Shafer and Vovk (2001) in finite-horizon discrete games. By restricting ourselves to finite-horizon discrete games, we can explicitly describe how discrete distributions with finite support and the discrete pricing formulas…
We propose a betting strategy based on Bayesian logistic regression modeling for the probability forecasting game in the framework of game-theoretic probability by Shafer and Vovk (2001). We prove some results concerning the strong law of large numbers in the probability forecasting game with side information based on …
This paper analyzes a game between insurer and reinsurer under ambiguity and risk aversion, optimizing reinsurance and investment strategies.
problem Optimizing reinsurance and investment strategies in a game between insurer and reinsurer under ambiguity and risk aversion.
method Stackelberg game, -maxmin mean-variance criterion, Heston's stochastic volatility, Hamilton-Jacobi-Bellman equations, Riccati differential equations.
result Excess-of-loss reinsurance is optimal for the insurer, and the equilibrium strategies are determined by specific equations.
We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to the other player's action. In the first part of the paper, we consider the game wh…
Traders in a Strange Land: Agent-based discrete-event market simulation of the Figgie card gameq-fin.TR
Study Figgie card game strategies using agent-based simulation.
problem Analyze strategies for Figgie card game and market behavior.
method Develop agent-based discrete-event market simulation to test strategies.
result Fundamentalist strategy is profit-maximizing in all tested combinations.
Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of Blackwell's approachability theorem, in an other auxiliary game. We establish the converse: a strategy that approaches a convex -set can be…
No-regret learning fails to converge to Nash equilibria in mixed strategies.
problem Limiting behavior of mixed strategies in repeated games.
method Study of optimal no-regret learning algorithms for 2x2 competitive games.
result Limiting mixed strategies cannot converge to Nash equilibria under mean-based and monotonic updates.
A quantum financial approach to finite games of strategy is addressed, with an extension of Nash's theorem to the quantum financial setting, allowing for an entanglement of games of strategy with two-period financial allocation problems that are expressed in terms of: the consumption plans' optimization problem in pure…
Strategy evaluation schemes are a crucial factor in any agent-based market model, as they determine the agents' strategy preferences and consequently their behavioral pattern. This study investigates how the strategy evaluation schemes adopted by agents affect their performance in conjunction with the market circumstan…
Paper tackles hidden game problem in AI alignment and language games.
problem Hidden game problem in AI alignment and language games.
method Developed a composition of regret minimization techniques to discover and exploit hidden structures.
result Achieved optimal external and swap regret bounds for rapid convergence to correlated equilibria.
Educational game on crypto investment helps students grasp macroeconomics.
problem Weak connections between microeconomic decision-making and macroeconomic concepts in classroom games.
method Design and study of an educational game on cryptocurrency investment.
result Engages students in understanding macroeconomics through incentivized individual investment decisions.
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…
Asymptotic minimization of expected time to reach a large wealth level in an asset market gameq-fin.MF
Game theory model shows optimal investment strategy for wealth growth.
problem Minimizing time to reach large wealth in a stochastic asset market.
method Proved strategy of proportional asset investment minimizes expected time.
result Proportional investment strategy asymptotically minimizes time to large wealth.
We consider a stochastic game of contribution to the common good in which the players have continuous control over the degree of contribution, and we examine the gradualism arising from the free rider effect. This game belongs to the class of variable concession games which generalize wars of attrition. Previously know…
Study of zero-sum games with noisy observations and commitments.
problem Analyzing zero-sum games with noisy observations and commitments.
method Modeling a zero-sum game with a leader committing to a strategy and a follower observing a noisy version of the leader's action.
result Observing the leader's action is either beneficial or immaterial for the follower, and the equilibrium payoff is bounded.
Study optimal reinsurance strategies in a game between insurer and two reinsurers.
problem Optimal reinsurance strategies in a competitive market.
method Stochastic game theory, Stackelberg model, Nash game, time-inconsistent control problem, extended Hamilton-Jacobi-Bellman equation.
result Equilibrium reinsurance strategies and premiums found for exponential claim size.
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.
Study best-response learning dynamics in zero-sum polymatrix games under full and minimal information settings.
problem Learning dynamics in zero-sum polymatrix games under different information settings.
method Two-timescale learning dynamics combining smoothed best-response updates and TD-learning for estimating local payoff functions.
result Polynomial-time finite-sample guarantees for convergence to an ε-Nash equilibrium in the minimal information case.
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.
Paper analyzes robust strategies in a pension plan game with ambiguous financial markets.
problem Analyzing robust strategies in a defined benefit pension plan game with ambiguous financial markets.
method Formulated and solved two robust non-zero-sum games using stochastic dynamic programming.
result Explicit forms and optimality of the solutions are shown for the firm and union.
In this paper we study the existence of an optimal hedging strategy for the shortfall risk measure in the game options setup. We consider the continuous time Black--Scholes (BS) model. Our first result says that in the case where the game contingent claim (GCC) can be exercised only on a finite set of times, there exis…
This paper studies insurers' robust strategies in a stochastic game with model uncertainty and volatility risk.
problem Model uncertainty and volatility risk in insurers' surplus processes.
method Formulates robust mean-field games with insurers competing based on mean-variance criterion under worst-case scenario.
result Derives semi-closed forms of equilibrium strategies for insurers and mean-field equilibrium, ensuring existence and uniqueness.
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 reveals a spinning top geometry in real-world games.
problem Understanding the structure of real-world games.
method Developed a spinning top geometric model and used Nash clustering.
result Real-world games exhibit a spinning top structure with transitive and non-transitive dimensions.
Algorithms for equilibrium computation generally make no attempt to ensure that the computed strategies are understandable by humans. For instance the strategies for the strongest poker agents are represented as massive binary files. In many situations, we would like to compute strategies that can actually be implement…
Game theory applied to financial networks, focusing on debt repayment strategies.
problem Understanding financial stability in interconnected systems.
method Modeling financial systems as networks, analyzing utility-maximizing strategies under priority-proportional payments.
result Existence and uniqueness of payment profiles are not guaranteed, even under fixed strategies.
Neural operators approximate Stackelberg game solutions.
problem Intractability of follower's best-response operator in dynamic Stackelberg games.
method Used attention-based neural operators to approximate the best-response operator.
result Approximate best-response operator yields close game value.
We prove existence of a self-financing strategy which minimizes shortfall for game options in discrete time
Game theory model for optimal trading with end-of-day constraints.
problem Optimal trading strategy in a game between slow and fast traders.
method Coupled stochastic control problems, Fredholm integral equation solution.
result Explicit solution to the game with profitable strategies for both players.
We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strategically allocate any incoming flow to the outgoing edges. Given the strategy choices of all agents, a maximal circulation that adheres to the…
RLCFR improves CFR's generalization in imperfect information games.
problem Improving CFR's performance in large-scale, imperfect information games.
method RLCFR integrates CFR with deep reinforcement learning to update strategies dynamically.
result RLCFR significantly enhances CFR's generalization ability in various games.
Action Guidance: Getting the Best of Sparse Rewards and Shaped Rewards for Real-time Strategy Gamescs.LG
Action guidance helps agents learn true objectives in games with sparse rewards.
problem Training agents in games with sparse rewards requires significant exploration.
method Action guidance, a novel technique that combines exploration with reward shaping.
result Action guidance enables agents to optimize true objectives efficiently.
We derive some results on contrarian and one-sided strategies by Skeptic for the fair-coin game in the framework of the game-theoretic probability of Shafer and Vovk \cite{sv}. In particular, concerning the rate of convergence of the strong law of large numbers (SLLN), we prove that Skeptic can force that the convergen…
Quantum strategy optimizes wealth growth in a double-or-nothing game.
problem Optimizing wealth growth in a quantum double-or-nothing game.
method Numerical determination of the optimal quantum strategy.
result The quantum strategy outperforms the classical Kelly criterion.
A Midsummer Knot's Dreammath.GT
In this paper, we introduce playing games on shadows of knots. We demonstrate two novel games, namely, To Knot or Not to Knot and Much Ado about Knotting. We also discuss winning strategies for these games on certain families of knot shadows. Finally, we suggest variations of these games for further study.
New algorithms for n-player games using a player-centered approach.
problem Learning near-perfect strategies in multiplayer games.
method Player-centered reinforcement learning with Final Adaptation RL.
result FARL is crucial for achieving near-perfect strategies in various games.
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…
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.
Social and individual learning in the Minority Gamephysics.soc-ph
Social learning can make financial markets inefficient, but individual learning can fix this.
problem Inefficiencies in financial markets due to social learning.
method Study of the Minority Game model with social and individual learning mechanisms.
result Individual learning can rescue a population from the inefficiencies caused by social learning.