From 50900bfc44961b87379cd2d3464b677d9f5be1ac Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Sat, 21 Sep 2013 18:16:12 -0400
Subject: Converting to LATIN format

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

(limited to 'intro.tex')

diff --git a/intro.tex b/intro.tex
index 1d07f48..2519ac4 100644
--- a/intro.tex
+++ b/intro.tex
@@ -42,7 +42,7 @@ We present a polynomial time mechanism scheme for \SEDP{} that is approximately
 In contrast to this, we show that no truthful, budget-feasible mechanisms are possible for \SEDP{}  within a factor 2 approximation. 
 
 \smallskip
-We note that the objective \eqref{obj} is submodular. Using this fact, applying previous results on budget feasible mechanism design under general submodular objectives~\cite{singer-mechanisms,chen} would yield either a deterministic, truthful, constant-approximation mechanism that requires exponential time,  or a non-deterministic, (universally) truthful, poly-time mechanism that yields a constant approximation ratio only \emph{in expectation} (\emph{i.e.}, its approximation guarantee for a given instance may in fact be unbounded).
+We note that the objective \eqref{obj} is submodular. Using this fact, applying previous results on budget feasible mechanism design under general submodular objectives~\cite{singer-mechanisms,chen} would yield either a deterministic, truthful, constant-approximation mechanism that requires exponential time,  or a non-determi\-nis\-tic, (universally) truthful, poly-time mechanism that yields a constant approximation ratio only \emph{in expectation} (\emph{i.e.}, its approximation guarantee for a given instance may in fact be unbounded).
 \end{itemize}
 
 
-- 
cgit v1.2.3-70-g09d2

