1 citations · 3 across the 13 of their papers we have counts for
15 papers
Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational
Steve Alpern, Mark Broom
A divisible treasure is located at a node of a network. From a given start node a group of Searchers each seek to reach first, dividing the treasure equally with the ot…
Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information
Steve Alpern, Thomas Lidbetter
Adversarial search of a network for an immobile Hider (or target) was introduced and solved for rooted trees by Gal (1979). In this zero-sum game, a Hider picks a point to hide on…
The Faulty GPS Problem: Shortest Time Paths in Networks with Unreliable Directions
Steve Alpern
This paper optimizes motion planning when there is a known risk that the road choice suggested by a Satnav (GPS) is not on a shortest path. At every branch node of a network Q, a S…
Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks
Steve Alpern, Li Zeng
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 tea…
Continuous Patrolling Games
Steve Alpern, Thuy Bui, Thomas Lidbetter +1
We study a patrolling game played on a network , considered as a metric space. The Attacker chooses a point of (not necessarily a node) to attack during a chosen time interv…
Optimizing Voting Order on Sequential Juries: A Median Voter Theorem and Beyond
Steve Alpern, Bo Chen
We consider an odd-sized "jury", which votes sequentially between two states of Nature (say A and B, or Innocent and Guilty) with the majority opinion determining the verdict. Juro…
A Functional Equation of Tail-balance for Continuous Signals in the Condorcet Jury Theorem
Steve Alpern, Bo Chen, Adam J. Ostaszewski
Consider an odd-sized jury, which determines a majority verdict between two equiprobable states of Nature. If each juror independently receives a binary signal identifying the corr…
Search and Delivery Man Problems: When Are Depth-First Paths Optimal?
Steve Alpern, Thomas Lidbetter
Let h be a probability measure on the nodes and arcs of a network Q, viewed either as the location of a hidden object to be found or as the continuous distribution of customers rec…
The Uniformed Patroller Game
Steve Alpern, Stamatios Katsikas
In the recently introduced network patrolling game, an Attacker carries out an attack on a node of her choice, for a given number m of consecutive periods. The parameter m indicate…
The Uniformed Patroller Game
Steve Alpern, Paul Chleboun, Stamatios Katsikas
Patrolling Games were introduced by Alpern, Morton and Papadaki (2011) to model the adversarial problem where a mobile Patroller can thwart an attack at some location only by visit…
A Game Model of Search and Pursuit
Steve Alpern, Viciano Lee
Shmuel Gal and Jerome Casas have recently introduced a game theoretic model that combines search and pursuit by a predator for a prey animal. The prey (hider) can hide in a finite…
A Short Solution to the Many-Player Silent Duel with Arbitrary Consolation Prize
Steve Alpern, J. V. Howard
The classical constant-sum 'silent duel' game had two antagonistic marksmen walking towards each other. A more friendly formulation has two equally skilled marksmen approaching tar…
Periodic Patrols on the Line and Other Networks
Steve Alpern, Thomas Lidbetter, Katerina Papadaki
We consider a patrolling game on a graph recently introduced by Alpern et al. (2011) where the Patroller wins if he is at the attacked node while the attack is taking place. This p…
Search-and-Rescue Rendezvous
Pierre Leone, Steve Alpern
We consider a new type of asymmetric rendezvous search problem in which Agent II needs to give Agent I a `gift' which can be in the form of information or material. The gift can ei…
Constant Factor Approximate Solutions for Expanding Search on General Networks
Steve Alpern, Thomas Lidbetter
We study the classical problem introduced by R. Isaacs and S. Gal of minimizing the time to find a hidden point on a network moving from a known starting point. Rather than…