Question: Consider a simple random walk on the below four vertex graph. Assume that the payoff function is: function (A) = 2, function(B) = 4, function(C)=
Consider a simple random walk on the below four vertex graph. Assume that the payoff function is: function (A) = 2, function(B) = 4, function(C)= 5, function (D)=3. Assume that there is no cost associated with moving but there is a discount factor . What is the largest possible value of so that the optimal stopping strategy is to stop at every vertex, i.e. so that S2 = {A, B, C, D} ? A B C D
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
