diff options
author | Jeff Burdges <burdges@gnunet.org> | 2018-04-25 23:19:15 +0200 |
---|---|---|
committer | Jeff Burdges <burdges@gnunet.org> | 2018-04-25 23:19:15 +0200 |
commit | 9549a6acc0abd07fab22047f7d50887b42458e2f (patch) | |
tree | 3fca10f0739f924b3389b4e59b4a7d53773598d7 /games | |
parent | 2082ab2b32a9e78a2f923d919178a8ef331cf773 (diff) | |
download | papers-9549a6acc0abd07fab22047f7d50887b42458e2f.tar.gz papers-9549a6acc0abd07fab22047f7d50887b42458e2f.tar.bz2 papers-9549a6acc0abd07fab22047f7d50887b42458e2f.zip |
Remove trash file with unused ideas and langauge
Diffstat (limited to 'games')
-rw-r--r-- | games/rm.tex | 19 |
1 files changed, 0 insertions, 19 deletions
diff --git a/games/rm.tex b/games/rm.tex deleted file mode 100644 index 61e1691..0000000 --- a/games/rm.tex +++ /dev/null @@ -1,19 +0,0 @@ - -We obtain a valid game run by terminating a game early of course, -We may consider the adversaries ${\cal A}_n$ obtained by terminating -$\cal A$ after the first $n$ refresh attempts $R_C$ with false planchets. -Also ${\cal A}_n$ inherits optimality from $\cal A$. - -We shall now prove $E({p \over b + p} | X \neq \emptyset) = {1\over\kappa}$ for ${\cal A}_n$. - -We shall prove $E({p \over b + p} | X \neq \emptyset) = {1\over\kappa}$ (\dag) -with the expectation taken over games with false planchets - in which the adversary plays optimally - in that no strictly simpler game run increases $p \over b + p$. - - -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. - |