This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: runner runs barefooted is 1 / ( k + 1). 1 26. Let the state be the ordering of the deck of n cards, so there are n ! states. The transition probabilities are P ( i 1 ,i 2 , ,i n ) , ( i j ,i 1 ,i 2 , ,i j1 ,i j +1 , ,i n ) = 1 n This Markov Chain is doubly stochastic, so in the limit all n ! states are equally likely. 35. The transition probabilities are P = 1 1 1 / 2 1 / 2 1 / 3 1 / 3 1 / 3 1 / 4 1 / 4 1 / 4 1 / 4 0 The limiting probabilities are obtained from = 1 + 1 / 2 2 + 1 / 3 3 + 1 / 4 4 1 = 1 / 2 2 + 1 / 3 3 + 1 / 4 4 2 = 1 / 3 3 + 1 / 4 4 3 = 1 / 4 4 4 = + 1 + 2 + 3 + 4 = 1 The solution is, = 4 = 12 / 37 , 1 = 6 / 37 , 2 = 4 / 37 , 3 = 3 / 37 . 2...
View Full
Document
 Spring '08
 Lim
 Operations Research

Click to edit the document details