We consider bidding games, a class of two-player zero-sum graph
games. T...
For a set P of n points in the plane in general position, a non-crossing...
For a given family of shapes ℱ in the plane, we study what is
the lowest...
Motivated by a game of Battleship, we consider the problem of efficientl...
The voter process is a classic stochastic process that models the invasi...
The Moran process is a classic stochastic process that models invasion
d...
For a given shape S in the plane, one can ask what is the lowest possibl...
A matching is compatible to two or more labeled point sets of size n wit...
Let 𝒫 be a finite set of points in the plane in general position.
For an...
In this paper we introduce and study all-pay bidding games, a class of
...
The input to the token swapping problem is a graph with vertices v_1, v_...
The rate of biological evolution depends on the fixation probability and...
We consider the modified Moran process on graphs to study the spread of
...