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

14284155 · Feb 202019922001200920172026
48 results for 2x2 games

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.

We interpret an open orbit in a 32-dimensional representation space of Spin(9,1) x SL(2,R) as a substitute for the non-existent group of invertible 2x2 matrices over the octonions and study various natural homogeneous subspaces. The approach is via twistor geometry in eight dimensions.

2018-05-06abs ↗pdf ↗

We introduce a new integrable system hierarchy which is a restriction of the AKNS nxn hierarchy coming from an unusual splitting of the loop algebra. This splitting comes from an automorphism of the loop algebra instead of an automorphism of SL(n,C). It is known that the 2x2 KdV is the standard KdV hierarchy.

2006-11-03abs ↗pdf ↗

Using the representation of the isometries as 2x2 invertible matrices over the division algebra $\H$ of quaternions, we give an algebraic characterization of the dynamical types of the orientation-preserving isometries of the hyperbolic 5-space. We also determine the conjugacy classes and the conjugacy classes of centr…

2008-08-25abs ↗pdf ↗

The Kinetic Gas Theory like two-agent money exchange models, recently introduced in the Econophysics of Wealth distributions, are revisited. The emergence of Boltzmann-Gibbs like distribution of individual money to Pareto's law in the tail of the distribution is examined in terms of 2x2 Transition matrix with a general…

2005-05-17abs ↗pdf ↗

It is known, since works of Burde and de Rham, that one can detect the roots of the Alexander polynomial of a knot by the study of the representations of the knot group into the group of the invertible upper triangular 2x22x2 matrices. In this work, we propose to generalize this result by considering the representations…

2007-09-14abs ↗pdf ↗

The paper presents a new algebraic structure for planar surfaces.

problem Understanding the algebraic structure of planar surfaces.
method Explicitly defined generators and relations for Kauffman bracket skein algebras of planar surfaces.
result A new independent presentation of Kauffman bracket skein algebras for planar surfaces.

We develop a theory of bid and ask price dynamics where the two prices form due to interaction of buy and sell orders. In this model the two prices are represented by eigenvalues of a 2x2 price operator corresponding to "bid" and "ask" eigenstates. Matrix elements of price operator fluctuate in time which results in ph…

2013-12-17abs ↗pdf ↗

We present an extension of the ergodic, mixing, and Bernoulli levels of the ergodic hierarchy for statistical models on curved manifolds, making use of elements of the information geometry. This extension focuses on the notion of statistical independence between the microscopical variables of the system. Moreover, we e…

2017-03-10abs ↗pdf ↗

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.

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 ↗

The existence of stationary Markov perfect equilibria in stochastic games is shown under a general condition called "(decomposable) coarser transition kernels". This result covers various earlier existence results on correlated equilibria, noisy stochastic games, stochastic games with finite actions and state-independe…

2013-11-07abs ↗pdf ↗

Game theory helps analyze ESOs/EBIs in production and service sectors.

problem Economic incentives affect traditional production/service functions and create intangible capital.
method Uses game theory to analyze interactions in ESO/EBI transactions.
result No perfect Nash Equilibria for two-stage games involving many participants.

Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the…

2018-07-29abs ↗pdf ↗

We start briefly surveying research on optimal stopping games since their introduction by E.B.Dynkin more than 40 years ago. Recent renewed interest to dynkin's games is due, in particular, to the study of Israeli (game) options introduced in 2000. We discuss the work on these options and related derivative securities …

2012-09-09abs ↗pdf ↗

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.

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.

We introduce TextWorld, a sandbox learning environment for the training and evaluation of RL agents on text-based games. TextWorld is a Python library that handles interactive play-through of text games, as well as backend functions like state tracking and reward assignment. It comes with a curated list of games whose …

2018-06-29abs ↗pdf ↗

Gradient Descent Ascent converges to von-Neumann solution in hidden zero-sum games.

problem Understanding dynamics of zero-sum games with hidden structure.
method Gradient Descent Ascent applied to hidden zero-sum games with specific convex-concave structure.
result Gradient Descent Ascent converges to von-Neumann solution in strictly convex-concave hidden games.

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.

Study on mean field games with singular controls and their applications.

problem Optimal productivity expansion in dynamic oligopolies.
method Existence and uniqueness of mean field equilibria through nonlinear equations, Abelian limit for discounted and ergodic games.
result Valid connection between discounted and ergodic games, approximation of Nash equilibria.

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.

Expands MFGs to handle real-world asymmetric multi-agent games efficiently.

problem Applying mean-field games to real-world, heterogeneous multi-agent systems.
method Develops a method to symmetrize and extend finite-player games to infinite-player MFGs, proving approximation bounds and convergence guarantees.
result TD learning converges to approximate Nash equilibria in finite-sample settings, enabling symmetrized learning without explicit MFG models.

This paper gives a critical account of the minority game literature. The minority game is a simple congestion game: players need to choose between two options, and those who have selected the option chosen by the minority win. The learning model proposed in this literature seems to differ markedly from the learning mod…

2007-06-29abs ↗pdf ↗

New methods learn correlated equilibria in large games without structural assumptions.

problem Learning correlated equilibria in large, anonymous games with exponential player count.
method Developed Mean-Field correlated and coarse-correlated equilibria, and used classical algorithms to learn them efficiently.
result Efficiently learned correlated equilibria in all games without structural assumptions.