Up a level |

Group by: Item Type | No Grouping

Number of items: **60**.

Alpern, Steven and Binmore, Ken
(2016)
*A tribute to Anatole Beck (1930-2014).*
*Maths@LSE Blog*
(28 Jan 2016).
Blog Entry.

Alpern, Steven, Lidbetter, Thomas, Morton, Alec and Papadaki, Katerina
(2016)
*Patrolling a pipeline.*
In: Quanyan, Zhu, Alpcan, Tansu, Panaousis, Emmanouil, Tambe, Milind and Casey, William, (eds.)
Decision and Game Theory for Security: 7th International Conference, GameSec 2016, New York, NY, USA, November 2-4, 2016, Proceedings.
Lecture Notes in Computer Science.
Springer International Publishing, London, UK, pp. 129-138.
ISBN 9783319474120

Alpern, Steven and Lidbetter, Thomas
(2015)
*Optimal trade-off between speed and acuity when searching for a small object.*
Operations Research, 63 (1).
pp. 122-133.
ISSN 0030-364X

Alpern, Steven, 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, Fokkink, Robbert, Lidbetter, Thomas and Clayton, Nicola 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

Alpern, Steven, Fokkink, Robbert, 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, Morton, Alec and Papadaki, Katerina
(2011)
*Patrolling games.*
Operations Research, 59 (5).
pp. 1246-1257.
ISSN 0030-364X

Alpern, Steven
(2011)
*A new approach to Gal’s theory of search games on weakly eulerian networks.*
Dynamic Games and Applications, 1 (2).
pp. 209-219.
ISSN 2153-0785

Alpern, Steven, Fokkink, Robbert, Op Den Kelder, Joram and Lidbetter, Thomas
(2010)
*Disperse or unite? A mathematical model of coordinated attack. Decision and game theory for security.*
In: First International Conference, GameSec 2010, 2010-11-22 - 2010-11-23.

Alpern, Steven, Fokkink, Robbert, Op Den Kelder, Joram and Lidbetter, Thomas
(2010)
*Disperse or unite? A mathematical model of coordinated attack.*
Lecture Notes in Computer Science, 6442.
pp. 220-233.
ISSN 0302-9743

Alpern, Steven, 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)
*Rendezvous games (non-antagonistic search games).*
In: Cochran, James J., (ed.)
Wiley Encyclopedia of Operations Research and Management Science.
Wiley, Toronto, Canada, p. 30.
ISBN 9780470400630

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, 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.
(Submitted)

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, 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, Fokkink, Robbert, 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
(2008)
*Hide-and-seek games on a tree to which Eulerian networks are attached.*
Networks, 52 (3).
pp. 162-166.
ISSN 0028-3045

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 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, Fokkink, Robbert, Lindelauf, Roy and Olsder, Geert Jan
(2006)
*Numerical approaches to the 'princess and monster' game on the interval.*
CDAM research report series (LSE-CDAM-2006-18).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy and Olsder, Geert Jan
(2006)
*The 'princess and monster' game on an interval.*
CDAM research report series (LSE-CDAM-2006-17).
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.*
CDAM research report series (LSE-CDAM-2006-21).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven, Baston, Vic and Gal, Shmuel
(2006)
*Searching symmetric networks with Utilitarian Postman paths.*
CDAM research report series (LSE-CDAM-2006-05).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven, Baston, Vic and Gal, Schmuel
(2006)
*Network search games with immobile hider, without a designated searcher starting point.*
CDAM research report series (LSE-CDAM-2006-03).
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

Alpern, Steven and Prasad, V.
(2005)
*Towers, conjugacy and coding.*
CDAM research report series (CDAM-LSE-2005-21).
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.*
CDAM research report (CDAM-LSE- 2005-14).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven, Katrantzi, Ioanna and Reyniers, Diane J.
(2005)
*Mathematical models of mutual mate choice.*
CDAM research report (CDAM-LSE-2005-20).
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.*
CDAM research report series (CDAM-LSE-2005-13).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

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

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
(2004)
*Bilateral street searching in Manhattan (line-of-sight rendezvous on a planar lattice).*
CDAM Research Report Series (LSE-CDAM-2004-09).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

Alpern, Steven and Baston, Vic
(2004)
*Rendezvous on a planar lattice.*
CDAM research report series (LSE-CDAM-2004-08).
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.*
CDAM Research Report Series (LSE-CDAM-2004-06).
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.*
CDAM research report series (LSE-CDAM-2004-05).
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.*
CDAM research report series (LSE-CDAM-2004-07).
Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.

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

Alpern, Steven and Prasad, V. S.
(2002)
*Properties generic for Lebesgue space automorphisms are generic for measure-preserving manifold homeomorphisms.*
Ergodic Theory and 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
(Submitted)

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

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 tracts in mathematics.
(139).
Cambridge University Press, Cambridge.
ISBN 9780521582872

Alpern, Steven and Howard, J. 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

Alpern, Steven and Pikounis, Michael
(2000)
*The telephone coordination game.*
In: Petrosjan, L. A. and Mazalov, V. V., (eds.)
Game Theory and Applications.
Nova Science Publishers Incorporated, Huntington, New York, USA.
ISBN 9781560728221

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 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 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
(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, 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 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 Reyniers, D.
(1999)
*Strategic mating with homotypic preferences.*
Journal of Theoretical Biology, 198 (1).
pp. 71-88.
ISSN 0022-5193