default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteve Alpern
Person information
- affiliation: University of Warwick, Coventry, UK
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j51]Steve Alpern:
The Faulty Satnav (GPS) Problem: Search for home in networks with unreliable directions. Theor. Comput. Sci. 975: 114109 (2023)- [i9]Steve Alpern, Thomas Lidbetter:
Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents. CoRR abs/2303.13378 (2023) - 2022
- [j50]Steve Alpern
, Li Zeng:
Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks. Dyn. Games Appl. 12(1): 288-311 (2022) - [j49]Pierre Leone, Julia Buwaya, Steve Alpern:
Search-and-rescue rendezvous. Eur. J. Oper. Res. 297(2): 579-591 (2022) - [j48]Steve Alpern, Paul Chleboun, Stamatios Katsikas, Kyle Y. Lin:
Adversarial Patrolling in a Uniform. Oper. Res. 70(1): 129-140 (2022) - [j47]Steve Alpern, Thuy Bui, Thomas Lidbetter, Katerina Papadaki:
Continuous Patrolling Games. Oper. Res. 70(6): 3076-3089 (2022) - [j46]Pierre Leone, Steve Alpern:
A Symbolic Programming Approach to the Rendezvous Search Problem. Oper. Res. Forum 3(1) (2022) - [j45]Steve Alpern, Bo Chen:
Optimizing voting order on sequential juries: a median voter theorem and beyond. Soc. Choice Welf. 58(3): 527-565 (2022) - 2021
- [i8]Steve Alpern:
The Faulty GPS Problem: Shortest Time Paths in Networks with Unreliable Directions. CoRR abs/2111.09093 (2021) - 2020
- [j44]Steve Alpern, Thomas Lidbetter:
Search and Delivery Man Problems: When are depth-first paths optimal? Eur. J. Oper. Res. 285(3): 965-976 (2020) - [i7]Steve Alpern, Bo Chen:
Optimizing Voting Order on Sequential Juries: A Median Voter Theorem. CoRR abs/2006.14045 (2020) - [i6]Steve Alpern, Thomas Lidbetter, Katerina Papadaki:
Continuous Patrolling Games. CoRR abs/2008.07369 (2020)
2010 – 2019
- 2019
- [j43]Steve Alpern, Thomas Lidbetter:
Approximate solutions for expanding search games on general networks. Ann. Oper. Res. 275(2): 259-279 (2019) - [j42]Steve Alpern, J. V. Howard:
A short solution to the many-player silent duel with arbitrary consolation prize. Eur. J. Oper. Res. 273(2): 646-649 (2019) - [j41]Steve Alpern, Thomas Lidbetter, Katerina Papadaki:
Optimizing periodic patrols against short attacks on the line and other networks. Eur. J. Oper. Res. 273(3): 1065-1073 (2019) - [j40]Steve Alpern:
Search for an immobile Hider in a known subset of a network. Theor. Comput. Sci. 794: 20-26 (2019) - [i5]Steve Alpern, Stamatios Katsikas:
A note on the Uniformed Patroller Game. CoRR abs/1908.07366 (2019) - 2018
- [i4]Steve Alpern, Viciano Lee:
A Game Model of Search and Pursuit. CoRR abs/1811.09538 (2018) - 2017
- [j39]Steve Alpern, Bo Chen:
The importance of voting order for jury decisions by sequential majority voting. Eur. J. Oper. Res. 258(3): 1072-1081 (2017) - [j38]Steve Alpern, J. V. Howard:
Winner-Take-All Games: The Strategic Optimisation of Rank. Oper. Res. 65(5): 1165-1176 (2017) - [j37]Steve Alpern:
Hide-and-Seek Games on a Network, Using Combinatorial Search Paths. Oper. Res. 65(5): 1207-1214 (2017) - [j36]Steve Alpern, Vic Baston:
The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries? Manag. Sci. 63(4): 1184-1197 (2017) - [i3]Steve Alpern, J. V. Howard:
A Short Solution to the Many-Player Silent Duel with Arbitrary Consolation Prize. CoRR abs/1712.00274 (2017) - 2016
- [j35]Steve Alpern, Robbert Fokkink, Martin Simanjuntak:
Optimal search and ambush for a hider who can escape the search region. Eur. J. Oper. Res. 251(3): 707-714 (2016) - [j34]Katerina Papadaki, Steve Alpern, Thomas Lidbetter, Alec Morton:
Patrolling a Border. Oper. Res. 64(6): 1256-1269 (2016) - [c3]Steve Alpern, Thomas Lidbetter, Alec Morton, Katerina Papadaki:
Patrolling a Pipeline. GameSec 2016: 129-138 - [i2]Steve Alpern, Thomas Lidbetter:
Constant Factor Approximate Solutions for Expanding Search on General Networks. CoRR abs/1608.05390 (2016) - [i1]Pierre Leone, Steve Alpern:
Search-and-Rescue Rendezvous. CoRR abs/1611.05205 (2016) - 2015
- [j33]Steve Alpern, Thomas Lidbetter:
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object. Oper. Res. 63(1): 122-133 (2015) - 2014
- [j32]Steve Alpern, Thomas Lidbetter:
Searching a Variable Speed Network. Math. Oper. Res. 39(3): 697-711 (2014) - [j31]Steve Alpern, Robbert Fokkink:
Accumulation games on graphs. Networks 64(1): 40-47 (2014) - 2013
- [j30]Steve Alpern, Ioanna Katrantzi, David M. Ramsey:
Partnership formation with age-dependent preferences. Eur. J. Oper. Res. 225(1): 91-99 (2013) - [j29]Steve Alpern, Thomas Lidbetter:
Mining Coal or Finding Terrorists: The Expanding Search Paradigm. Oper. Res. 61(2): 265-279 (2013) - [j28]Steve Alpern, Robbert Fokkink, Shmuel Gal, Marco Timmer:
On Search Games That Include Ambush. SIAM J. Control. Optim. 51(6): 4544-4556 (2013) - [j27]Steve Alpern, Robbert Fokkink:
Illuminating a Network from Its Nodes. Am. Math. Mon. 120(4): 358-359 (2013) - 2012
- [j26]Steve Alpern, Robbert Fokkink, Christos Pelekis:
A Proof of the Kikuta-Ruckle Conjecture on Cyclic Caching of Resources. J. Optim. Theory Appl. 153(3): 650-661 (2012) - 2011
- [j25]Steve Alpern:
A New Approach to Gal's Theory of Search Games on Weakly Eulerian Networks. Dyn. Games Appl. 1(2): 209-219 (2011) - [j24]Steve Alpern, Alec Morton, Katerina Papadaki:
Patrolling Games. Oper. Res. 59(5): 1246-1257 (2011) - [j23]Steve Alpern:
Find-and-Fetch Search on a Tree. Oper. Res. 59(5): 1258-1268 (2011) - 2010
- [j22]Steve Alpern, Shmuel Gal, Eilon Solan:
A sequential selection game with vetoes. Games Econ. Behav. 68(1): 1-14 (2010) - [j21]Steve Alpern, Robbert Fokkink, Ken Kikuta:
On Ruckle's Conjecture on Accumulation Games. SIAM J. Control. Optim. 48(8): 5073-5083 (2010) - [j20]Steve Alpern:
Search Games on Trees with Asymmetric Travel Times. SIAM J. Control. Optim. 48(8): 5547-5563 (2010) - [c2]Steve Alpern, Robbert Fokkink, Joram op den Kelder, Tom Lidbetter:
Disperse or Unite? A Mathematical Model of Coordinated Attack. GameSec 2010: 220-233
2000 – 2009
- 2009
- [j19]Steve Alpern, Ioanna Katrantzi:
Equilibria of two-sided matching games with common preferences. Eur. J. Oper. Res. 196(3): 1214-1222 (2009) - [j18]Steve Alpern, Shmuel Gal:
Analysis and design of selection committees: a game theoretic secretary problem. Int. J. Game Theory 38(3): 377-394 (2009) - [j17]Steve Alpern, Vic Baston, Shmuel Gal:
Searching symmetric networks with Utilitarian-Postman paths. Networks 53(4): 392-402 (2009) - [c1]Steve Alpern, Robbert Fokkink:
How to hide information for later use on networks. GAMENETS 2009: 653-657 - 2008
- [j16]Steve Alpern:
Line-of-sight rendezvous. Eur. J. Oper. Res. 188(3): 865-883 (2008) - [j15]Steve Alpern, Vic Baston, Shmuel Gal:
Network search games with immobile hider, without a designated searcher starting point. Int. J. Game Theory 37(2): 281-302 (2008) - [j14]Steve Alpern:
Hide-and-seek games on a tree to which Eulerian networks are attached. Networks 52(3): 162-166 (2008) - [j13]Steve Alpern, Robbert Fokkink, Roy Lindelauf, Geert Jan Olsder:
The ''Princess and Monster'' Game on an Interval. SIAM J. Control. Optim. 47(3): 1178-1190 (2008) - 2006
- [j12]Steve Alpern, Vic Baston:
A common notion of clockwise can help in planar rendezvous. Eur. J. Oper. Res. 175(2): 688-706 (2006) - [j11]Steve Alpern, Vic Baston:
Rendezvous in Higher Dimensions. SIAM J. Control. Optim. 44(6): 2233-2252 (2006) - 2005
- [j10]Steve Alpern, Vic Baston:
Rendezvous on a Planar Lattice. Oper. Res. 53(6): 996-1006 (2005) - 2003
- [b1]Steve Alpern, Shmuel Gal:
The theory of search games and rendezvous. International series in operations research and management science 55, Kluwer 2003, ISBN 978-0-7923-7468-8, pp. I-XIV, 1-319 - 2002
- [j9]Steve Alpern, Shmuel Gal:
Searching for an Agent Who May OR May Not Want to be Found. Oper. Res. 50(2): 311-323 (2002) - [j8]Steve Alpern:
Rendezvous Search: A Personal Perspective. Oper. Res. 50(5): 772-795 (2002) - 2001
- [j7]Steve Alpern, Diane J. Reyniers:
Games of Crowding. IGTR 3(1): 27-56 (2001) - 2000
- [j6]Steve Alpern, Anatole Beck:
Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance. Oper. Res. 48(3): 498-501 (2000)
1990 – 1999
- 1999
- [j5]Steve Alpern, Anatole Beck:
Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting. Oper. Res. 47(6): 849-861 (1999) - [j4]Steve Alpern, Anatole Beck:
Asymmetric Rendezvous on the Line Is a Double Linear Search Problem. Math. Oper. Res. 24(3): 604-618 (1999) - 1997
- [j3]Wei Shi Lim, Steve Alpern, Anatole Beck:
Rendezvous Search on the Line with More Than Two Players. Oper. Res. 45(3): 357-364 (1997)
1980 – 1989
- 1985
- [j2]Steve Alpern, Miroslav D. Asic:
The search value of a network. Networks 15(2): 229-238 (1985)
1970 – 1979
- 1978
- [j1]Steve Alpern:
Superhamiltonian graphs. J. Comb. Theory B 25(1): 62-73 (1978)
Coauthor Index
aka: Thomas Lidbetter
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
