summaryrefslogtreecommitdiffstats
path: root/main.tex
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2013-07-06 16:55:18 +0200
committerThibaut Horel <thibaut.horel@gmail.com>2013-07-06 16:55:18 +0200
commitd69b4c803cd32e6b3cfe19965ebaa08e19751af3 (patch)
tree5def1d254f55dd6f4ded63a6967850c9f61b27aa /main.tex
parent9b26f56120422dec9537505f3971ce67dd46c68f (diff)
downloadrecommendation-d69b4c803cd32e6b3cfe19965ebaa08e19751af3.tar.gz
Fixing issues related to cost nomalization
Diffstat (limited to 'main.tex')
-rw-r--r--main.tex2
1 files changed, 1 insertions, 1 deletions
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*}