Related papers: Jackpot statistics, a physicist's approach
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, for the case where the players are restricted to finite-memory strategies. First, we describe a general framework, where…
We consider a continuous-time game-theoretic model of an investment market with short-lived assets and endogenous asset prices. The first goal of the paper is to formulate a stochastic equation which determines wealth processes of investors…
We propose a sequential optimizing betting strategy in the multi-dimensional bounded forecasting game in the framework of game-theoretic probability of Shafer and Vovk (2001). By studying the asymptotic behavior of its capital process, we…
Cooperation between individuals is emergent in all parts of society, yet mechanistic reasons for this emergence is ill understood in the literature. A specific example of this is insurance. Recent work has, though, shown that assuming the…
This paper is concerned with the death-birth updating process. This model is an example of a spatial game in which players located on the~$d$-dimensional integer lattice are characterized by one of two possible strategies and update their…
Gambles are random variables that model possible changes in monetary wealth. Classic decision theory transforms money into utility through a utility function and defines the value of a gamble as the expectation value of utility changes.…
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model…
According to the Strong Lottery Ticket Hypothesis, every sufficiently large neural network with randomly initialized weights contains a sub-network which - still with its random weights - already performs as well for a given task as the…
The prospects of Kahneman and Tversky, Mega Million and Powerball lotteries, St. Petersburg paradox, premature profits and growing losses criticized by Livermore are reviewed under an angle of view comparing mathematical expectations with…
We consider the billiard dynamics in a non-compact set of R^d that is constructed as a bi-infinite chain of translated copies of the same d-dimensional polytope. A random configuration of semi-dispersing scatterers is placed in each copy.…
Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three…
Gerber and Li in \cite{GeLi} formulated, using a Markov chain embedding, a system of equations that describes relations between generating functions of waiting time distributions for occurrences of patterns in a sequence of independent…
We study a stochastic process that mimics single-game elimination tournaments. In our model, the outcome of each match is stochastic: the weaker player wins with upset probability q<=1/2, and the stronger player wins with probability 1-q.…
Blackjack or "21" is a popular card-based game of chance and skill. The objective of the game is to win by obtaining a hand total higher than the dealer's without exceeding 21. The ideal blackjack strategy will maximize financial return in…
In this paper, we consider stochastic monotone Nash games where each player's strategy set is characterized by possibly a large number of explicit convex constraint inequalities. Notably, the functional constraints of each player may depend…
In the compulsive gambler process there is a finite set of agents who meet pairwise at random times ($i$ and $j$ meet at times of a rate-$\nu_{ij}$ Poisson process) and, upon meeting, play an instantaneous fair game in which one wins the…
Integer sequences where each element is determined by a previous randomly chosen element are investigated analytically. In particular, the random geometric series x_n=2x_p with 0<=p<=n-1 is studied. At large n, the moments grow…
Strategic decisions are often made over multiple periods of time, wherein decisions made earlier impact a competitor's success in later stages. In this paper, we study these dynamics in General Lotto games, a class of models describing the…
The Lucas-Moll system is a mean-field game type model describing the growth of an economy by means of diffusion of knowledge. The individual agents in the economy advance their knowledge by learning from each other and via internal…
Network pruning is an effective approach to reduce network complexity with acceptable performance compromise. Existing studies achieve the sparsity of neural networks via time-consuming weight training or complex searching on networks with…