Fix a compilation error

1 files changed, 1 insertions, 1 deletions

diff --git a/related.tex b/related.tex
index a78693b..274f4fa 100755
--- a/related.tex
+++ b/related.tex
@@ -40,7 +40,7 @@ Posted price, rather than direct revelation mechanisms, are also studied in \cit
 \noindent\emph{Monotone Approximations in Combinatorial Auctions.}
 Relaxations of combinatorial problems are prevalent
 in \emph{combinatorial auctions}, 
-in which an auctioneer aims at maximizing the social welfare..e.}. As noted by \citeN{archer-approximate},
+in which an auctioneer aims at maximizing the social welfare. As noted by \citeN{archer-approximate},
 approximations to this maximization must preserve incentive compatibility. Most approximation
 algorithms do not preserve this property, hence specific relaxations, and corresponding roundings to an integral solution, must be
 constructed \cite{archer-approximate,lavi-truthful,dughmi-truthful,briest-approximation}. Because of the specificity of our relaxation, and because we seek a determinist mechanism and $\delta$-truthfulness, not truthfulness-in-expectation, none of the techniques present in these works apply to our setting.