From d69b4c803cd32e6b3cfe19965ebaa08e19751af3 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Sat, 6 Jul 2013 16:55:18 +0200
Subject: Fixing issues related to cost nomalization

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

(limited to 'main.tex')

diff --git a/main.tex b/main.tex
index 7f40d90..a751621 100644
--- a/main.tex
+++ b/main.tex
@@ -106,7 +106,7 @@ We can now state our main result, which is proved in Appendix~\ref{sec:proofofma
     along with threshold payments, is $\delta$-truthful, individually rational
     and budget feasible.  Furthermore, there exists an absolute constant $C$
     such that, for any $\varepsilon>0$, the mechanism runs in time
-    $O\big(poly(n, d, \log\log\frac{1}{b\varepsilon\delta})\big)$
+    $O\big(poly(n, d, \log\log\frac{B}{b\varepsilon\delta})\big)$
     and returns
     a set $S^*$ such that:
 %    \begin{align*}
-- 
cgit v1.2.3-70-g09d2