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

275582109 · Jun 202019922001200920172026
48 results for Game Balance

The AlphaZero algorithm for the learning of strategy games via self-play, which has produced superhuman ability in the games of Go, chess, and shogi, uses a quantitative reward function for game outcomes, requiring the users of the algorithm to explicitly balance different components of the reward against each other, s…

2019-12-16abs ↗pdf ↗

Paper solves learning imperfect-information games with fewer episodes.

problem Learning imperfect-information extensive-form games from bandit feedback.
method Balanced Online Mirror Descent and Balanced Counterfactual Regret Minimization algorithms.
result Achieves near-optimal sample complexity for finding approximate Nash equilibria.

LAFF algorithm balances adaptability and non-exploitability in repeated games.

problem Low regret in repeated games against unknown opponent classes.
method LAFF algorithm searches within sub-algorithms optimal for each opponent class and uses a punishment policy for exploitation.
result LAFF guarantees sublinear regret uniformly over possible opponents, except exploitative ones, for which it guarantees linear regret.

Paper explains adversarial training's robust overfitting through a minimax game perspective.

problem Adversarial training suffers from robust overfitting after learning rate decay.
method Viewing adversarial training as a dynamic minimax game, analyzing how LR decay breaks balance and leads to overfitting.
result ReBalanced Adversarial Training (ReBAT) alleviates robust overfitting without sacrificing robustness.

A new game-theoretic approach balances downside risk with expected reward.

problem Traditional game theory views risk only from the upside perspective, ignoring downside risk.
method Introduces downside risk aware equilibria (DRAE) based on lower partial moments.
result Successfully finds equilibria that balance downside risk with expected reward.

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.

In this paper I give a brief introduction to a family of simple but non-trivial models designed to increase our understanding of collective processes in markets, the so-called Minority Games, and their non-equilibrium statistical mathematical analysis. Since the most commonly studied members of this family define disor…

2002-05-13abs ↗pdf ↗

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.

RL optimizes resource allocation in MG by balancing experience and exploration.

problem Optimal resource allocation in competitive scenarios.
method Introduced RL to MG, allowing dynamic strategy adjustment based on experience and expected rewards.
result Achieves optimal resource coordination by balancing exploitation and exploration.

New model considers wealth and time affecting risk aversion in portfolio selection.

problem Optimal investment strategy and consumption process depend on wealth and future income balance.
method Proposed a new mean-variance-utility framework with time and state-dependent risk aversion, solved using game theory.
result Equilibrium investment and consumption policies derived, aligning with investor behavior.

Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs with or without boundary. Explicit formulas are derived for the cycle, torus, a…

2003-09-04abs ↗pdf ↗

MAXMINLCB optimizes unknown target functions with preference feedback using a Stackelberg game approach.

problem Optimizing unknown target functions with pairwise comparisons and human feedback.
method MAXMINLCB, a zero-sum Stackelberg game, balances exploration and exploitation.
result MAXMINLCB consistently outperforms existing algorithms with a rate-optimal regret guarantee.

The paper analyzes a game where players must balance short-term and long-term interests, leading to cooperative or competitive outcomes.

problem Analyzing time inconsistency in inter-personal decision-making under non-exponential discounting.
method Iterative procedures and Zorn's lemma to find Nash equilibria between players' intra-personal equilibria.
result Inter-personal equilibria exist and depend on the impatience levels of the players.

Study uses MFG approach to model equilibrium pricing with market clearing condition.

problem Continuous asset pricing with market clearing condition.
method Mean field game approach to solve forward-backward SDEs of McKean-Vlasov type.
result Net order flow converges to zero in large N-limit with specified conditions.

Adversarial training methods typically align distributions by solving two-player games. However, in most current formulations, even if the generator aligns perfectly with data, a sub-optimal discriminator can still drive the two apart. Absent additional regularization, the instability can manifest itself as a never-end…

2020-02-20abs ↗pdf ↗

We derive a class of macroscopic differential equations that describe collective adaptation, starting from a discrete-time stochastic microscopic model. The behavior of each agent is a dynamic balance between adaptation that locally achieves the best action and memory loss that leads to randomized behavior. We show tha…

2004-08-20abs ↗pdf ↗

The 1/3 Financial Rule helps prevent household bankruptcy through balanced spending, savings, and debt repayment.

problem Reducing household bankruptcy risk through effective financial planning.
method Mathematical modeling, game theory, behavioral finance, and technological analysis.
result The 1/3 Financial Rule emerges as a robust solution for supporting household financial stability.

Paper addresses inefficiency in converting EFGs to NFGs for learning.

problem Inefficiency in converting Extensive-Form Games to Normal-Form Games.
method Uses ΦΦ-Hedge algorithm and Online Mirror Descent (OMD) for polynomial-time learning of EFGs.
result Achieves O~(XAT)\widetilde{\mathcal{O}}(\sqrt{XAT}) EFCE-regret, matching information-theoretic lower bound.

Paper assesses how features influence classification of COVID-19 patients.

problem Evaluating the influence of features on classification problems.
method Introduced a measure of feature influence using Shapley value of cooperative games, with axiomatic characterisation.
result Validated the performance of the measure through experiments on COVID-19 patients.

Study multi-agent RL in OTC markets, learning from agents' interactions.

problem Designing efficient RL solutions for OTC market interactions.
method Parameterized reward functions, shared policy learning, RL calibration.
result Agents learn to balance hedging and skewing in market simulations.

Bayesian rating system for large competitions improves prediction and efficiency.

problem Rating systems for large, competitive events like online programming contests.
method Developed a Bayesian rating system for many participants, proving robustness and runtime.
result The system outperforms existing systems in accuracy and computation speed.

This paper introduces a novel framework for designing fair and sustainable unemployment benefits, grounded in cooperative game theory and real-time fiscal policy. The labor market is modeled as a coalitional game, where a random subset of participants is employed, generating stochastic economic output. To ensure fairne…

2018-08-26abs ↗pdf ↗

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.

PropFair algorithm ensures fair performance in federated learning.

problem Ensuring fair performance in federated learning for diverse clients.
method PropFair, a novel algorithm based on bargaining games, finds proportionally fair solutions.
result PropFair approximately finds proportional fairness solutions and balances average and worst 10% client performances.

Insurance contracts for autonomous AI agents must be actuarially sound and resistant to gaming.

problem Designing insurance contracts for autonomous AI agents that are actuarially sound and resistant to gaming.
method Characterizing a five-attack space and proving the actuarial runtime is gaming-resistant.
result An incentive-compatible layer for actuarial control of autonomous-agent side effects.

One of the key issues for imitation learning lies in making policy learned from limited samples to generalize well in the whole state-action space. This problem is much more severe in high-dimensional state environments, such as game playing with raw pixel inputs. Under this situation, even state-of-the-art adversary-b…

2019-09-09abs ↗pdf ↗

We introduce a novel framework for adversarial training where the target distribution is annealed between the uniform distribution and the data distribution. We posited a conjecture that learning under continuous annealing in the nonparametric regime is stable irrespective of the divergence measures in the objective fu…

2017-05-21abs ↗pdf ↗

New approach to optimal dividend control with mean-variance criterion.

problem Balancing expected dividends and variability in a singular control framework.
method Game-theoretic approach to find time-consistent equilibrium strategies.
result Verification theorem for MV singular dividend control problem.

Esports have become major international sports with hundreds of millions of spectators. Esports games generate massive amounts of telemetry data. Using these to predict the outcome of esports matches has received considerable attention, but micro-predictions, which seek to predict events inside a match, is as yet unkno…

2019-05-21abs ↗pdf ↗

NAMEx merges experts using Nash bargaining for improved performance.

problem Sparse Mixture of Experts merging strategies lack a principled weighting mechanism.
method Reinterpreting expert merging through game theory, introducing Nash Merging and complex momentum.
result NAMEx consistently outperforms competing methods across various tasks and system sizes.

Paper presents content-based models for game recommendation in cold start scenarios.

problem Cold start problem in game recommendation where new games and players have no historical data.
method Uses survey data to develop content-based interaction models that generalize to new games, players, and both.
result Content models outperform collaborative filtering in predicting new interactions.

Paper examines financial engineering problems and introduces AlphaZero for better replication strategies.

problem Replication portfolio construction in incomplete markets with non-convex constraints.
method Introduces AlphaZero-based system to compare with deep hedging method.
result AlphaZero outperforms deep hedging in non-convex environments, finding near-optimal strategies.

Potential games, originally introduced in the early 1990's by Lloyd Shapley, the 2012 Nobel Laureate in Economics, and his colleague Dov Monderer, are a very important class of models in game theory. They have special properties such as the existence of Nash equilibria in pure strategies. This note introduces graphical…

2015-05-06abs ↗pdf ↗

IGGP learns game rules from varying quality game play, finding no overall trend.

problem Learn game rules from varying quality game play.
method Used Sancho's intelligent game traces and ILP systems (Metagol, Aleph, ILASP) to induce game rules from traces of varying quality and volume.
result No overall trend in accuracy of learned game rules from varying quality and volume of training data.

We introduce a topological combinatorial game called the Region Smoothing Swap Game. The game is played on a game board derived from the connected shadow of a link diagram on a (possibly non-orientable) surface by smoothing at crossings. Moves in the game are performed on regions of the diagram and can switch the direc…

2019-09-26abs ↗pdf ↗