相关论文: Position play in carom billiards as a Markov proce…

Basketball players' performance measurement is of critical importance for a broad spectrum of decisions related to training and game strategy. Despite this recognized central role, the main part of the studies on this topic focus on…

By a random billiard we mean a billiard system in which the standard specular reflection rule is replaced with a Markov transition probabilities operator P that, at each collision of the billiard particle with the boundary of the billiard…

The game of Knockout is a classic playground game played with two basketballs. This paper uses a Markov process to analyze each player's probability of winning the game given their starting position in line and shooting percentages,…

The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions…

We construct a class of reflection laws for billiard processes in the unit interval whose stationary distribution for the billiard position and its velocity is the product of the uniform distribution and the standard normal distribution.…

In this paper we model basketball plays as episodes from team-specific non-stationary Markov decision processes (MDPs) with shot clock dependent transition probabilities. Bayesian hierarchical models are employed in the modeling and…

The act of a person juggling can be viewed as a Markov process if we assume that the juggler throws to random heights. I make this association for the simplest reasonable model of random juggling and compute the steady state probabilities…

In this paper we describe an approach to resolve strategic games in which players can assume different types along the game. Our goal is to infer which type the opponent is adopting at each moment so that we can increase the player's odds.…

We motivate and propose a new model for non-cooperative Markov game which considers the interactions of risk-aware players. This model characterizes the time-consistent dynamic "risk" from both stochastic state transitions (inherent to the…

Markov chains are an important example for a course on stochastic processes because simple board games can be used to illustrate the fundamental concepts. For example, a looping board game (like Monopoly) consists of all recurrent states,…

We analyse the process of energy exchanges generated by the elastic collisions between a point-particle, confined to a two-dimensional cell with convex boundaries, and a `piston', i.e. a line-segment, which moves back and forth along a…

The success rate of a basketball shot may be higher at locations where a player makes more shots. For a marked spatial point process, this means that the mark and the intensity are associated. We propose a Bayesian joint model for the mark…

The labyrinth game is a simple yet challenging platform, not only for humans but also for control algorithms and systems. The game is easy to understand but still very hard to master. From a system point of view, the ball behaviour is in…

Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins…

Simple stochastic exchange games are based on random allocation of finite resources. These games are Markov chains that can be studied either analytically or by Monte Carlo simulations. In particular, the equilibrium distribution can be…

Consider the problem of modeling memory effects in discrete-state random walks using higher-order Markov chains. This paper explores cross validation and information criteria as proxies for a model's predictive accuracy. Our objective is to…

A stochastic modification of Conway's cellular automaton "Life" is introduced here. Any cell could be perturbed spontaneously to the opposite (dead or alive) state at any iteration with a very low probability. This probability is assumed to…

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…

Cooperative Parrondo's games on a regular two dimensional lattice are analyzed based on the computer simulations and on the discrete-time Markov chain model with exact transition probabilities. The paradox appears in the vicinity of the…

In repeated interactions between individuals, we do not expect that exactly the same situation will occur from one time to another. Contrary to what is common in models of repeated games in the literature, most real situations may differ a…