Thomas Lidbetter

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 38

Top Topics

Search And Rescue

Search Strategy

Approximate Solutions

Top Venues

Eur. J. Oper. Res.

Theor. Comput. Sci.

Publications

Spyros Angelopoulos, Thomas Lidbetter, Konstantinos Panagiotou
Search Games with Predictions. CoRR (2024)
Thuy Bui, Thomas Lidbetter, Kyle Y. Lin
Optimal pure strategies for a discrete search game. Eur. J. Oper. Res. 313 (2) (2024)
Thomas Lidbetter, Yifan Xie
The search and rescue game on a cycle. Theor. Comput. Sci. (2023)
Steve Alpern, Thomas Lidbetter
Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents. CoRR (2023)
Thuy Bui, Thomas Lidbetter, Kyle Y. Lin
Optimal Pure Strategies for a Discrete Search Game. CoRR (2023)
Thuy Bui, Thomas Lidbetter
Optimal patrolling strategies for trees and complete networks. Eur. J. Oper. Res. 311 (2) (2023)
Lisa Hellerstein, Thomas Lidbetter
A game theoretic approach to a problem in polymatroid maximization. Eur. J. Oper. Res. 305 (2) (2023)
Thomas Lidbetter, Thuy Bui
An Optimal Patrolling Strategy for Tree Networks. CoRR (2022)
Thomas Lidbetter, Yifan Xie
The Search and Rescue Game on a Cycle. CoRR (2022)
Felix Happach, Lisa Hellerstein, Thomas Lidbetter
A general framework for approximating min sum ordering problems. ISAIM (2022)
Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. ISAAC (2022)
Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. CoRR (2022)
Felix Happach, Lisa Hellerstein, Thomas Lidbetter
A General Framework for Approximating Min Sum Ordering Problems. INFORMS J. Comput. 34 (3) (2022)
Steve Alpern, Thuy Bui, Thomas Lidbetter, Katerina Papadaki
Continuous Patrolling Games. Oper. Res. 70 (6) (2022)
Lisa Hellerstein, Thomas Lidbetter
A Polyhedral Approach to Some Max-min Problems. CoRR (2021)
Alessandro Agnetis, Thomas Lidbetter
The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines. Oper. Res. Lett. 48 (4) (2020)
Felix Happach, Lisa Hellerstein, Thomas Lidbetter
A General Framework for Approximating Min Sum Ordering Problems. CoRR (2020)
Spyros Angelopoulos, Thomas Lidbetter
Competitive search in a network. Eur. J. Oper. Res. 286 (2) (2020)
Thomas Lidbetter
Search and rescue in the face of uncertain threats. Eur. J. Oper. Res. 285 (3) (2020)
Steve Alpern, Thomas Lidbetter, Katerina Papadaki
Continuous Patrolling Games. CoRR (2020)
Thomas Lidbetter, Kyle Y. Lin
A search game on a hypergraph with booby traps. Theor. Comput. Sci. 821 (2020)
Steve Alpern, Thomas Lidbetter
Search and Delivery Man Problems: When are depth-first paths optimal? Eur. J. Oper. Res. 285 (3) (2020)
Thomas Lidbetter
Search and Rescue in the Face of Uncertain Threats. CoRR (2019)
Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter
The expanding search ratio of a graph. Discret. Appl. Math. 260 (2019)
Robbert Fokkink, Thomas Lidbetter, László A. Végh
On Submodular Search and Machine Scheduling. Math. Oper. Res. 44 (4) (2019)
Thomas Lidbetter, Kyle Y. Lin
Searching for multiple objects in multiple locations. Eur. J. Oper. Res. 278 (2) (2019)
Steve Alpern, Thomas Lidbetter
Approximate solutions for expanding search games on general networks. Ann. Oper. Res. 275 (2) (2019)
Anthony Bonato, Thomas Lidbetter
Bounds on the burning numbers of spiders and path-forests. Theor. Comput. Sci. 794 (2019)
Spyros Angelopoulos, Thomas Lidbetter
Competitive Search in a Network. CoRR (2019)
Steve Alpern, Thomas Lidbetter, Katerina Papadaki
Optimizing periodic patrols against short attacks on the line and other networks. Eur. J. Oper. Res. 273 (3) (2019)
Lisa Hellerstein, Thomas Lidbetter, Daniel Pirutinsky
Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games. Oper. Res. 67 (3) (2019)
Lisa Hellerstein, Thomas Lidbetter
An Algorithmic Approach to Search Games: Finding Solutions Using Best Response Oracles. CoRR (2017)
Thomas Lidbetter
On the approximation ratio of the Random Chinese Postman Tour for network search. Eur. J. Oper. Res. 263 (3) (2017)
Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter
The Expanding Search Ratio of a Graph. STACS (2016)
Katerina Papadaki, Steve Alpern, Thomas Lidbetter, Alec Morton
Patrolling a Border. Oper. Res. 64 (6) (2016)
Steve Alpern, Thomas Lidbetter
Constant Factor Approximate Solutions for Expanding Search on General Networks. CoRR (2016)
Steve Alpern, Thomas Lidbetter, Alec Morton, Katerina Papadaki
Patrolling a Pipeline. GameSec (2016)
Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter
The expanding search ratio of a graph. CoRR (2016)
Thomas Lidbetter
A Caching Game with Infinitely Divisible Hidden Material. SIAM J. Control. Optim. 53 (5) (2015)
Steve Alpern, Thomas Lidbetter
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object. Oper. Res. 63 (1) (2015)
Steve Alpern, Thomas Lidbetter
Searching a Variable Speed Network. Math. Oper. Res. 39 (3) (2014)
Thomas Lidbetter
Search Games with Multiple Hidden Objects. SIAM J. Control. Optim. 51 (4) (2013)
Steve Alpern, Thomas Lidbetter
Mining Coal or Finding Terrorists: The Expanding Search Paradigm. Oper. Res. 61 (2) (2013)