Computer Science, asked by mdjahir653792, 1 month ago

On any given day Mahbub is either jolly (J), so-so (S), or glum(G). If he is jolly today, then he will be J, S, or G tomorrow with respective probabilities 0.6, 0.3, 0.1. If he is feeling so-so today, then he will be J, S, or G tomorrow with probabilities 0.3, 0.4, 0.3. If he is glum today, then he will be J, S, or G tomorrow with probabilities 0.2, 0.3, 0.5. If today is Saturday and Mahbub is glum (G) today, what is the probability that he will be so-so(S) on Tuesday?​

Answers

Answered by akshay1286
0

Answer:

(a) Construct the one-step transition matrix for the Markov chain

X

n

=

strategy employed at

the

n

th stage of a negotiation, assuming the states are

(

1

)

cooperative and

(

2

)

competitive.

Similar questions