A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
Monopoly as a Markov Process
The limit frequencies of the positions in the game of Monopoly are calculated on the basis of Markov chains. In order to make the process Markovian some minor modifications in the rules are necessary. A parameter is introduced so that by varying this parameter we can determine how distorted our mode is compared with the actual game. The convergence properties of Markov chains are so nice that it was feasible to use hand computation. A neat trick with power series played an important role indoi:10.2307/2688377 fatcat:sph7yzaugzcwxnwbinyakihnuy