From 9f58f2f1b422e5f37d4c3b31e2cae5e8333c6def Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Tue, 12 May 2015 20:15:58 -0400
Subject: Removing a sentence which was cut in two by previous edits

---
 final/main.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'final/main.tex')

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
-- 
cgit v1.2.3-70-g09d2