1 citations · 2 across the 3 of their papers we have counts for
5 papers
From heaps of matches to the limits of computability
Urban Larsson, Johan Wästlund
We study so-called invariant games played with a fixed number of heaps of matches. A game is described by a finite list of integer vectors of length specifyin…
Rigorous computer analysis of the Chow-Robbins game
Olle Häggström, Johan Wästlund
Flip a coin repeatedly, and stop whenever you want. Your payoff is the proportion of heads, and you wish to maximize this payoff in expectation. This so-called Chow-Robbins game is…
The Phase Transition for Dyadic Tilings
Omer Angel, Alexander E. Holroyd, Gady Kozma +2
A dyadic tile of order n is any rectangle obtained from the unit square by n successive bisections by horizontal or vertical cuts. Let each dyadic tile of order n be available with…
Partially ordered secretaries
Ragnar Freij, Johan Wästlund
The elements of a finite nonempty partially ordered set are exposed at independent uniform times in to a selector who, at any given time, can see the structure of the induc…
The strange algebra of combinatorial games
Johan Wästlund
We present an algebraic framework for the analysis of combinatorial games. This framework embraces the classical theory of partizan games as well as a number of misere games, compl…