Steve Alpern

Q: What Schools Are Affiliated With Steve Alpern

Steve Alpern is affiliated with the following schools: University of Warwick, London School of Economics, Princeton University, New York University

Steve Alpern's AcademicInfluence.com Rankings

Steve Alpern

Mathematics

#4109

World Rank

#5907

Historical Rank

#1453

USA Rank

Measure Theory

#3100

World Rank

#3677

Historical Rank

#902

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Steve Alpern Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Steve Alpern is a professor of Operational Research at the University of Warwick, where he recently moved after working for many years at the London School of Economics. His early work was mainly in the area of dynamical systems and ergodic theory, but his more recent research has been concentrated in the fields of search games and rendezvous. He informally introduced the rendezvous problem as early as 1976. His collaborators include Shmuel Gal, Vic Baston and Robbert Fokkink.

(See a Problem?)

Steve Alpern's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The theory of search games and rendezvous (2002) (561)
The Rendezvous Search Problem (1995) (193)
Patrolling Games (2011) (110)
Rendezvous Search: A Personal Perspective (2002) (75)
Rendezvous search on a graph (1999) (75)
Minimax Rendezvous on the Line (1996) (66)
Rendezvous Search on the Line With Distinguishable Players (1995) (66)
Mining Coal or Finding Terrorists: The Expanding Search Paradigm (2013) (60)
Rendezvous search on labeled networks (2002) (58)
Strategic mating with common preferences. (2005) (53)
Search Theory: A Game Theoretic Perspective (2013) (46)
Generic properties of measure preserving homeomorphisms (1979) (38)
Return times and conjugates of an antiperiodic transformation (1981) (38)
Spatial Dispersion as a Dynamic Coordination Problem (2002) (37)
Searching for an Agent Who May OR May Not Want to be Found (2002) (36)
Network search games with immobile hider, without a designated searcher starting point (2008) (36)
The search value of a network (1985) (35)
The ''Princess and Monster'' Game on an Interval (2008) (34)
Infiltration games on arbitrary graphs (1992) (33)
Patrolling a Border (2016) (33)
Search Games on Trees with Asymmetric Travel Times (2010) (33)
Typical Dynamics of Volume Preserving Homeomorphisms (2001) (32)
Rendezvous Search on Labelled Networks (2000) (32)
Alternating Search at Two Locations (2000) (32)
Ambush frequency should increase over time during optimal predator search for prey (2011) (30)
Searching a Variable Speed Network (2014) (29)
Rendezvous Search on the Line with More Than Two Players (1997) (28)
A mixed-strategy minimax theorem without compactness (1988) (27)
New proofs that weak mixing is generic (1976) (26)
Asymmetric Rendezvous on the Line Is a Double Linear Search Problem (1999) (25)
Find-and-Fetch Search on a Tree (2011) (24)
Ambush strategies in search games on graphs (1986) (21)
Equilibria of two-sided matching games with common preferences (2009) (20)
Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance (2000) (20)
A sequential selection game with vetoes (2010) (20)
Hide-and-seek games on a tree to which Eulerian networks are attached (2008) (20)
Search for point in interval, with high–low feedback (1985) (19)
Searching symmetric networks with Utilitarian-Postman paths (2009) (19)
Games with repeated decisions (1988) (18)
A search game model of the scatter hoarder's problem (2012) (17)
Patrolling a Pipeline (2016) (16)
Asymmetric Rendezvous Search on the Circle (2000) (16)
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (2015) (16)
The Symmetric Rendezvous-Evasion Game (1998) (16)
Approximation to and by Measure Preserving Homeomorphisms (1978) (16)
On Ruckle's Conjecture on Accumulation Games (2010) (15)
Properties generic for Lebesgue space automorphisms are generic for measure-preserving manifold homeomorphisms (2002) (15)
Maximally chaotic homeomorphisms of sigma-compact manifolds (2000) (14)
Rendezvous on a Planar Lattice (2005) (14)
Lusin's theorem for measure preserving homeomorphisms (1979) (14)
"High-Low Search" in Product and Labor Markets (1988) (14)
Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting (1999) (14)
Analysis and design of selection committees: a game theoretic secretary problem (2009) (14)
Optimizing periodic patrols against short attacks on the line and other networks (2019) (13)
The telephone coordination game (2000) (12)
On Search Games That Include Ambush (2013) (12)
Rendezvous search on the line with bounded resources: expected time minimization (1997) (12)
Cycles in extensive form perfect information games (1991) (11)
The importance of voting order for jury decisions by sequential majority voting (2017) (11)
Prey should hide more randomly when a predator attacks more persistently (2015) (10)
A New Approach to Gal’s Theory of Search Games on Weakly Eulerian Networks (2011) (10)
Rotational Representations of Stochastic Matrices (1983) (10)
Hide-and-Seek Games on a Network, Using Combinatorial Search Paths (2017) (10)
Hex games and twist maps on the annulus (1991) (10)
Combinatorial Proofs of the Conley-Zehnder-Franks Theorem on a Fixed Point for Torus Homeomorphisms (1993) (10)
Ten Open Problems in Rendezvous Search (2013) (10)
Rendezvous in Higher Dimensions (2006) (9)
Return times for nonsingular measurable transformations (1990) (9)
Typical Transitivity for Lifts of Rotationless Annulus or Torus Homeomorphisms (1995) (9)
A Search Model of Optimal Pricing and Production (1989) (9)
A topological analog of Halmos' conjugacy lemma (1978) (9)
Typical recurrence for lifts of mean rotation zero annulus homeomorphisms (1991) (9)
Measure preserving Homeomorphisms of R^n (1979) (8)
The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries? (2017) (8)
Accumulation games on graphs (2014) (8)
Partnership formation with age-dependent preferences (2013) (8)
Rendezvous of three agents on the line (2002) (7)
Combinatorial approximation by Devaney-chaotic or periodic volume preserving homeomorphisms (1999) (7)
The rendezvous and coordinated search problems (1994) (7)
Approximate solutions for expanding search games on general networks (2018) (7)
A common notion of clockwise can help in planar rendezvous (2006) (6)
Mathematical Models of Mutual Mate Choice (2005) (6)
Optimizing randomized patrols (2009) (6)
Rotational (and Other) Representations of Stochastic Matrices (2007) (6)
Searching symmetric networks with Utilitarian‐Postman paths (2009) (6)
Disperse or Unite? A Mathematical Model of Coordinated Attack (2010) (6)
Chaotic Homeomorphisms of Rn, Lifted from Torus Homeomorphisms (1999) (5)
Optimal search and ambush for a hider who can escape the search region (2016) (5)
AREA-PRESERVING HOMEOMORPHISMS OF THE OPEN DISK WITHOUT FIXED POINTS (1988) (5)
Rendezvous search with markers that can be dropped at chosen times (2018) (5)
Conjecture: In General a Mixing Transformation is Not Two-Fold Mixing (1985) (5)
How to hide information for later use on networks (2009) (5)
Line-of-sight rendezvous (2008) (5)
Rendezvous Search Games (2011) (5)
Rendezvous Search with Revealed Information: Applications to the Line (2007) (5)
A Proof of the Kikuta–Ruckle Conjecture on Cyclic Caching of Resources (2012) (5)
How to search a tree to which Eulerian networks are attached (2005) (4)
Search for an immobile Hider in a known subset of a network (2019) (4)
Topological ergodic theory and mean rotation (1993) (4)
Coding a Stationary Process to One with Prescribed Marginals (1989) (4)
Weak Mixing Manifold Homeomorphisms Preserving an Infinite Measure (1987) (4)
Nonstable Ergodic Homeomorphisms of R^4 (1983) (4)
Who should cast the casting vote? Using sequential voting to amalgamate information (2017) (4)
Two conjectures on rendezvous in K3 (2006) (4)
Winner-Take-All Games: The Strategic Optimisation of Rank (2017) (4)
Search-and-Rescue Rendezvous (2016) (4)
Rendezvous games (non-antagonistic search games) (2010) (3)
A stochastic game model of searching predators and hiding prey (2019) (3)
Games of Crowding (2001) (3)
MultiTowers, conjugacies and codes: Three theorems in ergodic theory, one variation on Rokhlin’s Lemma (2008) (3)
Adversarial Patrolling in a Uniform (2021) (3)
Equilibrium population dynamics when mating is by mutual choice based on age. (2014) (3)
Network Search from a Game Theoretic Perspective (2013) (2)
Superhamiltonian graphs (1978) (2)
Almost Periodic Ergodic Rn-Homeomorphisms (1995) (2)
Periodic Patrols on the Line and Other Networks (2017) (2)
Dynamics induced on the ends of non-compact manifold (1988) (2)
Continuous Patrolling Games (2020) (2)
Hide‐and‐seek games on a tree to which Eulerian networks are attached (2008) (2)
A Combinatorial Construction of Chaotic Homeomorphisms on Manifolds (1998) (2)
Searching Symmetric Networks with Utilitarian-Postman Paths CDAM Research Report CDAM-2006-05 (2006) (2)
Strategic Mating with Age Dependent Preferences (2010) (2)
The Uniformed Patroller Game (2019) (2)
The Faulty GPS Problem: Shortest Time Paths in Networks with Unreliable Directions (2021) (1)
Who should vote first on a small heterogeneous sequential jury (2014) (1)
A functional equation of tail-balance for continuous signals in the Condorcet Jury Theorem (2019) (1)
A Short Solution to the Many-Player Silent Duel with Arbitrary Consolation Prize (2017) (1)
Network Search Games with Asymmetric Travel Times (2009) (1)
Who should cast the casting vote (2015) (1)
Numerical approaches to the 'princess and monster' game on the interval (2006) (1)
A functional equation of tail-balance for continuous signals in the Condorcet Jury Theorem (2020) (1)
Price-Quantity Decisions as Learning Instruments (1990) (1)
Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks (2021) (1)
A Game Model of Search and Pursuit (2018) (1)
Optimizing voting order on sequential juries: a median voter theorem and beyond (2020) (1)
Geometric search theory and demand uncertainty (1989) (1)
Search Games (Shmuel Gal) (1982) (1)
A Numerical Approach to the ‘Princess and Monster’ Game on an Interval (2009) (1)
A note on the Uniformed Patroller Game (2019) (1)
Illuminating a Network from Its Nodes (2013) (1)
Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks (2022) (0)
Typical Dynamics of Volume Preserving Homeomorphisms: Introduction to Part III (2001) (0)
Uniform Approximation in G[In, λ] and Generic Properties in M[In, λ] (2001) (0)
Ergodic Homeomorphisms: The Results (2001) (0)
Fixed Points and Area Preservation (2001) (0)
Optimizing Voting Order on Sequential Juries: A Sealed Card Model (2021) (0)
Measures on Compact Manifolds (2001) (0)
Approximate solutions for expanding search games on general networks (2018) (0)
The mathematical work of John Oxtoby (2016) (0)
Periodic, Locally Linear, and Chaotic Approximations to Volume Preserving Homeomorphisms (2007) (0)
Manifolds Where Ergodicity Is Not Generic (2001) (0)
Geometric Games and Their Applications (W. H. Ruckle) (1985) (0)
Bilateral street searching in Manhattan (line-of-sight rendezvous on a planar lattice) (2004) (0)
A Symbolic Programming Approach to the Rendezvous Search Problem (2022) (0)
Constant Factor Approximate Solutions for Expanding Search on General Networks (2016) (0)
Part I Volume Preserving Homeomorphisms of the Cube (2004) (0)
METHODS OF MATHEMATICAL ECONOMICS: Linear and Nonlinear Programming, Fixed‐Point Theorems (1982) (0)
Search and Delivery Man Problems: When are depth-first paths optimal? (2019) (0)
Towers, conjugacy and coding (2005) (0)
Extensions of the Oxtoby-ulam Theorem on the Prevalence of Ergodicity for Measure Preserving Homeomorphisms (2000) (0)
Introduction to Parts I and II (Compact Manifolds) (2001) (0)
Noncompact Manifolds and Ends (2001) (0)
Typical Dynamics of Volume Preserving Homeomorphisms: Ergodic Volume Preserving Homeomorphisms of Rn (2001) (0)
Unemployment through `Learning from Experience' (1991) (0)
Patrolling games on graphs (2010) (0)
Equilbria of two-sided matching games (2007) (0)
Equilibria of Two-Sided Matching Games LSE-CDAM-2007-32 (2007) (0)
Typical Dynamics of Volume Preserving Homeomorphisms: Homeomorphic Measures (2001) (0)
The strategic optimisation of rank (2015) (0)
Who should cast the casting vote? Using sequential voting to amalgamate information (2017) (0)
Multiple Rokhlin Towers and Conjugacy Approximation (2001) (0)
: A Simple Open Problem in Search Games on an Interval (2017) (0)
A Zermelo algorithm solving deterministic graph games with average payoff (1989) (0)
Security Games Involving Search and Patrolling (2017) (0)
Other Properties Typical in M[X, μ] (2001) (0)
Ergodic Homeomorphisms: Proofs (2001) (0)
Typical Dynamics of Volume Preserving Homeomorphisms: Measure Preserving Homeomorphisms (2001) (0)
Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents (2023) (0)
A tribute to Anatole Beck (1930-2014) (2016) (0)
Patrolling the Line (2016) (0)
Measure Preserving Lusin Theorem (2001) (0)
Dynamics on Compact Manifolds (2001) (0)
Transitive Homeomorphisms of In and Rn (2001) (0)
A Proof of the Kikuta–Ruckle Conjecture on Cyclic Caching of Resources (2011) (0)
Typical Dynamics of Volume Preserving Homeomorphisms: Bibliography (2001) (0)

This paper list is powered by the following services:

Other Resources About Steve Alpern

en.wikipedia.org

What Schools Are Affiliated With Steve Alpern?

Steve Alpern is affiliated with the following schools: