summaryrefslogtreecommitdiffstats
path: root/final
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2015-05-12 20:15:58 -0400
committerThibaut Horel <thibaut.horel@gmail.com>2015-05-12 20:15:58 -0400
commit9f58f2f1b422e5f37d4c3b31e2cae5e8333c6def (patch)
tree7e30a585f9a40b8256c891422cc404ced6295935 /final
parenta95ec2fe0169eed3d626fe2c3c645bfbcf48836d (diff)
downloadecon2099-9f58f2f1b422e5f37d4c3b31e2cae5e8333c6def.tar.gz
Removing a sentence which was cut in two by previous edits
Diffstat (limited to 'final')
-rw-r--r--final/main.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/final/main.tex b/final/main.tex
index d4e64f1..dfa5914 100644
--- a/final/main.tex
+++ b/final/main.tex
@@ -122,7 +122,7 @@ Problem~\ref{eq:opt}:
\E_{t\sim F}\big[x_i(t)] \leq \hat{x}_i,\quad\forall i\in[m]
\end{equation}
which expresses that the ex-ante allocation probability is upper-bounded by
-$\hat{x}$. Note that when $\hat{x} = (1,\ldots,1)$, the ex-ante allocation
+$\hat{x}$.
Following \citep{hartline}, we use the notation $R(\hat{q})$ to denote the
revenue obtained by the optimal mechanism which serves with ex-ante allocation