final

1 files changed, 12 insertions, 12 deletions

diff --git a/slides/BudgetFeasibleExperimentalDesign.tex b/slides/BudgetFeasibleExperimentalDesign.tex
index bb39ebd..aef36b0 100644
--- a/slides/BudgetFeasibleExperimentalDesign.tex
+++ b/slides/BudgetFeasibleExperimentalDesign.tex
@@ -12,7 +12,7 @@
 
 \title[EconCS Seminar]{Budget Feasible Mechanisms for Experimental Design}
 \author[Horel, Ioannidis, Muthu]{Thibaut Horel$^*$, \alert{Stratis Ioannidis}$^\dagger$, and S. Muthukrishnan$^\ddagger$}
-\institute[Technicolor]{$^*$INRIA-ENS, $^\dagger$Technicolor, $^\ddagger$Rutgers University}
+\institute[]{$^*$INRIA-ENS, $^\dagger$Technicolor, $^\ddagger$Rutgers University}
 \setbeamercovered{transparent}
 \setbeamertemplate{navigation symbols}{}
 %\AtBeginSection[]
@@ -40,16 +40,16 @@
 \section{Introduction}
 
 
-\begin{frame}{Motivation:A Data Market}
+\begin{frame}{Motivation: A Data Market}
    \begin{center}
-        \includegraphics<1>[scale=0.4]{st1a.pdf}
-        \includegraphics<2>[scale=0.4]{st1b.pdf}
-        \includegraphics<3>[scale=0.4]{st1c.pdf}
-        \includegraphics<4>[scale=0.4]{st1d.pdf}
-        \includegraphics<5>[scale=0.4]{st1dd.pdf}
-        \includegraphics<6>[scale=0.4]{st1e.pdf}
-        \includegraphics<7>[scale=0.4]{st1f.pdf}
-        \includegraphics<8>[scale=0.4]{st1g.pdf}
+        \includegraphics<1>[scale=0.4]{st31a.pdf}
+        \includegraphics<2>[scale=0.4]{st31b.pdf}
+        \includegraphics<3>[scale=0.4]{st31c.pdf}
+        \includegraphics<4>[scale=0.4]{st31d.pdf}
+        \includegraphics<5>[scale=0.4]{st31dd.pdf}
+        \includegraphics<6>[scale=0.4]{st31e.pdf}
+        \includegraphics<7>[scale=0.4]{st31f.pdf}
+ %       \includegraphics<8>[scale=0.4]{st31g.pdf}
    \end{center}
 
  %   \begin{center}
@@ -84,7 +84,7 @@
         \item Linear Regression 
 	    \pause
 	    \begin{itemize}
-                \item We present a \alert{deterministic, poly-time}, truthful, budget feasible, 12.98-approximate mechanism. 
+                \item We present a deterministic, poly-time, truthful, budget feasible, 12.98-approximate mechanism. 
 	%	\pause
 	%	\vspace*{0.5cm}
 	%	\item Previous results:
@@ -749,7 +749,7 @@ $L(\lambda^*)$ is:
 \uncover<2->{For all $\lambda\in [0,1]^N$, we show that $L(\lambda) \leq 2F(\lambda)$, where $F$ the multi-linear relaxation of $V$.\\
 \bigskip}
 \uncover<3->{
-We show this by establishing first that $\frac{\partial_i F(\lambda)}{\partial_i L(\lambda)}\geq \frac{1}{2}$, and arguing about the minima of $\frac{F(\lambda)}{L(\lambda)}$ over the simplex.\\
+We show this by establishing first that $\frac{\partial F/\partial \lambda_i}{\partial L/\partial \lambda_i}\geq \frac{1}{2}$, and arguing about the minima of $\frac{F(\lambda)}{L(\lambda)}$ over the simplex.\\
 \bigskip
 }
 \uncover<4>{Finally, we show that $F(\lambda^*)\leq OPT+V(\{i^*\})$ through pipage rounding.}