summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJeff Burdges <burdges@gnunet.org>2018-04-25 23:07:03 +0200
committerJeff Burdges <burdges@gnunet.org>2018-04-25 23:07:03 +0200
commit2082ab2b32a9e78a2f923d919178a8ef331cf773 (patch)
treec2edb242ef9f41d523c1065510b3a49bdc6474a1
parent3e47fa9b5052f57e40de33272eb9b6a0f0f5f537 (diff)
downloadpapers-2082ab2b32a9e78a2f923d919178a8ef331cf773.tar.gz
papers-2082ab2b32a9e78a2f923d919178a8ef331cf773.tar.bz2
papers-2082ab2b32a9e78a2f923d919178a8ef331cf773.zip
blank lines
-rw-r--r--games/games.tex7
1 files changed, 0 insertions, 7 deletions
diff --git a/games/games.tex b/games/games.tex
index 365013f..fef4a3a 100644
--- a/games/games.tex
+++ b/games/games.tex
@@ -952,13 +952,6 @@ Now $p = {1\over\kappa |X|} \sum_{C \in X} p_C$
and $b = {1\over\kappa |X|} \sum_{C \in X} b_C$
so $E({p \over b + p} | X \neq \emptyset) = {1\over\kappa}$,
which yields the inequality (\dag).
-
-
-
-induction on the length of the game now still produces disjoint groupings
-$\mathbb{G}$ of optimal games in which
- $\sum_{\mathbb{G}} {p \over b + p} = {1\over\kappa} |\mathbb{G}|$.
-We conclude that $E({p \over b + p}) = {1\over\kappa}$, as desired.
\end{proof}
% https://math.stackexchange.com/questions/852890/expectation-of-random-variables-ratio
%%% $L - w' \over (L - w') + (w - s)$