IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v61y2013i2p265-279.html
   My bibliography  Save this item

Mining Coal or Finding Terrorists: The Expanding Search Paradigm

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Bui, Thuy & Lidbetter, Thomas, 2023. "Optimal patrolling strategies for trees and complete networks," European Journal of Operational Research, Elsevier, vol. 311(2), pages 769-776.
  2. Hellerstein, Lisa & Lidbetter, Thomas, 2023. "A game theoretic approach to a problem in polymatroid maximization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 979-988.
  3. Francis Bloch & Bhaskar Dutta & Marcin Dziubi´nski, 2024. "Strategic hiding and exploration in networks," Working Papers 112, Ashoka University, Department of Economics.
  4. Steve Alpern & Thomas Lidbetter, 2014. "Searching a Variable Speed Network," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 697-711, August.
  5. Steve Alpern, 2017. "Hide-and-Seek Games on a Network, Using Combinatorial Search Paths," Operations Research, INFORMS, vol. 65(5), pages 1207-1214, October.
  6. Alpern, Steve & Lidbetter, Thomas, 2020. "Search and Delivery Man Problems: When are depth-first paths optimal?," European Journal of Operational Research, Elsevier, vol. 285(3), pages 965-976.
  7. Vic Baston & Kensaku Kikuta, 2015. "Search games on a network with travelling and search costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 347-365, May.
  8. Yolmeh, Abdolmajid & Baykal-Gürsoy, Melike, 2021. "Weighted network search games with multiple hidden objects and multiple search teams," European Journal of Operational Research, Elsevier, vol. 289(1), pages 338-349.
  9. Steve Alpern & Thomas Lidbetter, 2015. "Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object," Operations Research, INFORMS, vol. 63(1), pages 122-133, February.
  10. Felix Happach & Lisa Hellerstein & Thomas Lidbetter, 2022. "A General Framework for Approximating Min Sum Ordering Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1437-1452, May.
  11. Ben Hermans & Roel Leus & Jannik Matuschke, 2022. "Exact and Approximation Algorithms for the Expanding Search Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 281-296, January.
  12. Liu, Dehai & Xiao, Xingzhi & Li, Hongyi & Wang, Weiguo, 2015. "Historical evolution and benefit–cost explanation of periodical fluctuation in coal mine safety supervision: An evolutionary game analysis framework," European Journal of Operational Research, Elsevier, vol. 243(3), pages 974-984.
  13. Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
  14. Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
  15. Steve Alpern & Thomas Lidbetter, 2019. "Approximate solutions for expanding search games on general networks," Annals of Operations Research, Springer, vol. 275(2), pages 259-279, April.
  16. Angelopoulos, Spyros & Lidbetter, Thomas, 2020. "Competitive search in a network," European Journal of Operational Research, Elsevier, vol. 286(2), pages 781-790.
  17. Tianyu Wang & Igor Averbakh, 2022. "Network construction/restoration problems: cycles and complexity," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 51-73, August.
  18. Vassili Kolokoltsov, 2017. "The Evolutionary Game of Pressure (or Interference), Resistance and Collaboration," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 915-944, November.
  19. Lidbetter, Thomas, 2020. "Search and rescue in the face of uncertain threats," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1153-1160.
  20. Ben Hermans & Herbert Hamers & Roel Leus & Roy Lindelauf, 2019. "Timely exposure of a secret project: Which activities to monitor?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 451-468, September.
  21. Deutsch, Yael, 2021. "A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game," European Journal of Operational Research, Elsevier, vol. 288(3), pages 1036-1052.
  22. Spyros Angelopoulos, 2022. "Further connections between contract-scheduling and ray-searching problems," Journal of Scheduling, Springer, vol. 25(2), pages 139-155, April.
  23. Baston, Vic & Kikuta, Kensaku, 2019. "A search problem on a bipartite network," European Journal of Operational Research, Elsevier, vol. 277(1), pages 227-237.
  24. Garrec, Tristan & Scarsini, Marco, 2020. "Search for an immobile hider on a stochastic network," European Journal of Operational Research, Elsevier, vol. 283(2), pages 783-794.
  25. Bui, Thuy & Lidbetter, Thomas & Lin, Kyle Y., 2024. "Optimal pure strategies for a discrete search game," European Journal of Operational Research, Elsevier, vol. 313(2), pages 767-775.
  26. Robbert Fokkink & Ken Kikuta & David Ramsey, 2017. "The search value of a set," Annals of Operations Research, Springer, vol. 256(1), pages 63-73, September.
  27. Lidbetter, Thomas, 2017. "On the approximation ratio of the Random Chinese Postman Tour for network search," European Journal of Operational Research, Elsevier, vol. 263(3), pages 782-788.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.