S. Alpern and S. Gal, Rendezvous Search Games, 2011.

S. Angelopoulos and S. Jin, Earliest-Completion Scheduling of Contract Algorithms with End Guarantees, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, pp.1516-1522, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02374471

S. Angelopoulos, D. Arsénio, and C. Dürr, Infinite linear programming and online searching with turn cost, Theoretical Computer Science, vol.670, pp.11-22, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01452876

S. Angelopoulos, R. Dorrigiv, and A. López-ortiz, On the Separation and Equivalence of Paging Strategies and Other Online Algorithms, Algorithmica, vol.81, issue.3, pp.1152-1179, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02374509

S. Angelopoulos, M. P. Renault, and P. Schweitzer, Stochastic Dominance and the Bijective Ratio of Online Algorithms, Algorithmica, vol.82, issue.5, pp.1101-1135, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02374526

S. Angelopoulos and P. Schweitzer, Paging and list update under bijective analysis, Journal of the ACM, vol.60, issue.2, pp.1-18, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01185285

R. A. Baezayates, J. C. Culberson, and G. J. Rawlins, Searching in the Plane, Information and Computation, vol.106, issue.2, pp.234-252, 1993.

A. Beck, On the linear search problem, Israel Journal of Mathematics, vol.2, issue.4, pp.221-228, 1964.

A. Beck and D. J. Newman, Yet more on the linear search problem, Israel Journal of Mathematics, vol.8, issue.4, pp.419-429, 1970.

R. Bellman, An Optimal Search, SIAM Review, vol.5, issue.3, pp.274-274, 1963.

P. Berman, On-line searching and navigation, Online Algorithms, pp.232-241, 1998.

D. S. Bernstein, L. Finkelstein, and S. Zilberstein, IJCAI-83: International joint conference on artificial intelligence, Artificial Intelligence, vol.18, issue.2, p.268, 1982.

P. Bose, J. De-carufel, and S. Durocher, Searching on a line: A complete characterization of the optimal solution, Theoretical Computer Science, vol.569, pp.24-42, 2015.

J. Boyar, S. Irani, and K. S. Larsen, A Comparison of Performance Measures for Online Algorithms, Algorithmica, vol.72, issue.4, pp.969-994, 2014.

J. Boyar, K. S. Larsen, and A. Maiti, A comparison of performance measures via online search, Theoretical Computer Science, vol.532, pp.2-13, 2014.

A. Condon, A. Deshpande, L. Hellerstein, and N. Wu, Algorithms for distributional and adversarial pipelined filter ordering problems, ACM Transactions on Algorithms, vol.5, issue.2, pp.1-34, 2009.

J. Czyzowicz, E. Kranakis, D. Krizanc, L. Narayanan, and J. Opatrny, Search on a Line with Faulty Robots, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing - PODC '16, vol.27, p.12, 2016.

E. D. Demaine, S. P. Fekete, and S. Gal, Online searching with turn cost, Theoretical Computer Science, vol.361, issue.2-3, pp.342-355, 2006.

R. Dorrigiv and A. López-ortiz, A Survey of Performance Measures for On-Line Algorithms, SIGACT News, vol.36, issue.3, pp.67-81, 2005.

S. , A general search game, Israel Journal of Mathematics, vol.12, issue.1, pp.32-45, 1972.

S. , Minimax Solutions for Linear Search Problems, SIAM Journal on Applied Mathematics, vol.27, issue.1, pp.17-30, 1974.

S. , Search Games: A Review, Search Theory, pp.3-15, 2013.

C. Hipke, C. Icking, R. Klein, and E. Langetepe, How to find a point on a line within a fixed distance, Discrete Applied Mathematics, vol.93, issue.1, pp.67-73, 1999.

P. Jaillet and M. Stafford, Online Searching, Operations Research, vol.49, issue.4, pp.501-515, 2001.

M. Kao and M. L. Littman, Algorithms for informed cows, Proceedings of the AAAI 1997 Workshop on Online Search, 1997.

M. Kao, J. H. Reif, and S. R. Tate, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, Information and Computation, vol.131, issue.1, pp.63-79, 1996.

D. G. Kirkpatrick, Hyperbolic Dovetailing, Lecture Notes in Computer Science, pp.516-527, 2009.

E. Koutsoupias, C. H. Papadimitriou, and M. Yannakakis, Searching a fixed graph, Automata, Languages and Programming, pp.280-289, 1996.

A. López-ortiz and S. Schuierer, On-line parallel heuristics, processor scheduling and robot searching under the competitive framework, Theoretical Computer Science, vol.310, issue.1-3, pp.527-537, 2004.

A. Mcgregor, K. Onak, and R. Panigrahy, The Oil Searching Problem, Lecture Notes in Computer Science, pp.504-515, 2009.

S. Schuierer, Lower bounds in on-line geometric searching, Computational Geometry, vol.18, issue.1, pp.37-53, 2001.