exercise:C783732ec3: Difference between revisions
From Stochiki
(Created page with "<div class="d-none"><math> \newcommand{\NA}{{\rm NA}} \newcommand{\mat}[1]{{\bf#1}} \newcommand{\exref}[1]{\ref{##1}} \newcommand{\secstoprocess}{\all} \newcommand{\NA}{{\rm NA}} \newcommand{\mathds}{\mathbb}</math></div> (E. Brown<ref group="Notes" >Private communication.</ref>) Mary and John are playing the following game: They have a three-card deck marked with the numbers 1, 2, and 3 and a spinner with the numbers 1, 2, and 3 on it. The game begins by deal...") |
No edit summary |
||
| Line 5: | Line 5: | ||
\newcommand{\secstoprocess}{\all} | \newcommand{\secstoprocess}{\all} | ||
\newcommand{\NA}{{\rm NA}} | \newcommand{\NA}{{\rm NA}} | ||
\newcommand{\mathds}{\mathbb}</math></div> (E. Brown<ref group="Notes" >Private communication.</ref>) | \newcommand{\mathds}{\mathbb}</math></div> (E. Brown<ref group="Notes" >Private communication.</ref>) Mary and John are playing the following game: They have a three-card deck marked with the numbers 1, 2, and 3 and a spinner with the numbers 1, 2, and 3 on it. The game begins by dealing the cards out so that the dealer gets one card and the other person gets two. A move in the game consists of a spin of the spinner. The person having the card with the number that comes up on the spinner hands that card to the other person. The game ends when someone has all the cards. | ||
Mary and John are playing the following game: They have a three-card deck | <ul style="list-style-type:lower-alpha"><li> Set up the transition matrix for this absorbing Markov chain, where the | ||
marked with | |||
the numbers 1, 2, and 3 and a spinner with the numbers 1, 2, and 3 on it. The | |||
game begins by | |||
dealing the cards out so that the dealer gets one card and the other person | |||
gets two. | |||
A move in the game consists of a spin of the spinner. The person having the | |||
card with the | |||
number that comes up on the spinner hands that card to the other person. The | |||
game ends when | |||
someone has all the cards. | |||
<ul><li> Set up the transition matrix for this absorbing Markov chain, where the | |||
states | states | ||
correspond to the number of cards that Mary has. | correspond to the number of cards that Mary has. | ||
Latest revision as of 23:45, 15 June 2024
[math]
\newcommand{\NA}{{\rm NA}}
\newcommand{\mat}[1]{{\bf#1}}
\newcommand{\exref}[1]{\ref{##1}}
\newcommand{\secstoprocess}{\all}
\newcommand{\NA}{{\rm NA}}
\newcommand{\mathds}{\mathbb}[/math]
(E. Brown[Notes 1]) Mary and John are playing the following game: They have a three-card deck marked with the numbers 1, 2, and 3 and a spinner with the numbers 1, 2, and 3 on it. The game begins by dealing the cards out so that the dealer gets one card and the other person gets two. A move in the game consists of a spin of the spinner. The person having the card with the number that comes up on the spinner hands that card to the other person. The game ends when someone has all the cards.
- Set up the transition matrix for this absorbing Markov chain, where the states correspond to the number of cards that Mary has.
- Find the fundamental matrix.
- On the average, how many moves will the game last?
- If Mary deals, what is the probability that John will win the game?
Notes