Steve Alpern - RankMe

66 papers Journal 62Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information. Oper. Res. Steve Alpern, Thomas Lidbetter
2025	J	`jnl`	Winner-take-all games: existence of equilibria and three player dice. Int. J. Game Theory Steve Alpern
2023	J	`jnl`	Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents. CoRR Steve Alpern, Thomas Lidbetter
2023	J	`jnl`	The Faulty Satnav (GPS) Problem: Search for home in networks with unreliable directions. Theor. Comput. Sci. Steve Alpern
2022	J	`jnl`	A Symbolic Programming Approach to the Rendezvous Search Problem. Oper. Res. Forum Pierre Leone, Steve Alpern
2022	J	`jnl`	Adversarial Patrolling in a Uniform. Oper. Res. Steve Alpern, Paul Chleboun, Stamatios Katsikas, Kyle Y. Lin
2022	J	`jnl`	Continuous Patrolling Games. Oper. Res. Steve Alpern, Thuy Bui, Thomas Lidbetter, Katerina Papadaki
2022	J	`jnl`	Optimizing voting order on sequential juries: a median voter theorem and beyond. Soc. Choice Welf. Steve Alpern, Bo Chen
2022	J	`jnl`	Search-and-rescue rendezvous. Eur. J. Oper. Res. Pierre Leone, Julia Buwaya, Steve Alpern
2022	J	`jnl`	Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks. Dyn. Games Appl. Steve Alpern, Li Zeng
2021	J	`jnl`	The Faulty GPS Problem: Shortest Time Paths in Networks with Unreliable Directions. CoRR Steve Alpern
2020	J	`jnl`	Continuous Patrolling Games. CoRR Steve Alpern, Thomas Lidbetter, Katerina Papadaki
2020	J	`jnl`	Optimizing Voting Order on Sequential Juries: A Median Voter Theorem. CoRR Steve Alpern, Bo Chen
2020	J	`jnl`	Search and Delivery Man Problems: When are depth-first paths optimal? Eur. J. Oper. Res. Steve Alpern, Thomas Lidbetter
2019	J	`jnl`	A note on the Uniformed Patroller Game. CoRR Steve Alpern, Stamatios Katsikas
2019	J	`jnl`	A short solution to the many-player silent duel with arbitrary consolation prize. Eur. J. Oper. Res. Steve Alpern, J. V. Howard
2019	J	`jnl`	Approximate solutions for expanding search games on general networks. Ann. Oper. Res. Steve Alpern, Thomas Lidbetter
2019	J	`jnl`	Optimizing periodic patrols against short attacks on the line and other networks. Eur. J. Oper. Res. Steve Alpern, Thomas Lidbetter, Katerina Papadaki
2019	J	`jnl`	Search for an immobile Hider in a known subset of a network. Theor. Comput. Sci. Steve Alpern
2018	J	`jnl`	A Game Model of Search and Pursuit. CoRR Steve Alpern, Viciano Lee
2017	J	`jnl`	A Short Solution to the Many-Player Silent Duel with Arbitrary Consolation Prize. CoRR Steve Alpern, J. V. Howard
2017	J	`jnl`	Hide-and-Seek Games on a Network, Using Combinatorial Search Paths. Oper. Res. Steve Alpern
2017	J	`jnl`	The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries? Manag. Sci. Steve Alpern, Vic Baston
2017	J	`jnl`	The importance of voting order for jury decisions by sequential majority voting. Eur. J. Oper. Res. Steve Alpern, Bo Chen
2017	J	`jnl`	Winner-Take-All Games: The Strategic Optimisation of Rank. Oper. Res. Steve Alpern, J. V. Howard
2016	J	`jnl`	Constant Factor Approximate Solutions for Expanding Search on General Networks. CoRR Steve Alpern, Thomas Lidbetter
2016	J	`jnl`	Optimal search and ambush for a hider who can escape the search region. Eur. J. Oper. Res. Steve Alpern, Robbert Fokkink, Martin Simanjuntak
2016	J	`jnl`	Patrolling a Border. Oper. Res. Katerina Papadaki, Steve Alpern, Thomas Lidbetter, Alec Morton
2016	—	`conf`	Patrolling a Pipeline. GameSec Steve Alpern, Thomas Lidbetter, Alec Morton, Katerina Papadaki
2016	J	`jnl`	Search-and-Rescue Rendezvous. CoRR Pierre Leone, Steve Alpern
2015	J	`jnl`	Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object. Oper. Res. Steve Alpern, Thomas Lidbetter
2014	J	`jnl`	Accumulation games on graphs. Networks Steve Alpern, Robbert Fokkink
2014	J	`jnl`	Searching a Variable Speed Network. Math. Oper. Res. Steve Alpern, Thomas Lidbetter
2013	J	`jnl`	Illuminating a Network from Its Nodes. Am. Math. Mon. Steve Alpern, Robbert Fokkink
2013	J	`jnl`	Mining Coal or Finding Terrorists: The Expanding Search Paradigm. Oper. Res. Steve Alpern, Thomas Lidbetter
2013	J	`jnl`	On Search Games That Include Ambush. SIAM J. Control. Optim. Steve Alpern, Robbert Fokkink, Shmuel Gal, Marco Timmer
2013	J	`jnl`	Partnership formation with age-dependent preferences. Eur. J. Oper. Res. Steve Alpern, Ioanna Katrantzi, David M. Ramsey
2012	J	`jnl`	A Proof of the Kikuta-Ruckle Conjecture on Cyclic Caching of Resources. J. Optim. Theory Appl. Steve Alpern, Robbert Fokkink, Christos Pelekis
2011	J	`jnl`	A New Approach to Gal's Theory of Search Games on Weakly Eulerian Networks. Dyn. Games Appl. Steve Alpern
2011	J	`jnl`	Find-and-Fetch Search on a Tree. Oper. Res. Steve Alpern
2011	J	`jnl`	Patrolling Games. Oper. Res. Steve Alpern, Alec Morton, Katerina Papadaki
2010	J	`jnl`	A sequential selection game with vetoes. Games Econ. Behav. Steve Alpern, Shmuel Gal, Eilon Solan
2010	—	`conf`	Disperse or Unite? A Mathematical Model of Coordinated Attack. GameSec Steve Alpern, Robbert Fokkink, Joram op den Kelder, Tom Lidbetter
2010	J	`jnl`	On Ruckle's Conjecture on Accumulation Games. SIAM J. Control. Optim. Steve Alpern, Robbert Fokkink, Ken Kikuta
2010	J	`jnl`	Search Games on Trees with Asymmetric Travel Times. SIAM J. Control. Optim. Steve Alpern
2009	J	`jnl`	Analysis and design of selection committees: a game theoretic secretary problem. Int. J. Game Theory Steve Alpern, Shmuel Gal
2009	J	`jnl`	Equilibria of two-sided matching games with common preferences. Eur. J. Oper. Res. Steve Alpern, Ioanna Katrantzi
2009	—	`conf`	How to hide information for later use on networks. GAMENETS Steve Alpern, Robbert Fokkink
2009	J	`jnl`	Searching symmetric networks with Utilitarian-Postman paths. Networks Steve Alpern, Vic Baston, Shmuel Gal
2008	J	`jnl`	Hide-and-seek games on a tree to which Eulerian networks are attached. Networks Steve Alpern
2008	J	`jnl`	Line-of-sight rendezvous. Eur. J. Oper. Res. Steve Alpern
2008	J	`jnl`	Network search games with immobile hider, without a designated searcher starting point. Int. J. Game Theory Steve Alpern, Vic Baston, Shmuel Gal
2008	J	`jnl`	The ''Princess and Monster'' Game on an Interval. SIAM J. Control. Optim. Steve Alpern, Robbert Fokkink, Roy Lindelauf, Geert Jan Olsder
2006	J	`jnl`	A common notion of clockwise can help in planar rendezvous. Eur. J. Oper. Res. Steve Alpern, Vic Baston
2006	J	`jnl`	Rendezvous in Higher Dimensions. SIAM J. Control. Optim. Steve Alpern, Vic Baston
2005	J	`jnl`	Rendezvous on a Planar Lattice. Oper. Res. Steve Alpern, Vic Baston
2003	—	`book`	The theory of search games and rendezvous. Steve Alpern, Shmuel Gal
2002	J	`jnl`	Rendezvous Search: A Personal Perspective. Oper. Res. Steve Alpern
2002	J	`jnl`	Searching for an Agent Who May OR May Not Want to be Found. Oper. Res. Steve Alpern, Shmuel Gal
2001	J	`jnl`	Games of Crowding. IGTR Steve Alpern, Diane J. Reyniers
2000	J	`jnl`	Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance. Oper. Res. Steve Alpern, Anatole Beck
1999	J	`jnl`	Asymmetric Rendezvous on the Line Is a Double Linear Search Problem. Math. Oper. Res. Steve Alpern, Anatole Beck
1999	J	`jnl`	Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting. Oper. Res. Steve Alpern, Anatole Beck
1997	J	`jnl`	Rendezvous Search on the Line with More Than Two Players. Oper. Res. Wei Shi Lim, Steve Alpern, Anatole Beck
1985	J	`jnl`	The search value of a network. Networks Steve Alpern, Miroslav D. Asic
1978	J	`jnl`	Superhamiltonian graphs. J. Comb. Theory B Steve Alpern