Steve Alpern

Publication Activity (10 Years)

Years Active: 1978-2023
Publications (10 Years): 28

Top Topics

Approximate Solutions

Majority Voting

Rendezvous Search

Leader Follower

Top Venues

Eur. J. Oper. Res.

Theor. Comput. Sci.

Publications

Steve Alpern
The Faulty Satnav (GPS) Problem: Search for home in networks with unreliable directions. Theor. Comput. Sci. 975 (2023)
Steve Alpern, Thomas Lidbetter
Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents. CoRR (2023)
Pierre Leone, Steve Alpern
A Symbolic Programming Approach to the Rendezvous Search Problem. Oper. Res. Forum 3 (1) (2022)
Steve Alpern, Paul Chleboun, Stamatios Katsikas, Kyle Y. Lin
Adversarial Patrolling in a Uniform. Oper. Res. 70 (1) (2022)
Steve Alpern, Bo Chen
Optimizing voting order on sequential juries: a median voter theorem and beyond. Soc. Choice Welf. 58 (3) (2022)
Steve Alpern, Li Zeng
Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks. Dyn. Games Appl. 12 (1) (2022)
Pierre Leone, Julia Buwaya, Steve Alpern
Search-and-rescue rendezvous. Eur. J. Oper. Res. 297 (2) (2022)
Steve Alpern, Thuy Bui, Thomas Lidbetter, Katerina Papadaki
Continuous Patrolling Games. Oper. Res. 70 (6) (2022)
Steve Alpern
The Faulty GPS Problem: Shortest Time Paths in Networks with Unreliable Directions. CoRR (2021)
Steve Alpern, Bo Chen
Optimizing Voting Order on Sequential Juries: A Median Voter Theorem. CoRR (2020)
Steve Alpern, Thomas Lidbetter, Katerina Papadaki
Continuous Patrolling Games. CoRR (2020)
Steve Alpern, Thomas Lidbetter
Search and Delivery Man Problems: When are depth-first paths optimal? Eur. J. Oper. Res. 285 (3) (2020)
Steve Alpern, Thomas Lidbetter
Approximate solutions for expanding search games on general networks. Ann. Oper. Res. 275 (2) (2019)
Steve Alpern, Stamatios Katsikas
A note on the Uniformed Patroller Game. CoRR (2019)
Steve Alpern
Search for an immobile Hider in a known subset of a network. Theor. Comput. Sci. 794 (2019)
Steve Alpern, Thomas Lidbetter, Katerina Papadaki
Optimizing periodic patrols against short attacks on the line and other networks. Eur. J. Oper. Res. 273 (3) (2019)
Steve Alpern, J. V. Howard
A short solution to the many-player silent duel with arbitrary consolation prize. Eur. J. Oper. Res. 273 (2) (2019)
Steve Alpern, Viciano Lee
A Game Model of Search and Pursuit. CoRR (2018)
Steve Alpern, Vic Baston
The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries? Manag. Sci. 63 (4) (2017)
Steve Alpern, Bo Chen
The importance of voting order for jury decisions by sequential majority voting. Eur. J. Oper. Res. 258 (3) (2017)
Steve Alpern, J. V. Howard
Winner-Take-All Games: The Strategic Optimisation of Rank. Oper. Res. 65 (5) (2017)
Steve Alpern, J. V. Howard
A Short Solution to the Many-Player Silent Duel with Arbitrary Consolation Prize. CoRR (2017)
Steve Alpern
Hide-and-Seek Games on a Network, Using Combinatorial Search Paths. Oper. Res. 65 (5) (2017)
Pierre Leone, Steve Alpern
Search-and-Rescue Rendezvous. CoRR (2016)
Steve Alpern, Robbert Fokkink, Martin Simanjuntak
Optimal search and ambush for a hider who can escape the search region. Eur. J. Oper. Res. 251 (3) (2016)
Katerina Papadaki, Steve Alpern, Thomas Lidbetter, Alec Morton
Patrolling a Border. Oper. Res. 64 (6) (2016)
Steve Alpern, Thomas Lidbetter
Constant Factor Approximate Solutions for Expanding Search on General Networks. CoRR (2016)
Steve Alpern, Thomas Lidbetter, Alec Morton, Katerina Papadaki
Patrolling a Pipeline. GameSec (2016)
Steve Alpern, Thomas Lidbetter
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object. Oper. Res. 63 (1) (2015)
Steve Alpern, Robbert Fokkink
Accumulation games on graphs. Networks 64 (1) (2014)
Steve Alpern, Thomas Lidbetter
Searching a Variable Speed Network. Math. Oper. Res. 39 (3) (2014)
Steve Alpern, Robbert Fokkink, Shmuel Gal, Marco Timmer
On Search Games That Include Ambush. SIAM J. Control. Optim. 51 (6) (2013)
Steve Alpern, Ioanna Katrantzi, David M. Ramsey
Partnership formation with age-dependent preferences. Eur. J. Oper. Res. 225 (1) (2013)
Steve Alpern, Thomas Lidbetter
Mining Coal or Finding Terrorists: The Expanding Search Paradigm. Oper. Res. 61 (2) (2013)
Steve Alpern, Robbert Fokkink
Illuminating a Network from Its Nodes. Am. Math. Mon. 120 (4) (2013)
Steve Alpern, Robbert Fokkink, Christos Pelekis
A Proof of the Kikuta-Ruckle Conjecture on Cyclic Caching of Resources. J. Optim. Theory Appl. 153 (3) (2012)
Steve Alpern
A New Approach to Gal's Theory of Search Games on Weakly Eulerian Networks. Dyn. Games Appl. 1 (2) (2011)
Steve Alpern
Find-and-Fetch Search on a Tree. Oper. Res. 59 (5) (2011)
Steve Alpern, Alec Morton, Katerina Papadaki
Patrolling Games. Oper. Res. 59 (5) (2011)
Steve Alpern, Robbert Fokkink, Joram op den Kelder, Tom Lidbetter
Disperse or Unite? A Mathematical Model of Coordinated Attack. GameSec (2010)
Steve Alpern
Search Games on Trees with Asymmetric Travel Times. SIAM J. Control. Optim. 48 (8) (2010)
Steve Alpern, Shmuel Gal, Eilon Solan
A sequential selection game with vetoes. Games Econ. Behav. 68 (1) (2010)
Steve Alpern, Robbert Fokkink, Ken Kikuta
On Ruckle's Conjecture on Accumulation Games. SIAM J. Control. Optim. 48 (8) (2010)
Steve Alpern, Robbert Fokkink
How to hide information for later use on networks. GAMENETS (2009)
Steve Alpern, Shmuel Gal
Analysis and design of selection committees: a game theoretic secretary problem. Int. J. Game Theory 38 (3) (2009)
Steve Alpern, Vic Baston, Shmuel Gal
Searching symmetric networks with Utilitarian-Postman paths. Networks 53 (4) (2009)
Steve Alpern, Ioanna Katrantzi
Equilibria of two-sided matching games with common preferences. Eur. J. Oper. Res. 196 (3) (2009)
Steve Alpern
Hide-and-seek games on a tree to which Eulerian networks are attached. Networks 52 (3) (2008)
Steve Alpern, Robbert Fokkink, Roy Lindelauf, Geert Jan Olsder
The ''Princess and Monster'' Game on an Interval. SIAM J. Control. Optim. 47 (3) (2008)
Steve Alpern
Line-of-sight rendezvous. Eur. J. Oper. Res. 188 (3) (2008)
Steve Alpern, Vic Baston, Shmuel Gal
Network search games with immobile hider, without a designated searcher starting point. Int. J. Game Theory 37 (2) (2008)
Steve Alpern, Vic Baston
A common notion of clockwise can help in planar rendezvous. Eur. J. Oper. Res. 175 (2) (2006)
Steve Alpern, Vic Baston
Rendezvous in Higher Dimensions. SIAM J. Control. Optim. 44 (6) (2006)
Steve Alpern, Vic Baston
Rendezvous on a Planar Lattice. Oper. Res. 53 (6) (2005)
Steve Alpern
Rendezvous Search: A Personal Perspective. Oper. Res. 50 (5) (2002)
Steve Alpern, Shmuel Gal
Searching for an Agent Who May OR May Not Want to be Found. Oper. Res. 50 (2) (2002)
Steve Alpern, Diane J. Reyniers
Games of Crowding. IGTR 3 (1) (2001)
Steve Alpern, Anatole Beck
Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance. Oper. Res. 48 (3) (2000)
Steve Alpern, Anatole Beck
Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting. Oper. Res. 47 (6) (1999)
Steve Alpern, Anatole Beck
Asymmetric Rendezvous on the Line Is a Double Linear Search Problem. Math. Oper. Res. 24 (3) (1999)
Wei Shi Lim, Steve Alpern, Anatole Beck
Rendezvous Search on the Line with More Than Two Players. Oper. Res. 45 (3) (1997)
Steve Alpern, Miroslav D. Asic
The search value of a network. Networks 15 (2) (1985)
Steve Alpern
Superhamiltonian graphs. J. Comb. Theory, Ser. B 25 (1) (1978)