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, A. López-ortiz, and A. Hamel, Optimal scheduling of contract algorithms with soft deadlines, Journal of Scheduling, vol.20, issue.3, pp.267-277, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01362933

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.

D. S. Bernstein, T. J. Perkins, S. Zilberstein, and L. Finkelstein, Scheduling contract algorithms on multiple processors, Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), pp.702-706, 2002.

M. Chrobak and C. Kenyon-mathieu, SIGACT news online algorithms column 10, ACM SIGACT News, vol.37, issue.4, pp.115-126, 2006.

T. Dean and M. S. Boddy, An analysis of time-dependent planning, Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), pp.49-54, 1998.

R. Dorrigiv and A. López-ortiz, On Developing New Models, with Paging as a Case Study, ACM SIGACT News, vol.40, issue.4, pp.98-123, 2010.

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

R. Graham, Bounds for Certain Multiprocessing Anomalies, Bell System Technical Journal, vol.45, issue.9, pp.1563-1581, 1966.

E. Horvitz, Reasoning about beliefs and actions under computational resource constraints, International Journal of Approximate Reasoning, vol.2, issue.3, pp.337-338, 1988.

E. Horvitz, Reasoning under varying and uncertain resource constraints, Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), pp.111-116, 1998.

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

A. Lopez-ortiz, S. Angelopoulos, and A. M. Hamel, Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving, Journal of Artificial Intelligence Research, vol.51, issue.51, pp.533-554, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01185110

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

S. J. Russell and S. Zilberstein, Composing real-time systems, Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI), pp.212-217, 1991.

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

S. Zilberstein, Using anytime algorithms in intelligent systems, AI Magazine, vol.17, issue.3, pp.73-83, 1996.

S. Zilberstein, F. Charpillet, and P. Chassaing, Optimal sequencing of contract algorithms, Annals of Mathematics and Artificial Intelligence, vol.39, issue.1/2, pp.1-18, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00108057