Search for a moving target in a competitive environment
Author
Abstract
Suggested Citation
DOI: 10.1007/s00182-021-00761-5
Download full text from publisher
As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.
Other versions of this item:
- Benoit Duvocelle & J'anos Flesch & Hui Min Shi & Dries Vermeulen, 2020. "Search for a moving target in a competitive environment," Papers 2008.09653, arXiv.org, revised Aug 2020.
References listed on IDEAS
- Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022.
"A competitive search game with a moving target,"
European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
- Benoit Duvocelle & J'anos Flesch & Mathias Staudigl & Dries Vermeulen, 2020. "A competitive search game with a moving target," Papers 2008.12032, arXiv.org.
- Koller, Daphne & Megiddo, Nimrod & von Stengel, Bernhard, 1996. "Efficient Computation of Equilibria for Extensive Two-Person Games," Games and Economic Behavior, Elsevier, vol. 14(2), pages 247-259, June.
- Stephen M. Pollock, 1970. "A Simple Model of Search for a Moving Target," Operations Research, INFORMS, vol. 18(5), pages 883-903, October.
- János Flesch & Emin Karagözoǧlu & Andrés Perea, 2009.
"Optimal search for a moving target with the option to wait,"
Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(6), pages 526-539, September.
- Flesch, J. & Karagozoglu, E. & Perea ý Monsuwé, A., 2007. "Optimal search for a moving target with the option to wait," Research Memorandum 051, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
- 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.
- Bogdan C. Bichescu & Michael J. Fry, 2009. "Vendor-managed inventory and the effect of channel power," Springer Books, in: Herbert Meyr & Hans-Otto Günther (ed.), Supply Chain Planning, pages 247-280, Springer.
- Tobias Harks & Max Klimm, 2012. "On the Existence of Pure Nash Equilibria in Weighted Congestion Games," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 419-436, August.
- Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, March.
- Tobias Harks & Veerle Timmermans, 2018. "Uniqueness of equilibria in atomic splittable polymatroid congestion games," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 812-830, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022.
"A competitive search game with a moving target,"
European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
- Benoit Duvocelle & J'anos Flesch & Mathias Staudigl & Dries Vermeulen, 2020. "A competitive search game with a moving target," Papers 2008.12032, arXiv.org.
- Mikhail Khachumov & Vyacheslav Khachumov, 2023. "Modeling the Solution of the Pursuit–Evasion Problem Based on the Intelligent–Geometric Control Theory," Mathematics, MDPI, vol. 11(23), pages 1-26, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Duvocelle, Benoit & Flesch, János & Staudigl, Mathias & Vermeulen, Dries, 2022.
"A competitive search game with a moving target,"
European Journal of Operational Research, Elsevier, vol. 303(2), pages 945-957.
- Benoit Duvocelle & J'anos Flesch & Mathias Staudigl & Dries Vermeulen, 2020. "A competitive search game with a moving target," Papers 2008.12032, arXiv.org.
- Delavernhe, Florian & Jaillet, Patrick & Rossi, André & Sevaux, Marc, 2021. "Planning a multi-sensors search for a moving target considering traveling costs," European Journal of Operational Research, Elsevier, vol. 292(2), pages 469-482.
- Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
- Jun Honda, 2015.
"Games with the Total Bandwagon Property,"
Department of Economics Working Papers
wuwp197, Vienna University of Economics and Business, Department of Economics.
- Honda, Jun, 2015. "Games with the Total Bandwagon Property," Department of Economics Working Paper Series 197, WU Vienna University of Economics and Business.
- Sung, Shao-Chin & Dimitrov, Dinko, 2010.
"Computational complexity in additive hedonic games,"
European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
- Sung, Shao-Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Discussion Papers in Economics 6430, University of Munich, Department of Economics.
- Dinko Dimitrov & Shao-Chin Sung, 2008. "Computational Complexity in Additive Hedonic Games," Working Papers 2008.98, Fondazione Eni Enrico Mattei.
- Sung, Shao Chin & Dimitrov, Dinko, 2008. "Computational Complexity in Additive Hedonic Games," Coalition Theory Network Working Papers 46655, Fondazione Eni Enrico Mattei (FEEM).
- Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002.
"Computing Normal Form Perfect Equilibria for Extensive Two-Person Games,"
Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 4487e2bf-5bc1-47d3-819f-2, Tilburg University, School of Economics and Management.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 2002. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 9f112346-b587-47f3-ad2e-6, Tilburg University, School of Economics and Management.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, School of Economics and Management.
- Luciano De Castro, 2012. "Correlation of Types in Bayesian Games," Discussion Papers 1556, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- 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.
- Corine M. Laan & Judith Timmer & Richard J. Boucherie, 2021. "Non-cooperative queueing games on a network of single server queues," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 279-301, April.
- Hwang, Sung-Ha & Rey-Bellet, Luc, 2020. "Strategic decompositions of normal form games: Zero-sum games and potential games," Games and Economic Behavior, Elsevier, vol. 122(C), pages 370-390.
- T. C. E. Cheng & B. Kriheli & E. Levner & C. T. Ng, 2021. "Scheduling an autonomous robot searching for hidden targets," Annals of Operations Research, Springer, vol. 298(1), pages 95-109, March.
- Steve Alpern & Li Zeng, 2022. "Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks," Dynamic Games and Applications, Springer, vol. 12(1), pages 288-311, March.
- Reiter, Johannes & Mauch, Franz & Jäckle, Josef, 1992. "Blocking transitions in lattice spin models with directed kinetic constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 184(3), pages 493-498.
- Hoam Chung & Elijah Polak & Johannes O. Royset & Shankar Sastry, 2011. "On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(8), pages 804-820, December.
- Pahl, Lucas, 2023. "Polytope-form games and index/degree theories for extensive-form games," Games and Economic Behavior, Elsevier, vol. 141(C), pages 444-471.
- Richard Baron & Jacques Durieu & Hans Haller & Rahul Savani & Philippe Solal, 2008.
"Good neighbors are hard to find: computational complexity of network formation,"
Review of Economic Design, Springer;Society for Economic Design, vol. 12(1), pages 1-19, April.
- Richard Baron & Jacques Durieu & Hans Haller & Philippe Solal & Savani Rahul, 2008. "Good neighbors are hard to find: computational complexity of network formation," Post-Print hal-00268851, HAL.
- Srihari Govindan & Robert Wilson, 2008.
"Metastable Equilibria,"
Mathematics of Operations Research, INFORMS, vol. 33(4), pages 787-820, November.
- Srihari Govindan & Robert Wilson, 2006. "Metastable Equilibria," Levine's Bibliography 122247000000001211, UCLA Department of Economics.
- Govindan, Srihari & Wilson, Robert B., 2007. "Metastable Equilibria," Research Papers 1934r, Stanford University, Graduate School of Business.
- Rajgopal Kannan & Sudipta Sarangi & S. S. Iyengar, 2002. "Strategic Path Reliability in Information Networks," Discussion Papers of DIW Berlin 298, DIW Berlin, German Institute for Economic Research.
- Rosenbaum, Janet, 2002. "The Computational Complexity of Nash Equilibria," SocArXiv h63mz, Center for Open Science.
- Bharat Adsul & Jugal Garg & Ruta Mehta & Milind Sohoni & Bernhard von Stengel, 2021. "Fast Algorithms for Rank-1 Bimatrix Games," Operations Research, INFORMS, vol. 69(2), pages 613-631, March.
More about this item
Keywords
Game theory; Search game; Optimal search; Greedy strategy; Subgame perfect equilibrium;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:50:y:2021:i:2:d:10.1007_s00182-021-00761-5. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.