I am given a table of possible $X_1$ and $X_2$ values that can be generated in a casino. In the game, both are generated with each turn.
The questions asks me to determine the minimum fee that should be charged per turn so that that casino doesn't lose money, if the payouts are:
$a) \ 8X_1$
$b) \ 4X_1 + 8(X_2)^2-\frac{51}{128}$
$c) \ 8X_1X_2$
For a), I added up the total possible odds for each value $X_1$ could take, $$ 0\cdot\frac{2}{16} + 1\cdot\frac{4}{16}+2\cdot\frac{6}{16} + 3\cdot\frac{4}{16} = \frac{7}{4}$$ and determined that the casino would need to charge at least $\$1.75$ per turn.
For b) I tried the pretty much the same thing, only breaking it down into individual situations, for example; $$P\{X_1=0, X_2 =1\} = \frac{1}{16}$$ $$P\{X_1=0, X_2 =2\} = \frac{1}{16}$$ $$etc...$$
My question is, is there a faster, more efficient way to solve these types of problems? What if there were many more possible outcomes?