 | This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (July 2016) (Learn how and when to remove this message) |
Principle of deferred decisions is a technique used in analysis of randomized algorithms.
Definition
A randomized algorithm makes a set of random choices. These random choices may be intricately related making it difficult to analyze it. In many of these cases Principle of Deferred Decisions is used. The idea behind the principle is that the entire set of random choices are not made in advance, but rather fixed only as they are revealed to the algorithm.
Applications
The Clock Solitaire Game
The principle is used to evaluate and determine the probability of "win" from a deck of cards. The idea is to let the random choices unfold, until the iteration ends at 52, where if the fourth card is drawn out of a group labeled "K", the game terminates.
References
Sources
- M. Mitzenmacher and E. Upfal. Probability and Computing : Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (NY), 2005. Section 1.3, page 9.
 | This algorithms or data structures-related article is a stub. You can help Misplaced Pages by expanding it. |