Items where Author is "Alpern, Steven"

Number of items: 60.
  • Alternating search at two locations. Alpern, Steven and Howard, John V.
  • Alternating search at two locations. Alpern, Steven and Howard, J. V.
  • Ambush frequency should increase over time during optimal predator search for prey. Alpern, Steven and Fokkink, Robbert and Timmer, Marco and Casas, Jerome
  • Asymmetric rendezvous on the line is a double linear search problem. Alpern, Steven and Beck, A.
  • Asymmetric rendezvous search on the circle. Alpern, Steven
  • Bilateral street searching in Manhattan (line-of-sight rendezvous on a planar lattice). Alpern, Steven
  • Chaotic homeomorphisms of RN, lifted from torus homeomorphisms. Alpern, Steven and Prasad, V. S.
  • Combinatorial approximation by Devaney-chaotic or periodic volume preserving homeomorphisms. Alpern, Steven
  • Disperse or unite? A mathematical model of coordinated attack. Alpern, Steven and Fokkink, Robbert and Op Den Kelder, Joram and Lidbetter, Thomas
  • Disperse or unite? A mathematical model of coordinated attack. Decision and game theory for security. Alpern, Steven and Fokkink, Robbert and Op Den Kelder, Joram and Lidbetter, Thomas
  • Equilibria of two-sided matching games with common preferences. Alpern, Steven and Katrantzi, Ioanna
  • Find-and-fetch search on a tree. Alpern, Steven
  • Games of crowding. Alpern, Steven and Reyniers, Diane J.
  • Hide-and-seek games on a tree to which Eulerian networks are attached. Alpern, Steven
  • How to search a tree to which Eulerian networks are attached. Alpern, Steven
  • Line-of-sight rendezvous. Alpern, Steven
  • Mathematical models of mutual mate choice. Alpern, Steven and Katrantzi, Ioanna and Reyniers, Diane J.
  • Maximally chaotic homeomorphisms of sigma-compact manifolds. Alpern, Steven and Prasad, V. S.
  • MultiTowers, conjugacies and codes: three theorems in ergodic theory, one variation on Rokhlin's Lemma. Alpern, Steven and Prasad, V. S.
  • Network search games with immobile hider, without a designated searcher starting point. Alpern, Steven and Baston, Vic and Gal, Shmuel
  • Network search games with immobile hider, without a designated searcher starting point. Alpern, Steven and Baston, Vic and Gal, Schmuel
  • Numerical approaches to the 'princess and monster' game on the interval. Alpern, Steven and Fokkink, Robbert and Lindelauf, Roy and Olsder, Geert Jan
  • On ruckle's conjecture on accumulation games. Alpern, Steven and Fokkink, Robbert and Kikuta, Ken
  • Optimal trade-off between speed and acuity when searching for a small object. Alpern, Steven and Lidbetter, Thomas
  • Optimizing randomized patrols. Alpern, Steven and Morton, Alec and Papadaki, Katerina
  • Patrolling a pipeline. Alpern, Steven and Lidbetter, Thomas and Morton, Alec and Papadaki, Katerina
  • Patrolling games. Alpern, Steven and Morton, Alec and Papadaki, Katerina
  • The “Princess and Monster” game on an interval. Alpern, Steven and Fokkink, Robbert and Lindelauf, Roy and Olsder, Geert-Jan
  • Properties generic for Lebesgue space automorphisms are generic for measure-preserving manifold homeomorphisms. Alpern, Steven and Prasad, V. S.
  • Pure strategy asymmetric rendezvous on the line with an unknown initial distance. Alpern, Steven and Beck, Anatole
  • Rendezvous games (non-antagonistic search games). Alpern, Steven
  • Rendezvous in higher dimensions. Alpern, Steven and Baston, Vic
  • Rendezvous in higher dimensions. Alpern, Steven and Baston, Vic
  • Rendezvous of three agents on the line. Alpern, Steven and Shi Lim, Wei
  • Rendezvous on a planar lattice. Alpern, Steven and Baston, Vic
  • Rendezvous on a planar lattice. Alpern, Steven and Baston, Vic
  • Rendezvous search on a graph. Alpern, Steven and Baston, V. and Essegaier, S.
  • Rendezvous search on the line with limited resources: maximizing the probability of meeting. Alpern, Steven and Beck, A.
  • Rendezvous search: a personal perspective. Alpern, Steven
  • Rotational (and other) representations of stochastic matrices. Alpern, Steven and Prasad, V. S.
  • Rotational (and other) representations of stochastic matrices. Alpern, Steven and Prasad, V. S.
  • Search games on trees with asymmetric travel times. Alpern, Steven
  • Searching for an agent who may or may not want to be found. Alpern, Steven and Gal, Shmuel
  • Searching symmetric networks with Utilitarian Postman paths. Alpern, Steven and Baston, Vic and Gal, Shmuel
  • Spatial dispersion as a dynamic coordination problem. Alpern, Steven and Reyniers, Diane J.
  • Strategic mating with common preferences. Alpern, Steven and Reyniers, Diane J.
  • Strategic mating with common preferences. Alpern, Steven and Reyniers, Diane J.
  • Strategic mating with homotypic preferences. Alpern, Steven and Reyniers, D.
  • The Theory of Search Games and Rendezvous. Alpern, Steven and Gal, Shmuel
  • Towers, conjugacy and coding. Alpern, Steven and Prasad, V.
  • Two conjectures on rendezvous in K3. Alpern, Steven and Gal, Shmuel
  • Typical dynamics of volume-preserving homeomorphisms. Alpern, Steven and Prasad, Vidhu
  • A common notion of clockwise can help in planar rendezvous. Alpern, Steven and Baston, Vic
  • A common notion of clockwise can help in planar rendezvous. Alpern, Steven and Baston, Vic
  • A new approach to Gal’s theory of search games on weakly eulerian networks. Alpern, Steven
  • The 'princess and monster' game on an interval. Alpern, Steven and Fokkink, Robbert and Lindelauf, Roy and Olsder, Geert Jan
  • A proof of the Kikuta–Ruckle Conjecture on cyclic caching of resources. Alpern, Steven and Fokkink, Robbert and Pelekis, Christos
  • A search game model of the scatter hoarder's problem. Alpern, Steven and Fokkink, Robbert and Lidbetter, Thomas and Clayton, Nicola S.
  • The telephone coordination game. Alpern, Steven and Pikounis, Michael
  • A tribute to Anatole Beck (1930-2014). Alpern, Steven and Binmore, Ken