Search Results - "Alpern, Steve"

Hide-and-Seek Games on a Network, Using Combinatorial Search Paths by Alpern, Steve

“…This paper introduces a new search paradigm to hide-and-seek games on networks. The Hider locates at any point on any arc. The Searcher adopts a…”
Get full text

Mining Coal or Finding Terrorists: The Expanding Search Paradigm by Alpern, Steve, Lidbetter, Thomas

“…We show how to optimize the search for a hidden object, terrorist, or simply Hider, located at a point H according to a known or unknown distribution ν on a…”
Get full text

Optimizing periodic patrols against short attacks on the line and other networks by Alpern, Steve, Lidbetter, Thomas, Papadaki, Katerina

“…•Periodic patrolling games: Patroller versus attacker.•Attack duration two time periods.•For time horizon even, game is solved for arbitrary graphs.•Complete…”
Get full text

Patrolling a Border by Papadaki, Katerina, Alpern, Steve, Lidbetter, Thomas, Morton, Alec

“…Patrolling games were recently introduced to model the problem of protecting the nodes of a network from an attack. Time is discrete and in each time unit the…”
Get full text

Optimizing voting order on sequential juries: a median voter theorem and beyond by Alpern, Steve, Chen, Bo

“…We consider an odd-sized “jury”, which votes sequentially between two equiprobable states of Nature (say A and B , or Innocent and Guilty), with the majority…”
Get full text

Patrolling Games by Alpern, Steve, Morton, Alec, Papadaki, Katerina

“…A key operational problem for those charged with the security of vulnerable facilities (such as airports or art galleries) is the scheduling and deployment of…”
Get full text

Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object by Alpern, Steve, Lidbetter, Thomas

“…A Searcher seeks to find a stationary Hider located at some point H (not necessarily a node) on a given network Q . The Searcher can move along the network…”
Get full text

Searching a Variable Speed Network by Alpern, Steve, Lidbetter, Thomas

“…A point lies on a network according to some unknown probability distribution. Starting at a specified root of the network, a Searcher moves to find this point…”
Get full text

Find-and-Fetch Search on a Tree by Alpern, Steve

“…We introduce a new type of search game called the "find-and-fetch" game F ( Q , O ). The Hider simply picks any point H in the network Q . The Searcher starts…”
Get full text

Hide-and-seek games on a tree to which Eulerian networks are attached by Alpern, Steve

“…We analyze the hide‐and‐seek game Γ(G) on certain networks G. The hider picks a hiding point yin Gand the searcher picks a unit speed path S(t) in G, starting…”
Get full text

Rendezvous Search: A Personal Perspective by Alpern, Steve

“…The rendezvous-search problem was posed by the author 25years ago. In its basic form, it asks how two unit speed players can find each other in least expected…”
Get full text

The Faulty Satnav (GPS) Problem: Search for home in networks with unreliable directions by Alpern, Steve

“…A Searcher wants to find the Home node on a given Network, but his directions are unreliable. At every branch node of a network Q, a Satnav (GPS) points to the…”
Get full text

Ambush frequency should increase over time during optimal predator search for prey by Alpern, Steve, Fokkink, Robbert, Timmer, Marco, Casas, Jérôme

“…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:…”
Get full text

Rendezvous search on labeled networks by Alpern, Steve

“…Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider…”
Get full text

Illuminating a Network from Its Nodes by Alpern, Steve, Fokkink, Robbert

“…A network is to be illuminated by placing lights at the nodes, so that each edge is bright enough and the total intensity is minimized. A folk result says this…”
Get full text

Search and Delivery Man Problems: When are depth-first paths optimal? by Alpern, Steve, Lidbetter, Thomas

“…•A target is hidden on a tree network according to a known probability distribution.•When is the trajectory that finds the target in minimum expected time…”
Get full text

Approximate solutions for expanding search games on general networks by Alpern, Steve, Lidbetter, Thomas

“…We study the classical problem introduced by R. Isaacs and S. Gal of minimizing the time to find a hidden point H on a network Q moving from a known starting…”
Get full text

The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries? by Alpern, Steve, Baston, Vic

“…This paper analyzes a variation of the secretary problem in which two selectors with different fields of interest each want to appoint one of the n candidates…”
Get full text

Search-and-rescue rendezvous by Leone, Pierre, Buwaya, Julia, Alpern, Steve

“…•New Rendezvous games defined and solved where the players use Gifts.•New Search and Rescue games.•On the optimality of Wait for Mommy.•New way of solving the…”
Get full text

The importance of voting order for jury decisions by sequential majority voting by Alpern, Steve, Chen, Bo

“…•We model voting strategies on a heterogeneous jury that votes sequentially to reach a correct verdict.•The “ability” of a juror is a number that indicates the…”
Get full text