2020

Alpern, Steve and Lidbetter, Thomas (2020) Search and delivery man problems : when are depth-first paths optimal? European Journal of Operational Research . doi:10.1016/j.ejor.2020.02.026 (In Press)

2019

Alpern, Steve (2019) Search for an immobile Hider in a known subset of a network. Theoretical Computer Science, 794 . pp. 20-60. doi:10.1016/j.tcs.2018.06.022 (In Press)

Alpern, Steve, Gal, Schmuel, Lee, Viciano and Casas, Jérôme (2019) A stochastic game model of searching predators and hiding prey. Journal of The Royal Society Interface, 16 (153). 20190087. doi:10.1098/rsif.2019.0087

Alpern, Steve and Lidbetter, Thomas (2019) Approximate solutions for expanding search games on general networks. Annals of Operations Research , 275 (2). pp. 259-279. doi:10.1007/s10479-018-2966-0

Alpern, Steve, Lidbetter, Thomas and Papadaki, Katerina (2019) Optimizing periodic patrols against short attacks on the line and other networks. European Journal of Operational Research, 273 (3). pp. 1065-1073. doi:10.1016/j.ejor.2018.08.050

Alpern, Steve and Howard, J. V. (2019) A short solution to the many-player silent duel with arbitrary consolation prize. European Journal of Operational Research, 273 (2). pp. 646-649. doi:10.1016/j.ejor.2018.08.040

2018

Leone, Pierre and Alpern, Steve (2018) Rendezvous search with markers that can be dropped at chosen times. Naval Research Logistics (NRL), 65 (6-7). pp. 449-461. doi:10.1002/nav.21818

2017

Alpern, Steve and Chen, Bo (2017) The importance of voting order for decisions by sequential majority voting. European Journal of Operational Research, 258 (3). pp. 1072-1081. doi:10.1016/j.ejor.2016.09.053

Alpern, Steve (2017) Hide-and-seek games on a network, using combinatorial search paths. Operations Research, 65 (5). pp. 1207-1214. doi:10.1287/opre.2017.1594

Alpern, Steve and Baston, V. J. (2017) The secretary problem with a selection committee : do conformist committees hire better secretaries. Management Science, 63 (4). 1184 -1197. doi:10.1287/mnsc.2015.2377

Alpern, Steve and Chen, Bo (2017) Who should cast the casting vote? Using sequential voting to amalgamate information. Theory and Decision, 83 (2). pp. 259-282. doi:10.1007/s11238-017-9593-0

Alpern, Steve and Howard, J. V. (2017) Winner-takes-all games : strategic optimisation of rank. Operations Research, 65 (5). pp. 1165-1176. doi:10.1287/opre.2017.1635

2016

Papadaki, Katerina, Alpern, Steve, Lidbetter, Thomas and Morton, Alec (2016) Patrolling a border. Operations Research, 64 (6). pp. 1256-1269. doi:10.1287/opre.2016.1511

Alpern, Steve, Fokkink, Robbert and Simanjuntak, Martin (2016) Optimal search and ambush for a hider who can escape the search region. European Journal of Operational Research, 251 (3). pp. 707-714. doi:10.1016/j.ejor.2015.12.017

Alpern, Steve, Auslander, Joseph and Silva, Cesar E. (2016) The mathematical work of John Oxtoby. Contemporary Mathematics, 678 . pp. 43-52.

2015

Gal, Shmuel, Alpern, Steve and Casas, Jérôme (2015) Prey should hide more randomly when a predator attacks more persistently. Journal of The Royal Society Interface, 12 (113). 20150861. doi:10.1098/rsif.2015.0861

Alpern, Steve and Lidbetter, Thomas (2015) Optimal trade-off between speed and acuity when searching for a small object. Operations Research, 63 (1). pp. 122-133. doi:10.1287/opre.2014.1331

Alpern, Steve and Howard, J. V. (2015) The strategic optimisation of rank. Operations Research . (Submitted)

2014

Alpern, Steve and Lidbetter, Thomas (2014) Searching a variable speed network. Mathematics of Operations Research, Volume 39 (Number 3). pp. 697-711. doi:10.1287/moor.2013.0634

Alpern, Steve and Fokkink, Robbert (2014) Accumulation games on graphs. Networks, Volume 64 (Number 1). pp. 40-47. doi:10.1002/net.21555

Alpern, Steve, Katrantzi, Ioanna and Ramsey, David (2014) Equilibrium population dynamics when mating is by mutual choice based on age. Theoretical Population Biology, 94 . pp. 63-72. doi:10.1016/j.tpb.2013.01.001

Alpern, Steve and Chen, Bo (2014) Who should vote first on a small heterogeneous sequential jury? (Submitted)

2013

Alpern, Steve and Fokkink, Robbert (2013) Illuminating a network from its nodes. The American Mathematical Monthly, Volume 120 (Number 4). pp. 358-359. doi:10.4169/amer.math.monthly.120.04.358

Alpern, Steve and Lidbetter, T. (2013) Mining coal or finding terrorists : the expanding search paradigm. Operations Research, 61 (2). pp. 265-279. doi:10.1287/opre.1120.1134

Alpern, Steve, Katrantzi, I. and Ramsey, D.M. (2013) Partnership formation with age-dependent preferences. European Journal of Operational Research, Vol.225 (No.1). pp. 91-99. doi:10.1016/j.ejor.2012.09.012

Alpern, Steve, Fokkink, Robbert, Gal, Shmuel and Timmer, Marco (2013) On search games that include ambush. SIAM Journal on Control and Optimization, Volume 51 (Number 6). pp. 4544-4556. doi:10.1137/110845665

Alpern, S., Fokkink, R., Gasieniec, L., Lindelauf, R. and Subrahmanian, V. S. (2013) Search theory : a game theoretic perspective. New York, NY: Springer. ISBN 9781461468257

2012

Alpern, Steve, Fokkink, Robbert and Pelekis, Christos (2012) A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources. Journal of Optimization Theory and Applications, Vol.153 (No.3). pp. 650-661. doi:10.1007/s10957-011-9977-1

Alpern, Steve, Fokkink, R., Lidbetter, T. and Clayton, N. S. (2012) A search game model of the scatter hoarder's problem. Journal of The Royal Society Interface, 9 (70). pp. 869-879. doi:10.1098/rsif.2011.0581

2011

Alpern, Steve, Fokkink, Robbert , Timmer, Marco and Casas, Jérôme (2011) Ambush frequency should increase over time during optimal predator search for prey. Journal of the Royal Society Interface, Vol.8 (No.64). pp. 1665-1672. doi:10.1098/rsif.2011.0154

Alpern, Steve (2011) Find-and-fetch search on a tree. Operations Research, Vol.59 (No.5). pp. 1258-1268. doi:10.1287/opre.1110.0966

Alpern, Steve, Morton, Alec and Papadaki, Katerina (2011) Patrolling Games. Operations Research, 59 (5). pp. 1246-1257. doi:10.1287/opre.1110.0983

Alpern, Steve (2011) A new approach to Gal's Theory of Search Games on Weakly Eulerian networks. Dynamic Games and Applications, 1 (2). pp. 209-219. doi:10.1007/s13235-011-0009-4

2010

Alpern, Steve and Fokkink, Robbert (2010) Disperse or unite? A mathematical model of coordinated attack. In: Alpcan, Tansu and Buttyán, Levente and Baras, John S., (eds.) Decision and game theory for security : first international conference, GameSec 2010, Berlin, Germany, November 22-23, 2010 : proceedings. Lecture notes in computer science (6442). London: Springer, p. 220. ISBN 9783642171970

Alpern, Steve, Fokkink, Robbert and Kikuta, Ken (2010) On Ruckle's Conjecture on Accumulation Games. SIAM Journal on Control and Optimization, 48 (8). pp. 5073-5083. doi:10.1137/080741926

Alpern, Steve (2010) Search games on trees with asymmetric travel times. SIAM Journal on Control and Optimization, Vol.48 (No.8). pp. 5547-5563. doi:10.1137/090781115

Alpern, Steve, Gal, Shmuel and Solan, Eilon (2010) A sequential selection game with vetoes. Games and Economic Behavior, Vol.68 (No.1). pp. 1-14. doi:10.1016/j.geb.2009.05.006

2009

Alpern, Steve and Gal, Shmuel (2009) Analysis and design of selection committees : a game theoretic secretary problem. International Journal of Game Theory, Vol.38 (No.3). pp. 377-394. doi:10.1007/s00182-009-0159-4

Alpern, Steve and Katrantzi, Ioanna (2009) Equilibria of two-sided matching games with common preferences. European Journal of Operational Research, Vol.196 (No.3). pp. 1214-1222. doi:10.1016/j.ejor.2008.05.012

Alpern, Steve, Baston, Vic and Gal, Shmuel (2009) Searching symmetric networks with Utilitarian-Postman paths. Networks, Vol.53 (No.4). pp. 392-402. doi:10.1002/net.20314

Alpern, Steve, Fokkink, R., Lindelauf, R. and Olsder, G. (2009) A numerical approach to the 'Princess and Monster' game on an interval. In: Bernhard, Pierre and Grigorʹevich Gaĭt︠s︡gori, Vladimir and Pourt, Odile , (eds.) Advances in dynamic games and their applications : analytical and numerical developments. Annals of the International Society of Dynamic Games (10). Boston, Mass. : Birkhäuser ; London : Springer [distributor], p. 149. ISBN 9780817648343

2008

Alpern, Steve (2008) Hide-and-seek games on a tree to which Eulerian networks are attached. Networks, Vol.52 (No.3). pp. 162-166. doi:10.1002/net.20235

Alpern, Steve (2008) Line-of-sight rendezvous. European Journal of Operational Research, Vol.188 (No.3). pp. 865-883. doi:10.1016/j.ejor.2007.03.043

Alpern, Steve and Prasad, Vidhu (2008) MultiTowers, conjugacies and codes : three theorems in ergodic theory, one variation on Rokhlin's Lemma. Proceedings of the Mathematical Society, Vol.136 (No.12). pp. 4373-4383. doi:10.1090/S0002-9939-08-09520-8

Alpern, Steve, Baston, Vic and Gal, Shmuel (2008) Network search games with immobile hider, without a designated searcher starting point. International Journal of Game Theory, 37 (2). pp. 281-302. doi:10.1007/s00182-008-0116-7

Alpern, Steve, Fokkink, Robbert, Lindelauf, Roy and Olsder, Geert-Jan (2008) The "Princess and Monster" game on an interval. SIAM Journal on Control and Optimization, Vol.47 (No.3). pp. 1178-1190. doi:10.1137/060672054

2007

Alpern, Steve (2007) Rendezvous Search with Revealed Information : Applications to the Line. Journal of Applied Probability, 44 (1). pp. 1-15. doi:10.1239/jap/1175267160

Alpern, Steve and Prasad, Vidhu (2007) Rotational (and other) representations of stochastic matrices. Stochastic Analysis and Applications, Vol.26 (No.1). pp. 1-15. doi:10.1080/07362990701670209

2006

Alpern, Steve and Baston, Vic (2006) Rendezvous in Higher Dimensions. SIAM Journal on Control and Optimization, 44 (6). pp. 2233-2252. doi:10.1137/S0363012904443531

Alpern, Steve and Baston, Vic (2006) A common notion of clockwise can help in planar rendezvous. European Journal of Operational Research, 175 (2). pp. 688-706. doi:10.1016/j.ejor.2005.03.050

2005

Alpern, Steve and Baston, Vic (2005) Rendezvous on a Planar Lattice. Operations Research, 53 (6). pp. 996-1006. doi:10.1287/opre.1050.0217

Alpern, Steve and Reyniers, Diane (2005) Strategic mating with common preferences. Journal of Theoretical Biology, 237 (4). pp. 337-354. doi:10.1016/j.jtbi.2003.09.021

2003

Alpern, S. and Gal, S. (2003) The theory of search games and rendezvous. International Series in Operations Research and Management Science, 55 . New York: Kluwer. ISBN 9780792374688

2002

Alpern, Steve and Prasad, Vidhu (2002) Properties generic for Lebesgue space automorphisms are generic for measure-preserving manifold homeomorphisms. Ergodic Theory and Dynamical Systems, 22 (06). pp. 1587-1620. doi:10.1017/S0143385702001281

Alpern, Steve (2002) Rendezvous Search : A Personal Perspective. Operations Research, 50 (5). pp. 772-795. doi:10.1287/opre.50.5.772.363

Alpern, Steve and Lim, Wei Shi (2002) Rendezvous of three agents on the line. Naval Research Logistics, 49 (3). pp. 244-255. doi:10.1002/nav.10005

Alpern, Steve (2002) Rendezvous search on labeled networks. Naval Research Logistics, 49 (3). pp. 256-274. doi:10.1002/nav.10011

Alpern, Steve and Gal, Shmuel (2002) Searching for an Agent Who May OR May Not Want to be Found. Operations Research, 50 (2). pp. 311-323. doi:10.1287/opre.50.2.311.433

Alpern, Steve and Reyniers, Diane J. (2002) Spatial dispersion as a dynamic coordination problem. Theory and Decision, 53 (1). pp. 29-59. doi:10.1023/A:1020891631738

2001

Alpern, Steve and Reyniers, Diane (2001) Games of crowding. International Game Theory Review, 03 (01). pp. 27-56. doi:10.1142/S0219198901000294

Alpern, S. and Prasad, V. (2001) Typical dynamics of volume preserving homeomorphisms. Cambridge Tracts in Mathematics, 139 . Cambridge, UK: Cambridge University Press. ISBN 9780511543180

2000

Alpern, Steve and Howard, J. V. (2000) Alternating search at two locations. Dynamics and Control, 10 (4). pp. 319-339. doi:10.1023/A:1011245715521

Alpern, Steve and Prasad, Vidhu (2000) Maximally chaotic homeomorphisms of sigma-compact manifolds. Topology and its Applications, 105 (1). pp. 103-112. doi:10.1016/S0166-8641(99)00051-6

Alpern, Steve and Beck, Anatole (2000) Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance. Operations Research, 48 (3). pp. 498-501. doi:10.1287/opre.48.3.498.12432

1999

Alpern, Steve and Beck, Anatole (1999) Asymmetric Rendezvous on the Line Is a Double Linear Search Problem. Mathematics of Operations Research, 24 (3). pp. 604-618. doi:10.1287/moor.24.3.604

Alpern, Steve and Prasad, Vidhu (1999) Chaotic homeomorphisms of R^n, lifted from torus homeomorphisms. Topology and its Applications, 105 (1). pp. 103-112.

Alpern, Steve (1999) Combinatorial approximation by Devaney-chaotic or periodic volume preserving homeomorphisms. International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, 9 (5). pp. 843-848. doi:10.1142/S0218127499000596

Alpern, Steve and Beck, Anatole (1999) Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting. Operations Research, 47 (6). 849 -861.

Alpern, Steve, Baston, V. J. and Essegaier, Skander (1999) Rendezvous search on a graph. Journal of Applied Probability, 36 (1). pp. 223-231.

Alpern, Steve and Reyniers, Diane (1999) Strategic Mating with Homotypic Preferences. Journal of Theoretical Biology, 198 (1). pp. 71-88. doi:10.1006/jtbi.1999.0903

1998

Alpern, Steve and Lim, Wei Shi (1998) The Symmetric Rendezvous-Evasion Game. SIAM Journal on Control and Optimization, 36 (3). pp. 948-959. doi:10.1137/S0363012996309770

1997

Lim, Wei Shi, Alpern, Steve and Beck, Anatole (1997) Rendezvous search on the line with more than two players. Operations Research, 45 (3). pp. 357-364.

Alpern, Steve and Beck, Anatole (1997) Rendezvous search on the line with bounded resources: expected time minimization. European Journal of Operational Research, 101 (3). pp. 588-597. doi:10.1016/S0377-2217(96)00192-0

1996

Lim, Wei Shi and Alpern, Steve (1996) Minimax Rendezvous on the Line. SIAM Journal on Control and Optimization, 34 (5). pp. 1650-1665. doi:10.1137/S036301299427816X

1995

Alpern, Steve (1995) Almost Periodic Ergodic Rn-Homeomorphisms. Advances in Mathematics, 116 (1). pp. 46-54. doi:10.1006/aima.1995.1064

Alpern, Steve (1995) The Rendezvous Search Problem. SIAM Journal on Control and Optimization, 33 (3). pp. 673-683. doi:10.1137/S0363012993249195

Alpern, Steve and Gal, Shmuel (1995) Rendezvous Search on the Line with Distinguishable Players. SIAM Journal on Control and Optimization, 33 (4). pp. 1270-1276. doi:10.1137/S0363012993260288

Alpern, Steve and Prasad, Vidhu (1995) Typical Transitivity for Lifts of Rotationless Annulus or Torus Homeomorphisms. Bulletin of the London Mathematical Society, 27 (1). pp. 79-81. doi:10.1112/blms/27.1.79

1993

Alpern, Steve and Prasad, Vidhu (1993) Combinatorial Proofs of the Conley-Zehnder-Franks Theorem on a Fixed Point for Torus Homeomorphisms. Advances in Mathematics, 99 (2). pp. 238-247. doi:10.1006/aima.1993.1024

Alpern, Steve and Prasad, Vidhu (1993) Topological ergodic theory and mean rotation. Proceedings of the American Mathematical Society, 118 (1). pp. 279-284. doi:10.1090/S0002-9939-1993-1143014-5

1992

Alpern, Steve (1992) Infiltration games on arbitrary graphs. Journal of Mathematical Analysis and Applications, 163 (1). pp. 286-288. doi:10.1016/0022-247X(92)90295-O

1991

Alpern, Steve and Beck, Anatole (1991) Hex games and twist maps on the annulus. The American Mathematical Monthly, 98 (9). pp. 803-811. doi:10.2307/2324266

Alpern, Steve (1991) Cycles in extensive form perfect information games. Journal of Mathematical Analysis and Applications, 159 (1). pp. 1-17. doi:10.1016/0022-247X(91)90217-N

Alpern, Steve and Prasad, Vidhu (1991) Typical recurrence for lifts of mean rotation zero annulus homeomorphisms. Bulletin of the London Mathematical Society, 23 (5). pp. 477-481. doi:10.1112/blms/23.5.477

1990

Alpern, Steve and Prasad, Vidhu (1990) Return times for nonsingular measurable transformations. Journal of Mathematical Analysis and Applications, 152 (2). pp. 470-487. doi:10.1016/0022-247X(90)90078-T

1989

Alpern, Steve and Prasad, Vidhu (1989) Coding a Stationary Process to One with Prescribed Marginals. The Annals of Probability, 17 (4). pp. 1658-1663. doi:10.1214/aop/1176991180

Alpern, Steve (1989) Geometric search theory and demand uncertainty. Engineering Costs and Production Economics, 17 (1-4). pp. 245-251. doi:10.1016/0167-188X(89)90073-6

Alpern, Steve and Snower, Dennis J. (1989) A search model of optimal pricing and production. Engineering Costs and Production Economics, 15 . pp. 279-284. doi:10.1016/0167-188X(89)90136-5

1988

Alpern, Steve (1988) Area preserving homeomorphisms of the open disk without fixed points. Proceedings of the American Mathematical Society, 103 (2). pp. 624-626. doi:10.1090/S0002-9939-1988-0943094-1

Alpern, Steve, Choksi, J. R. and Prasad, Vidhu (1988) Conjugates of infinite measure preserving transformations. Canadian Journal of Mathematics, 40 (3). pp. 742-749. doi:10.4153/CJM-1988-032-1

Alpern, Steve and Prasad, Vidhu (1988) Dynamics induced on the ends of non-compact manifold. Ergodic Theory and Dynamical Systems, 8 (01). pp. 1-15. doi:10.1017/S0143385700004284

Alpern, Steve (1988) Game with repeated decisions. SIAM Journal on Control and Optimization, 26 (2). pp. 468-477. doi:10.1137/0326028

Alpern, Steve and Snower, Dennis J. (1988) 'High-low search' in product and labor markets. The American Economic Review, 78 (2). pp. 356-362.

Alpern, Steve and Gal, Shmuel (1988) A Mixed-Strategy Minimax Theorem without Compactness. SIAM Journal on Control and Optimization, 26 (6). pp. 1357-1361. doi:10.1137/0326077

1987

Alpern, Steve and Prasad, Vidhu (1987) End behaviour and ergodicity for homeomorphisms of manifolds with finitely many ends. Canadian Journal of Mathematics, 39 (2). pp. 473-491. doi:10.4153/CJM-1987-020-5

Alpern, Steve and Prasad, Vidhu (1987) Weak mixing manifold homeomorphisms preserving an infinite measure. Canadian Journal of Mathematics, 39 (6). pp. 1475-1488.

1986

Alpern, Steve and Asic, Miroslav (1986) Ambush Strategies in Search Games on Graphs. SIAM Journal on Control and Optimization, 24 (1). pp. 66-75. doi:10.1137/0324002

Alpern, Steve and Ašić, Miroslav D. (1986) Search Games (Shmuel Gal). SIAM Review, 24 (2). pp. 235-236. doi:10.1137/1024054

1985

Alpern, Steve (1985) Conjecture: In General a Mixing Transformation is Not Two-Fold Mixing. The Annals of Probability, 13 (1). pp. 310-313. doi:10.1214/aop/1176993084

Alpern, Steve (1985) Search for point in interval, with high-low feedback. Mathematical Proceedings of the Cambridge Philosophical Society, 98 (3). pp. 569-578. doi:10.1017/S0305004100063775

Alpern, Steve and Asic, Miroslav (1985) The search value of a network. Networks, 15 (2). pp. 229-238. doi:10.1002/net.3230150208

1983

Alpern, Steve (1983) Nonstable Ergodic Homeomorphisms of R^4. Indiana University Mathematics Journal, 32 . pp. 187-191.

Alpern, Steve (1983) Rotational representations of stochastic matrices. Annals of Probability, 11 (3). pp. 789-794.

1981

Alpern, Steve (1981) Return times and conjugates of an antiperiodic transformation. Ergodic Theory and Dynamical Systems, 1 (02). pp. 135-143. doi:10.1017/S0143385700009172

1979

Alpern, Steve and Edwards, Robert D. (1979) Lusin's theorem for measure preserving homeomorphisms. Mathematika, 26 (1). pp. 33-43. doi:10.1112/S002557930000958X

Alpern, Steve (1979) Measure preserving Homeomorphisms of R^n. Indiana University Mathematics Journal, 28 . pp. 957-960.

1978

Alpern, Steve (1978) Approximation to and by measure preserving homeomorphisms. Journal of the London Mathematical Society, s2-18 (2). pp. 305-315. doi:10.1112/jlms/s2-18.2.305

Alpern, Steve (1978) Superhamiltonian graphs. Journal of Combinatorial Theory, Series B, 25 (1). pp. 62-73. doi:10.1177/0018726707080080

Alpern, Steve (1978) A topological analog of Halmos' conjugacy lemma. Inventiones Mathematicae, 48 (1). pp. 1-6. doi:10.1007/BF01390059

1976

Alpern, Steve (1976) New proofs that weak mixing is generic. Inventiones Mathematicae, 32 (3). pp. 263-278. doi:10.1007/BF01425570