Abstract
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, or never. This paper presents a general decision-theoretic method for optimally terminating such algorithms. The stopping policy is computed based on a prior probability of the answer, a payoff model describing the value that different probability estimates would provide at different times, and the algorithm’s run-time distribution. We present a linear-time algorithm for determining the optimal stopping policy given a finite cap on the number of algorithm steps. To increase accuracy, the initial satisfiability probability and the run-time distribution are conditioned on features of the instance. The expectation of the result at each future time step is computed using Bayesian updating. We then extend the framework to settings where no exogenous cap is given on the number of algorithm steps. The method also provides a normative basis for algorithm selection. Finally, our method can be used to terminate and/or select complete algorithms optimally as well.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hoos, H., Stützle, T.: Evaluating Las Vegas algorithms—pitfalls and remedies. In: Proceedings of the Uncertainty in Artificial Intelligence Conference (UAI) (1998)
Horvitz, E., Klein, A.: Reasoning, metareasoning, and mathematical truth: Studies of theorem proving under limited resources. In: UAI (1995)
Sandholm, T., Lesser, V.: Utility-based termination of anytime algorithms. In: ECAI Workshop on Decision Theory for DAI Applications, Amsterdam, pp. 88–99 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sandholm, T. (2003). Terminating Decision Algorithms Optimally. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_85
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive