The following pages link to Steven Alpern (Q1231029):
Displayed 50 items.
- Item:Q1231029 (redirect page) (← links)
- Optimal search and ambush for a hider who can escape the search region (Q322755) (← links)
- A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources (Q438788) (← links)
- Analysis and design of selection committees: a game theoretic secretary problem (Q532681) (← links)
- Item:Q1231029 (redirect page) (← links)
- Coding a stationary process to one with prescribed marginals (Q582687) (← links)
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- Return times for nonsingular measurable transformations (Q752874) (← links)
- A sequential selection game with vetoes (Q844901) (← links)
- Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
- Equilibria of two-sided matching games with common preferences (Q1041991) (← links)
- Conjecture: In general a mixing transformation is not two-fold mixing (Q1063714) (← links)
- Cycles in extensive form perfect information games (Q1176957) (← links)
- Infiltration games on arbitrary graphs (Q1191856) (← links)
- New proofs that weak mixing is generic (Q1231030) (← links)
- A topological analog of Halmos' conjugacy lemma (Q1248176) (← links)
- Superhamiltonian graphs (Q1251672) (← links)
- Combinatorial proofs of the Conley-Zehnder-Franks theorem on a fixed point for torus homeomorphisms (Q1261129) (← links)
- Rendezvous search on the line with bounded resources: Expected time minimization (Q1278996) (← links)
- The theory of search games and rendezvous. (Q1416614) (← links)
- Maximally chaotic homeomorphisms of sigma-compact manifolds (Q1570921) (← links)
- Asymmetric rendezvous search on the circle (Q1577517) (← links)
- A short solution to the many-player silent duel with arbitrary consolation prize (Q1622819) (← links)
- Optimizing periodic patrols against short attacks on the line and other networks (Q1631529) (← links)
- Who should cast the casting vote? Using sequential voting to amalgamate information (Q1706791) (← links)
- The importance of voting order for jury decisions by sequential majority voting (Q1751748) (← links)
- Spatial dispersion as a dynamic coordination problem (Q1863939) (← links)
- Almost periodic ergodic \(\mathbb{R}^ n\)-homeomorphisms (Q1906990) (← links)
- A normal form game model of search and pursuit (Q2087115) (← links)
- A symbolic programming approach to the rendezvous search problem (Q2120120) (← links)
- Optimizing voting order on sequential juries: a median voter theorem and beyond (Q2125110) (← links)
- Social distancing, gathering, search games: mobile agents on simple networks (Q2128973) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Strategic mating with common preferences (Q2196885) (← links)
- A functional equation of tail-balance for continuous signals in the Condorcet jury theorem (Q2227520) (← links)
- Search-and-rescue rendezvous (Q2242258) (← links)
- Partnership formation with age-dependent preferences (Q2253489) (← links)
- Approximate solutions for expanding search games on general networks (Q2327672) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- A common notion of clockwise can help in planar rendezvous (Q2433433) (← links)
- Line-of-sight rendezvous (Q2475830) (← links)
- (Q2707766) (← links)
- GAMES OF CROWDING (Q2762239) (← links)
- (Q2833766) (← links)
- Illuminating a Network from Its Nodes (Q2847001) (← links)
- Patrolling Games (Q2879520) (← links)
- Find-and-Fetch Search on a Tree (Q2879521) (← links)
- Patrolling a Border (Q2957456) (← links)
- Ten Open Problems in Rendezvous Search (Q2961406) (← links)
- The mathematical work of John C. Oxtoby (Q2975227) (← links)