Steve Alpern

According to our database1, Steve Alpern authored at least 54 papers between 1978 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:



Search and Delivery Man Problems: When are depth-first paths optimal?
Eur. J. Oper. Res., 2020

Continuous Patrolling Games.
CoRR, 2020

Optimizing Voting Order on Sequential Juries: A Median Voter Theorem.
CoRR, 2020

Search for an immobile Hider in a known subset of a network.
Theor. Comput. Sci., 2019

Optimizing periodic patrols against short attacks on the line and other networks.
Eur. J. Oper. Res., 2019

A short solution to the many-player silent duel with arbitrary consolation prize.
Eur. J. Oper. Res., 2019

A note on the Uniformed Patroller Game.
CoRR, 2019

Approximate solutions for expanding search games on general networks.
Ann. Oper. Res., 2019

A Game Model of Search and Pursuit.
CoRR, 2018

The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries?
Manag. Sci., 2017

Winner-Take-All Games: The Strategic Optimisation of Rank.
Oper. Res., 2017

Hide-and-Seek Games on a Network, Using Combinatorial Search Paths.
Oper. Res., 2017

The importance of voting order for jury decisions by sequential majority voting.
Eur. J. Oper. Res., 2017

Patrolling a Border.
Oper. Res., 2016

Optimal search and ambush for a hider who can escape the search region.
Eur. J. Oper. Res., 2016

Search-and-Rescue Rendezvous.
CoRR, 2016

Constant Factor Approximate Solutions for Expanding Search on General Networks.
CoRR, 2016

Patrolling a Pipeline.
Proceedings of the Decision and Game Theory for Security - 7th International Conference, 2016

Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object.
Oper. Res., 2015

Accumulation games on graphs.
Networks, 2014

Searching a Variable Speed Network.
Math. Oper. Res., 2014

Illuminating a Network from Its Nodes.
Am. Math. Mon., 2013

On Search Games That Include Ambush.
SIAM J. Control. Optim., 2013

Mining Coal or Finding Terrorists: The Expanding Search Paradigm.
Oper. Res., 2013

Partnership formation with age-dependent preferences.
Eur. J. Oper. Res., 2013

A Proof of the Kikuta-Ruckle Conjecture on Cyclic Caching of Resources.
J. Optim. Theory Appl., 2012

Patrolling Games.
Oper. Res., 2011

Find-and-Fetch Search on a Tree.
Oper. Res., 2011

A New Approach to Gal's Theory of Search Games on Weakly Eulerian Networks.
Dyn. Games Appl., 2011

On Ruckle's Conjecture on Accumulation Games.
SIAM J. Control. Optim., 2010

Search Games on Trees with Asymmetric Travel Times.
SIAM J. Control. Optim., 2010

A sequential selection game with vetoes.
Games Econ. Behav., 2010

Disperse or Unite? A Mathematical Model of Coordinated Attack.
Proceedings of the Decision and Game Theory for Security, 2010

Searching symmetric networks with Utilitarian-Postman paths.
Networks, 2009

Analysis and design of selection committees: a game theoretic secretary problem.
Int. J. Game Theory, 2009

Equilibria of two-sided matching games with common preferences.
Eur. J. Oper. Res., 2009

How to hide information for later use on networks.
Proceedings of the 1st International Conference on Game Theory for Networks, 2009

The ''Princess and Monster'' Game on an Interval.
SIAM J. Control. Optim., 2008

Hide-and-seek games on a tree to which Eulerian networks are attached.
Networks, 2008

Network search games with immobile hider, without a designated searcher starting point.
Int. J. Game Theory, 2008

Line-of-sight rendezvous.
Eur. J. Oper. Res., 2008

Rendezvous in Higher Dimensions.
SIAM J. Control. Optim., 2006

A common notion of clockwise can help in planar rendezvous.
Eur. J. Oper. Res., 2006

Rendezvous on a Planar Lattice.
Oper. Res., 2005

The theory of search games and rendezvous.
International series in operations research and management science 55, Kluwer, ISBN: 978-0-7923-7468-8, 2003

Searching for an Agent Who May OR May Not Want to be Found.
Oper. Res., 2002

Rendezvous Search: A Personal Perspective.
Oper. Res., 2002

Games of Crowding.
IGTR, 2001

Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance.
Oper. Res., 2000

Asymmetric Rendezvous on the Line Is a Double Linear Search Problem.
Math. Oper. Res., 1999

Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting.
Oper. Res., 1999

Rendezvous Search on the Line with More Than Two Players.
Oper. Res., 1997

The search value of a network.
Networks, 1985

Superhamiltonian graphs.
J. Comb. Theory, Ser. B, 1978