From 24fdab84d29f2d2fb0bd78a4c7ad7131100afe94 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Mon, 16 Dec 2013 17:23:26 -0500
Subject: More space saving

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

(limited to 'main.tex')

diff --git a/main.tex b/main.tex
index ebb853f..5998d6a 100755
--- a/main.tex
+++ b/main.tex
@@ -1,6 +1,6 @@
 \label{sec:main}
 
-The $\delta$-decreasing, $\epsilon$-accurate algorithm solving the convex optimization problem \eqref{eq:primal} can be used to design a mechanism for \SEDP. The construction follows a methodology proposed in \cite{singer-mechanisms} and employed by \citeN{chen} and \citeN{singer-influence} to construct \junk{deterministic, truthful} mechanisms for \textsc{Knapsack} and \textsc{Coverage} respectively. The following theorem summarizes the properties of our merchanism.
+The $\delta$-decreasing, $\epsilon$-accurate algorithm solving the convex optimization problem \eqref{eq:primal} can be used to design a mechanism for \SEDP. The construction follows a methodology proposed in \cite{singer-mechanisms} and employed by \citeN{chen} and \citeN{singer-influence} to construct \junk{deterministic, truthful} mechanisms for \textsc{Knapsack} and \textsc{Coverage} respectively. We briefly outline this below (see \cite{arxiv} for a detailed description).
 
 Recall from Section~\ref{sec:fullinfo} that $i^*\defeq \arg\max_{i\in
 \mathcal{N}} V(\{i\})$ is the element of maximum value, and $S_G$ is a set
-- 
cgit v1.2.3-70-g09d2

