Monte Carlo Integration Hit and miss method:Algorithm: ( 1) generate N uniform random numbers, (i=1, 2,..., N), on(a,b) and N uniform random numbers, (i=1, 2,..., N), on (0,c); (2) calculate g() and count the number of cases, Nhit for whichg() (3)I can be estimated by
Extend Proposition 151.1 (the Perfect Folk Theorem with discounting) to arbitrary mixtures of payoff profiles of the original game G =(, (A Ui) ) Allow for both rational and real weights on the set of profiles {u(a): a E A}; note that the statement of the result will involve an approximation of the payoff profile