LSE creators

Number of items: 74.
LSE
  • Alpern, Steven, Fokkink, Robbert, Pelekis, Christos (2012). A proof of the Kikuta–Ruckle Conjecture on cyclic caching of resources. Journal of Optimization Theory and Applications, 153(3), 650-661. https://doi.org/10.1007/s10957-011-9977-1
  • Alpern, Steve, Fokkink, Robbert, Lindelauf, Roy, Olsder, Geert Jan (2009). A numerical approach to the ‘Princess and Monster’ game on an interval. In Bernhard, Pierre, Gaitsgory, Vladimir, Pourtallier, Odile (Eds.), Advances in Dynamic Games and Their Applications (pp. 149-157). Birkhaeuser Verlag AG. https://doi.org/10.1007/978-0-8176-4834-3_9
    • LSE Health
  • Alpern, Steven, Morton, Alec, Papadaki, Katerina (2011). Patrolling games. Operations Research, 59(5), 1246-1257. https://doi.org/10.1287/opre.1110.0983
    • Management
  • Alpern, Steve, Howard, J. V. (2019). A short solution to the many-player silent duel with arbitrary consolation prize. European Journal of Operational Research, 273(2), 646-649. https://doi.org/10.1016/j.ejor.2018.08.040
  • Alpern, Steven, Lidbetter, Thomas, Morton, Alec, Papadaki, Katerina (2016). Patrolling a pipeline. In Quanyan, Zhu, Alpcan, Tansu, Panaousis, Emmanouil, Tambe, Milind, Casey, William (Eds.), Decision and Game Theory for Security: 7th International Conference, GameSec 2016, New York, NY, USA, November 2-4, 2016, Proceedings (pp. 129-138). Springer International (Firm). https://doi.org/10.1007/978-3-319-47413-7_8
  • Alpern, Steven, Lidbetter, Thomas (2015). Optimal trade-off between speed and acuity when searching for a small object. Operations Research, 63(1), 122-133. https://doi.org/10.1287/opre.2014.1331
  • Alpern, Steven, Morton, Alec, Papadaki, Katerina (2011). Patrolling games. Operations Research, 59(5), 1246-1257. https://doi.org/10.1287/opre.1110.0983
  • Alpern, Steven, Fokkink, Robbert, Op Den Kelder, Joram, Lidbetter, Thomas (2010-11-22 - 2010-11-23) Disperse or unite? A mathematical model of coordinated attack. Decision and game theory for security [Paper]. First International Conference, GameSec 2010, Berlin, Germany, DEU.
  • Alpern, Steven, Morton, Alec, Papadaki, Katerina (2009). Optimizing randomized patrols. (Operational Research working papers LSEOR 09.116). Operational Research Group, London School of Economics and Political Science.
  • Alpern, Steven, Katrantzi, Ioanna (2008). Equilibria of two-sided matching games with common preferences. European Journal of Operational Research, 196(3), 1214-1222. https://doi.org/10.1016/j.ejor.2008.05.012
  • Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy, 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.
  • Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, Baston, Vic, 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.
  • Alpern, Steven, Baston, Vic, 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.
  • Alpern, Steven, 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.
  • 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.
  • Alpern, Steven, Katrantzi, Ioanna, 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.
  • Alpern, Steven, 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.
  • 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, Prasad, V. S. (2002). Properties generic for Lebesgue space automorphisms are generic for measure-preserving manifold homeomorphisms. Ergodic Theory and Dynamical Systems, 22(6), 1587-1620. https://doi.org/10.1017/S0143385702001281
  • Alpern, Steven (2002). Rendezvous search: a personal perspective. Operations Research, 50(5), 772-795. https://doi.org/10.1287/opre.50.5.772.363
  • Alpern, Steven, Reyniers, Diane J. (2002). Spatial dispersion as a dynamic coordination problem. Theory and Decision, 53(1), 29-59. https://doi.org/10.1023/A:1020891631738
  • Alpern, Steven, Shi Lim, Wei (2002). Rendezvous of three agents on the line. Naval Research Logistics, 49(3), 244-255. https://doi.org/10.1002/nav.10005
  • Alpern, Steven, Gal, Shmuel (2002). Searching for an agent who may or may not want to be found. Operations Research, 50(2), 311-323. https://doi.org/10.1287/opre.50.2.311.433
  • Alpern, Steven, Reyniers, Diane J. (2001). Games of crowding. International Game Theory Review, 3(1), 27-56.
  • Alpern, Steven, Howard, J. V. (2000). Alternating search at two locations. Dynamics and Control, 10(4), 319-339. https://doi.org/10.1023/A:1011245715521
  • Alpern, Steven, Prasad, V. S. (2000). Maximally chaotic homeomorphisms of sigma-compact manifolds. Topology and its Applications, 105(1), 103-112. https://doi.org/10.1016/S0166-8641(99)00051-6
  • Alpern, Steven, Beck, Anatole (2000). Pure strategy asymmetric rendezvous on the line with an unknown initial distance. Operations Research, 48(3), 498-501. https://doi.org/10.1287/opre.48.3.498.12432
  • Alpern, Steven (2000). Asymmetric rendezvous search on the circle. Dynamics and Control, 10(1), 33-45. https://doi.org/10.1023/A:1008339811950
  • Alpern, Steven, 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.
    • Mathematics
  • Alpern, Steve, Bui, Thuy, Lidbetter, Thomas, Papadaki, Katerina (2022). Continuous patrolling games. Operations Research, 70(6), 3076 - 3089. https://doi.org/10.1287/opre.2022.2346 picture_as_pdf
  • Alpern, Steve, Chen, Bo, Ostaszewski, Adam (2021). A functional equation of tail-balance for continuous signals in the Condorcet jury theorem. Aequationes Mathematicae, 95(1), 67 - 74. https://doi.org/10.1007/s00010-020-00750-1 picture_as_pdf
  • Alpern, Steve, Howard, J. V. (2019). A short solution to the many-player silent duel with arbitrary consolation prize. European Journal of Operational Research, 273(2), 646-649. https://doi.org/10.1016/j.ejor.2018.08.040
  • Alpern, Steve, Lidbetter, Thomas, Papadaki, Katerina (2018). Optimizing periodic patrols against short attacks on the line and other networks. European Journal of Operational Research, https://doi.org/10.1016/j.ejor.2018.08.050
  • Papadaki, Katerina, Alpern, Steve, Lidbetter, Thomas, Morton, Alec (2016). Patrolling a border. Operations Research, 64(4), 1256-1269. https://doi.org/10.1287/opre.2016.1511
  • Alpern, Steven, Binmore, Ken (2016). A tribute to Anatole Beck (1930-2014).
  • Alpern, Steve, Lidbetter, Thomas (2014). Searching a variable speed network. Mathematics of Operations Research, 39(3), 697-711. https://doi.org/10.1287/moor.2013.0634
  • Alpern, Steve, Lidbetter, Thomas (2013). Mining coal or finding terrorists: the expanding search paradigm. Operations Research, 61(2), 265-279. https://doi.org/10.1287/opre.1120.1134
  • Alpern, Steven, Fokkink, Robbert, Lidbetter, Thomas, Clayton, Nicola S. (2012). A search game model of the scatter hoarder's problem. Journal of the Royal Society Interface, 9(70), 869-879. https://doi.org/10.1098/rsif.2011.0581
  • Alpern, Steven, Fokkink, Robbert, Timmer, Marco, Casas, Jerome (2011). Ambush frequency should increase over time during optimal predator search for prey. Journal of the Royal Society Interface, 8(64), 1665-1672. https://doi.org/10.1098/rsif.2011.0154
  • Alpern, Steven (2011). Find-and-fetch search on a tree. Operations Research, 59(5), 1258-1268. https://doi.org/10.1287/opre.1110.0966
  • Alpern, Steven, Morton, Alec, Papadaki, Katerina (2011). Patrolling games. Operations Research, 59(5), 1246-1257. https://doi.org/10.1287/opre.1110.0983
  • Alpern, Steven (2011). A new approach to Gal’s theory of search games on weakly eulerian networks. Dynamic Games and Applications, 1(2), 209-219. https://doi.org/10.1007/s13235-011-0009-4
  • Alpern, Steven, Fokkink, Robbert, Op Den Kelder, Joram, Lidbetter, Thomas (2010). Disperse or unite? A mathematical model of coordinated attack. Lecture Notes in Computer Science, 6442, 220-233. https://doi.org/10.1007/978-3-642-17197-0_15
  • Alpern, Steven, Fokkink, Robbert, Kikuta, Ken (2010). On ruckle's conjecture on accumulation games. SIAM Journal on Control and Optimization, 48(8), 5073-5083. https://doi.org/10.1137/080741926
  • Alpern, Steven (2010). Rendezvous games (non-antagonistic search games). In Cochran, James J. (Ed.), Wiley Encyclopedia of Operations Research and Management Science (pp. p. 30). John Wiley & Sons.
  • Alpern, Steven (2010). Search games on trees with asymmetric travel times. SIAM Journal on Control and Optimization, 48(8), 5547-5563. https://doi.org/10.1137/090781115
  • Alpern, Steve, Gal, Shmuel, Solan, Eilon (2010). A sequential selection game with vetoes. Games and Economic Behavior, 68(1), 1-14. https://doi.org/10.1016/j.geb.2009.05.006
  • Alpern, Steve, Gal, Shmuel (2009). Analysis and design of selection committees: a game theoretic secretary problem. International Journal of Game Theory, 38(3), 377-394. https://doi.org/10.1007/s00182-009-0159-4
  • Alpern, Steve, Fokkink, Robbert (2009-01-01) How to hide information for later use on networks [Paper]. Game Theory for Networks (GameNets 2009).
  • Alpern, Steve, Baston, Vic, Gal, Shmuel (2009). Searching symmetric networks with Utilitarian-Postman paths. Networks, 53(4), 392-402. https://doi.org/10.1002/net.20314
  • Alpern, Steven (2008). Line-of-sight rendezvous. European Journal of Operational Research, 188(3), 865-883. https://doi.org/10.1016/j.ejor.2007.03.043
  • Alpern, Steven, 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), 4373-4383. https://doi.org/10.1090/S0002-9939-08-09520-8
  • Alpern, Steven, Baston, Vic, Gal, Shmuel (2008). Network search games with immobile hider, without a designated searcher starting point. International Journal of Game Theory, 37(2), 281-302. https://doi.org/10.1007/s00182-008-0116-7
  • Alpern, Steven, Katrantzi, Ioanna (2008). Equilibria of two-sided matching games with common preferences. European Journal of Operational Research, 196(3), 1214-1222. https://doi.org/10.1016/j.ejor.2008.05.012
  • Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy, Olsder, Geert-Jan (2008). The “Princess and Monster” game on an interval. SIAM Journal on Control and Optimization, 47(3), 1178-1190. https://doi.org/10.1137/060672054
  • Alpern, Steven (2008). Hide-and-seek games on a tree to which Eulerian networks are attached. Networks, 52(3), 162-166. https://doi.org/10.1002/net.20235
  • Alpern, Steven, Prasad, V. S. (2008). Rotational (and other) representations of stochastic matrices. Stochastic Analysis and Applications, 26(1), 1-15. https://doi.org/10.1080/07362990701670209
  • Alpern, Steve (2007). Rendezvous search with revealed information: applications to the line. Journal of Applied Probability, 44(1), 1-15. https://doi.org/10.1239/jap/1175267160
  • Alpern, Steve, Katrantzi, Ioanna (2007). Equilbria of two-sided matching games. London School of Economics and Political Science.
  • Alpern, Steven, Baston, Vic (2006). A common notion of clockwise can help in planar rendezvous. European Journal of Operational Research, 175(2), 688-706. https://doi.org/10.1016/j.ejor.2005.03.050
  • Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy, 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.
  • Alpern, Steven, Fokkink, Robbert, Lindelauf, Roy, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, Baston, Vic, 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.
  • Alpern, Steven, Baston, Vic (2006). Rendezvous in higher dimensions. SIAM Journal on Control and Optimization, 44(6), 2233 - 2252. https://doi.org/10.1137/S0363012904443531
  • Alpern, Steven, Baston, Vic, 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.
  • Alpern, Steven, Baston, Vic (2005). Rendezvous on a planar lattice. Operations Research, 53(6), 996 - 1006. https://doi.org/10.1287/opre.1050.0217
  • Alpern, Steven, 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.
  • 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.
  • Alpern, Steven, Katrantzi, Ioanna, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, Reyniers, Diane J. (2005). Strategic mating with common preferences. Journal of Theoretical Biology, 237(4), 337-354. https://doi.org/10.1016/j.jtbi.2003.09.021
  • 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, 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.
  • Alpern, Steven, Gal, Shmuel (2003). The Theory of Search Games and Rendezvous. Springer Berlin / Heidelberg.
  • Alpern, Steven, Prasad, V. S. (2002). Properties generic for Lebesgue space automorphisms are generic for measure-preserving manifold homeomorphisms. Ergodic Theory and Dynamical Systems, 22(6), 1587-1620. https://doi.org/10.1017/S0143385702001281
  • Alpern, Steven (2002). Rendezvous search: a personal perspective. Operations Research, 50(5), 772-795. https://doi.org/10.1287/opre.50.5.772.363
  • Alpern, Steven, Reyniers, Diane J. (2002). Spatial dispersion as a dynamic coordination problem. Theory and Decision, 53(1), 29-59. https://doi.org/10.1023/A:1020891631738
  • Alpern, Steven, Shi Lim, Wei (2002). Rendezvous of three agents on the line. Naval Research Logistics, 49(3), 244-255. https://doi.org/10.1002/nav.10005
  • Alpern, Steven, Gal, Shmuel (2002). Searching for an agent who may or may not want to be found. Operations Research, 50(2), 311-323. https://doi.org/10.1287/opre.50.2.311.433
  • Alpern, Steven, Reyniers, Diane J. (2001). Games of crowding. International Game Theory Review, 3(1), 27-56.
  • Alpern, Steven, Prasad, Vidhu (2001). Typical dynamics of volume-preserving homeomorphisms. Cambridge University Press.
  • Alpern, Steven, Howard, J. V. (2000). Alternating search at two locations. Dynamics and Control, 10(4), 319-339. https://doi.org/10.1023/A:1011245715521
  • Alpern, Steven, Prasad, V. S. (2000). Maximally chaotic homeomorphisms of sigma-compact manifolds. Topology and its Applications, 105(1), 103-112. https://doi.org/10.1016/S0166-8641(99)00051-6
  • Alpern, Steven, Beck, Anatole (2000). Pure strategy asymmetric rendezvous on the line with an unknown initial distance. Operations Research, 48(3), 498-501. https://doi.org/10.1287/opre.48.3.498.12432
  • Alpern, Steven (2000). Asymmetric rendezvous search on the circle. Dynamics and Control, 10(1), 33-45. https://doi.org/10.1023/A:1008339811950
  • Alpern, Steven, Pikounis, Michael (2000). The telephone coordination game. In Petrosjan, L. A., Mazalov, V. V. (Eds.), Game Theory and Applications . Nova Science Publishers.
  • Alpern, Steven, 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.
  • Alpern, Steven, Beck, A. (1999). Asymmetric rendezvous on the line is a double linear search problem. Mathematics of Operations Research, 24(3), 604-618. https://doi.org/10.1287/moor.24.3.604
  • Alpern, Steven, Prasad, V. S. (1999). Chaotic homeomorphisms of RN, lifted from torus homeomorphisms. Bulletin of the London Mathematical Society, 31(5), 577-580. https://doi.org/10.1112/S002460939800561X
  • Alpern, Steven (1999). Combinatorial approximation by Devaney-chaotic or periodic volume preserving homeomorphisms. International Journal of Bifurcation and Chaos, 9(5), 843-848. https://doi.org/10.1142/S0218127499000596
  • Alpern, Steven, Baston, V., Essegaier, S. (1999). Rendezvous search on a graph. Journal of Applied Probability, 36(1), 223-231.
  • Alpern, Steven, Beck, A. (1999). Rendezvous search on the line with limited resources: maximizing the probability of meeting. Operations Research, 47(6), 849-861. https://doi.org/10.1287/opre.47.6.849
  • Alpern, Steven, Reyniers, D. (1999). Strategic mating with homotypic preferences. Journal of Theoretical Biology, 198(1), 71-88. https://doi.org/10.1006/jtbi.1999.0903
    • Statistics
  • Alpern, Steven, Howard, J. V. (2000). Alternating search at two locations. Dynamics and Control, 10(4), 319-339. https://doi.org/10.1023/A:1011245715521