Counterintuitive prey strategies against predators with finite budgets: protection heterogeneity among sites matters more than their number.

Combining the search and pursuit aspects of predator-prey interactions into a single game, where the payoff to the Searcher (predator) is the probability of finding and capturing the Hider (prey) within a fixed number of searches was proposed by Gal and Casas ( , 20140062 (doi:10.1098/rsif.2014.

Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks.

During epidemics, the population is asked to socially distance, with pairs of individuals keeping two meters apart. We model this as a new optimization problem by considering a team of agents placed on the nodes of a network. Their common aim is to achieve pairwise graph distances of at least ,  a state we call .

A stochastic game model of searching predators and hiding prey.

When the spatial density of both prey and predators is very low, the problem they face may be modelled as a two-person game (called a 'search game') between one member of each type. Following recent models of search and pursuit, we assume the prey has a fixed number of heterogeneous 'hiding' places (for example, ice holes for a seal to breathe) and that the predator (maybe polar bear) has the time or energy to search a fixed number of these. If he searches the actual hiding location and also successfully pursues the prey there, he wins the game.

Prey should hide more randomly when a predator attacks more persistently.

When being searched for and then (if found) pursued by a predator, a prey animal has a choice between choosing very randomly among hiding locations so as to be hard to find or alternatively choosing a location from which it is more likely to successfully flee if found. That is, the prey can choose to be hard to find or hard to catch, if found. In our model, capture of prey requires both finding it and successfully pursuing it.

Equilibrium population dynamics when mating is by mutual choice based on age.

We consider a steady state model of mutual mate choice in which an individual's mate preferences depend on his/her age, and the preferences are over the ages of prospective mates of the opposite sex. We present a discrete time (and age) model corresponding to successive mating seasons. Males are fertile for m periods (corresponding to 'age' i=1 to m) and females for n≤m periods (they have ages j=1 to n), which is all that distinguishes the sexes.

A search game model of the scatter hoarder's problem.

Scatter hoarders are animals (e.g. squirrels) who cache food (nuts) over a number of sites for later collection.

Ambush frequency should increase over time during optimal predator search for prey.

We advance and apply the mathematical theory of search games to model the problem faced by a predator searching for prey. Two search modes are available: ambush and cruising search. Some species can adopt either mode, with their choice at a given time traditionally explained in terms of varying habitat and physiological conditions.

Strategic mating with common preferences.

We present a two-sided search model in which individuals from two groups (males and females, employers and workers) would like to form a long-term relationship with a highly ranked individual of the other group, but are limited to individuals who they randomly encounter and to those who also accept them. This article extends the research program, begun in Alpern and Reyniers [1999. J.