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

4692137183 · Jun 202019922001200920172026
48 results for Coin Collecting Game

What are the prices of random variables? In this paper, we define the least-squares prices of coin-flipping games, which are proved to be minimal, positive linear, and arbitrage-free. These prices depend both on a set of games that are available for investing simultaneously and on a risk-free interest rate. In addition…

2007-03-04abs ↗pdf ↗

This paper explores using nonlinear control for robust logarithmic growth in coin flipping games.

problem Tackles the use of nonlinear control in recursive betting games with logarithmic growth.
method Formulates a robust nonlinear control problem for a simple coin flipping game, considering a probability range for the coin's bias.
result Provides a closed-form description of the optimal robust nonlinear controller, which outperforms linear controllers.

In this article, I will present a paradox whose purpose is to draw your attention to an important topic in finance, concerning the non-independence of the financial returns (non-ergodic hypothesis). In this paradox, we have two people sitting at a table separated by a black sheet so that they cannot see each other and …

2019-03-05abs ↗pdf ↗

We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend on the amount wagered on those outcomes. By varying the `reality map', which rel…

2009-02-01abs ↗pdf ↗

Deep learning methods achieve state-of-the-art performance in many application scenarios. Yet, these methods require a significant amount of hyperparameters tuning in order to achieve the best results. In particular, tuning the learning rates in the stochastic optimization process is still one of the main bottlenecks. …

2017-05-22abs ↗pdf ↗

We present a new Bitcoin coin selection algorithm, "coin selection with leverage", which aims to improve upon cost savings than that of standard knapsack like approaches. Parameters to the new algorithm are available to be tuned at the users discretion to address other goals of coin selection. Our approach naturally fi…

2019-11-04abs ↗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 ↗

We study the problem of predicting whether the price of the 21 most popular cryptocurrencies (according to coinmarketcap.com) will go up or down on day d, using data up to day d-1. Our C2P2 algorithm is the first algorithm to consider the fact that the price of a cryptocurrency c might depend not only on historical pri…

2019-06-03abs ↗pdf ↗

This paper improves self-play learning in games by manipulating experience distributions.

problem Improving self-play learning in games through better experience sampling.
method Three approaches: weighted sampling, Prioritized Experience Replay, and diversifying trajectories.
result Major improvements in early training performance in some games, minor improvements overall.

Study many-player investment-consumption games with power FPPs, finding market-risk preference affects consumption.

problem Investment and consumption optimization in a mean field competition setting.
method Solve many-player and mean field games using power FPPs, providing closed-form solutions.
result Market-risk relative consumption preference affects agent's consumption decisions.

Study reveals widespread manipulation of meme coins, leading to significant economic losses.

problem Widespread manipulation of meme coins leading to economic losses.
method Cross-chain analysis of 34,988 tokens across Ethereum, BNB Smart Chain, Solana, and Base.
result 82.8% of high-return tokens show evidence of artificial growth strategies.

We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at each step, one ends up with systematic loses, whereas a periodic or random seque…

2002-12-16abs ↗pdf ↗

We introduce a class of financial contracts involving several parties by extending the notion of a two-person game option (see Kifer (2000)) to a contract in which an arbitrary number of parties is involved and each of them is allowed to make a wide array of decisions at any time, not restricted to simply `exercising t…

2014-05-12abs ↗pdf ↗

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 ↗

A decentralized online quantum cash system, called qBitcoin, is given. We design the system which has great benefits of quantization in the following sense. Firstly, quantum teleportation technology is used for coin transaction, which prevents from the owner of the coin keeping the original coin data even after sending…

2017-08-15abs ↗pdf ↗

Financial markets are often driven by latent factors which traders cannot observe. Here, we address an algorithmic trading problem with collections of heterogeneous agents who aim to perform optimal execution or statistical arbitrage, where all agents filter the latent states of the world, and their trading actions hav…

2018-03-12abs ↗pdf ↗

The study analyzes games and social hierarchies, incorporating luck and depth of competition.

problem Analyzing patterns of wins and losses in games and social hierarchies.
method Generalized probabilistic models incorporating luck and depth of competition.
result Social competition tends to be deeper with many distinct levels, but there is often a chance of upset victories.

We document a mechanism operating in complex adaptive systems leading to dynamical pockets of predictability (``prediction days''), in which agents collectively take predetermined courses of action, transiently decoupled from past history. We demonstrate and test it out-of-sample on synthetic minority and majority game…

2004-10-29abs ↗pdf ↗

Generalization of the minority game to more than one market is considered. At each time step every agent chooses one of its strategies and acts on the market related to this strategy. If the payoff function allows for strong fluctuation of utility then market occupancies become inhomogeneous with preference given to th…

2008-09-23abs ↗pdf ↗

We analyze the dynamics of a forecasting game which exhibits the phenomenon of information cascades. Each agent aims at correctly predicting a binary variable and he/she can either look for independent information or herd on the choice of others. We show that dynamics can be analitically described in terms of a Langevi…

2007-05-28abs ↗pdf ↗

Study efficient offline RL in Markov games with general models.

problem Learn approximate equilibria from offline data in Markov games.
method Use Bellman-consistent pessimism for interval estimation and optimize gap relaxation.
result First framework for sample-efficient offline learning in Markov games, handling all equilibria.