2 citations · 3 across the 13 of their papers we have counts for
13 papers
Generalized four person hat game
Theo van Uem
This paper studies Ebert's hat problem with four players and two colors, where the probabilities of the colors may be different for each player. Our goal is to maximize the probabi…
Asymmetric Five Person Hat Game
Theo van Uem
This paper studies asymmetric Ebert's Hat Problem with five players where the probability of the colors may be unequal. We obtain maximal winning probabilities and optimal winning…
Application of Random Walk in Manpower Planning
Theo van Uem
The career of an employee can be described (under certain circumstances) by a random walk, where the states of the random walk are determined by the level and position of an employ…
Hats: all or nothing
Theo van Uem
N players are randomly fitted with a colored hat (q different colors). All players guess simultaneously the color of their own hat observing only the hat colors of the other N-1 pl…
Generalized Three and Four Person Hat Game
Theo van Uem
This paper studies Ebert's hat problem for three and four players and two colors, where the probabilities of the colors may be different for each player. Our goal is to maximize th…
Asymmetric Hat Game with three players and three colors
Theo van Uem
Winning probabilities of The Hat Game (Ebert's Hat Problem) with three players and three colors are only known in the symmetric case: all probabilities of the colors are equal. Thi…
Ebert's asymmetric three person three color Hat Game
Theo van Uem
We generalize Ebert's Hat Problem for three persons and three colors. All players guess simultaneously the color of their own hat observing only the hat colors of the other players…
Random walk on a diagonal lattice with absorbing boundaries
T. J. van Uem
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in severa…
Discrete random walk with geometric absorption
Theo van Uem
We consider a discrete random walk (RW) in n dimensions . The RW is adapted with a geometric absorption process: at any discrete time there is a constant probability that absorptio…
Extended gambler's ruin problem
Theo van Uem
In the extended gambler's ruin problem we can move one step forward or backward (classical gambler's ruin problem), we can stay where we are for a time unit (delayed action) or the…
Random walk with equidistant multiple function barriers
Theo van Uem
We obtain expected number of arrivals, absorption probabilities and expected time before absorption for a discrete random walk on the integers with an infinite set of equidistant m…
Random walk and Fibonacci matrices
Theo van Uem
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being…
Random walk with barriers on a graph
Theo van Uem
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple fun…