Alpern, Steven


Professor Steven Alpern  

Department

Position held

Department of Mathematics

Professor of Mathematics

Media experience:

Radio

Contact Points

LSE phone number:

+44 (0)20 7955 7620

Publications

The following references are sourced from LSE Research Online|. References that are linked lead to the full text.

2012

Alpern, Steven and Fokkink, Robbert and Pelekis, Christos (2012) A proof of the Kikuta–Ruckle Conjecture on cyclic caching of resources. Journal of optimization theory and applications, 153 (3). pp. 650-661. ISSN 0022-3239

Alpern, Steven and Fokkink, Robbert and Lidbetter, Tom 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. ISSN 1742-5689

2011

Alpern, Steven and Fokkink, Robbert and Timmer, Marco and Casas, Jerome (2011) Ambush frequency should increase over time during optimal predator search for prey. Journal of The Royal Society interface, 8 (64). pp. 1665-1672. ISSN 1742-5689

Alpern, Steven (2011) Find-and-fetch search on a tree. Operations research, 59 (5). pp. 1258-1268. ISSN 0030-364X

Alpern, Steven and Morton, Alec and Papadaki, Katerina (2011) Patrolling games. Operations research, 59 (5). pp. 1246-1257. ISSN 0030-364X

2010

Alpern, Steven and Fokkink, Robbert and Op Den Kelder, Joram and Lidbetter, Tom (2010) Disperse or unite? A mathematical model of coordinated attack. Lecture notes in computer science, 6442 pp. 220-233. ISSN 0302-9743

Alpern, Steven and Fokkink, Robbert and Kikuta, Ken (2010) On ruckle's conjecture on accumulation games. SIAM journal on control and optimization, 48 (8). pp. 5073-5083. ISSN 0363-0129

Alpern, Steven (2010) Search games on trees with asymmetric travel times. SIAM journal on control and optimization, 48 (8). pp. 5547-5563. ISSN 0363-0129

Alpern, Steven (2010) Rendezvous games (non-antagonistic search games). In: Cochran, James J., (ed.) Wiley encyclopedia of operations research and management science. Wiley, Toronto, Canada. ISBN 9780470400630

Alpern, Steve and Gal, Shmuel and Solan, Eilon (2010) A sequential selection game with vetoes. Games and economic behavior, 68 (1). pp. 1-14. ISSN 0899-8256

2009

Alpern, Steven and Morton, Alec and Papadaki, Katerina (2009) Optimizing randomized patrols. Operational Research working papers, LSEOR 09.116. Operational Research Group, London School of Economics and Political Science, London, UK

Alpern, Steve and Gal, Shmuel (2009) Analysis and design of selection committees: a game theoretic secretary problem. International journal of game theory, 38 (3). pp. 377-394. ISSN 0020-7276

Alpern, Steve and Fokkink, Robbert (2009) How to hide information for later use on networks. In:.

Alpern, Steve and Baston, Vic and Gal, Shmuel (2009) Searching symmetric networks with Utilitarian-Postman paths. Networks, 53 (4). pp. 392-402. ISSN 1097-0037

2008

Alpern, Steven (2008) Line-of-sight rendezvous. European journal of operational research, 188 (3). pp. 865-883. ISSN 0377-2217

Alpern, Steven and Prasad, V. S. (2008) MultiTowers, conjugacies and codes: three theorems in ergodic theory, one variation on Rokhlin's Lemma. Proceedings of the American Mathematical Society, 136 (12). pp. 4373-4383. ISSN 0002-9939

Alpern, Steven and 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. ISSN 0020-7276

Alpern, Steven and Katrantzi, Ioanna (2008) Equilibria of two-sided matching games with common preferences. European journal of operational research, 196 (3). pp. 1214-1222. ISSN 0377-2217

Alpern, Steven and Fokkink, Robbert and Lindelauf, Roy and Olsder, Geert-Jan (2008) The “Princess and Monster” game on an interval. SIAM journal on control and optimization, 47 (3). pp. 1178-1190. ISSN 0363-0129

Alpern, Steven and Prasad, V. S. (2008) Rotational (and other) representations of stochastic matrices. Stochastic analysis and applications, 26 (1). pp. 1-15. ISSN 0736-2994

Alpern, Steven (2008) Hide-and-seek games on a tree to which Eulerian networks are attached. Networks, 52 (3). pp. 162-166. ISSN 0028-3045

2007

Alpern, Steve (2007) Rendezvous search with revealed information: applications to the line. Journal of applied probability, 44 (1). pp. 1-15. ISSN 0021-9002

Alpern, Steve and Katrantzi, Ioanna (2007) Equilbria of two-sided matching games. London school of economics and political science, London, UK

2006

Alpern, Steven and Baston, Vic (2006) A common notion of clockwise can help in planar rendezvous. European journal of operational research, 175 (2). pp. 688-706. ISSN 0377-2217

Alpern, Steven and Fokkink, Robbert and Lindelauf, Roy and Olsder, Geert Jan (2006) Numerical approaches to the 'princess and monster' game on the interval. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Fokkink, Robbert and Lindelauf, Roy and Olsder, Geert Jan (2006) The 'princess and monster' game on an interval. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Gal, Shmuel (2006) Two conjectures on rendezvous in K3. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Baston, Vic and Gal, Shmuel (2006) Searching symmetric networks with Utilitarian Postman paths. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Baston, Vic and Gal, Schmuel (2006) Network search games with immobile hider, without a designated searcher starting point. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Baston, Vic (2006) Rendezvous in higher dimensions. SIAM journal on control and optimization, 44 (6). pp. 2233-2252. ISSN 0363-0129

2005

Alpern, Steven and Prasad, V. (2005) Towers, conjugacy and coding. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven (2005) How to search a tree to which Eulerian networks are attached. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Prasad, V. S. (2005) Rotational (and other) representations of stochastic matrices. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Katrantzi, Ioanna and Reyniers, Diane J. (2005) Mathematical models of mutual mate choice. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Reyniers, Diane J. (2005) Strategic mating with common preferences. Journal of theoretical biology, 237 (4). pp. 337-354. ISSN 0022-5193

Alpern, Steven and Baston, Vic (2005) Rendezvous on a planar lattice. Operations research, 53 (6). pp. 996-1006. ISSN 0030-364X

2004

Alpern, Steven and Baston, Vic (2004) Rendezvous on a planar lattice. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven (2004) Bilateral street searching in Manhattan (line-of-sight rendezvous on a planar lattice). Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Baston, Vic (2004) Rendezvous in higher dimensions. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Reyniers, Diane J. (2004) Strategic mating with common preferences. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

Alpern, Steven and Baston, Vic (2004) A common notion of clockwise can help in planar rendezvous. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK

2003

Alpern, Steven and Gal, Shmuel (2003) The Theory of Search Games and Rendezvous. Springer. ISBN 0792374681

2002

Alpern, Steven and Prasad, V. S. (2002) Properties generic for Lebesgue space automorphisms are generic for measure-preserving manifold homeomorphisms. Ergodic theory & dynamical systems, 22 (6). pp. 1587-1620. ISSN 0143-3857

Alpern, Steven (2002) Rendezvous search: a personal perspective. Operations research, 50 (5). pp. 772-795. ISSN 0030-364X

Alpern, Steven and Reyniers, Diane J. (2002) Spatial dispersion as a dynamic coordination problem. Theory and decision, 53 (1). pp. 29-59. ISSN 0040-5833

Alpern, Steven and Shi Lim, Wei (2002) Rendezvous of three agents on the line. Naval research logistics, 49 (3). pp. 244-255. ISSN 0894-069X

Alpern, Steven and Gal, Shmuel (2002) Searching for an agent who may or may not want to be found. Operations research, 50 (2). pp. 311-323. ISSN 0030-364X

2001

Alpern, Steven and Reyniers, Diane J. (2001) Games of crowding. International game theory review, 3 (1). pp. 27-56. ISSN 0219-1989

Alpern, Steven and Prasad, Vidhu (2001) Typical dynamics of volume-preserving homeomorphisms. Cambridge University Press, Cambridge. ISBN 9780521582872

2000

Alpern, Steven and Howard, John V. (2000) Alternating search at two locations. Dynamics and control, 10 (4). pp. 319-339. ISSN 0925-4668

Alpern, Steven and Prasad, V. S. (2000) Maximally chaotic homeomorphisms of sigma-compact manifolds. Topology and its applications, 105 (1). pp. 103-112. ISSN 0166-8641

Alpern, Steven and Beck, Anatole (2000) Pure strategy asymmetric rendezvous on the line with an unknown initial distance. Operations research, 48 (3). pp. 498-501. ISSN 0030-364X

Alpern, Steven (2000) Asymmetric rendezvous search on the circle. Dynamics and control, 10 (1). pp. 33-45. ISSN 0925-4668

1999

Alpern, Steven and Howard, John V. (1999) Alternating search at two locations. Operational Research working papers, LSEOR 99.30. Department of Operational Research, London School of Economics and Political Science, London, UK

Alpern, Steven (1999) Combinatorial approximation by Devaney-chaotic or periodic volume preserving homeomorphisms. International journal of bifurcation and chaos, 9 (5). pp. 843-848. ISSN 0218-1274

Alpern, Steven and Prasad, V. S. (1999) Chaotic homeomorphisms of RN, lifted from torus homeomorphisms. Bulletin of the London mathematical society, 31 (5). pp. 577-580. ISSN 0024-6093

Alpern, Steven and Beck, A. (1999) Asymmetric rendezvous on the line is a double linear search problem. Mathematics of operations research, 24 (3). pp. 604-618. ISSN 0364-765X

Alpern, Steven and Beck, A. (1999) Rendezvous search on the line with limited resources: maximizing the probability of meeting. Operations research, 47 (6). pp. 849-861. ISSN 0030-364X

Alpern, Steven and Baston, V. and Essegaier, S. (1999) Rendezvous search on a graph. Journal of applied probability, 36 (1). pp. 223-231. ISSN 0021-9002

Alpern, Steven and Reyniers, D. (1999) Strategic mating with homotypic preferences. Journal of theoretical biology, 198 (1). pp. 71-88. ISSN 0022-5193

Alpern, Steven and Pikounis, Michael The telephone coordination game. In: Game theory and applications. . ISBN 9781560728221

Alpern, Steve and Fokkink, Robbert and Lindelauf, Roy and Olsder, Geert Jan A numerical approach to the ‘Princess and Monster’ game on an interval. In: Annals of the International Society of Dynamic Games. , pp. 149-157. ISBN 9780817648336

LSE Research Online is the primary resource for references to publications. For queries or updates please email the LSE Research Online team at lseresearchonline@lse.ac.uk|.

Expert Image

 

Browse the Experts Directory:

LSE Research Online|

Collection of LSE research outputs

LSE Consulting|

Service providing unique access
to LSE's expertise

Create or update your
online profile
|

[access restricted to staff]

Research highlights|

Short articles about LSE research