تقرير
Search for a moving target in a competitive environment
| العنوان: | Search for a moving target in a competitive environment |
|---|---|
| المؤلفون: | Duvocelle, Benoit, Flesch, János, Shi, Hui Min, Vermeulen, Dries |
| سنة النشر: | 2020 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Mathematics - Optimization and Control, Computer Science - Computer Science and Game Theory, Economics - Theoretical Economics, Mathematics - Probability |
| الوصف: | We consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model. Comment: 14 pages, 0 figures |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2008.09653 |
| رقم الأكسشن: | edsarx.2008.09653 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |