summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2012-10-27 09:26:09 -0700
committerThibaut Horel <thibaut.horel@gmail.com>2012-10-27 09:26:09 -0700
commitcac5ada8f9c9de77944d061476f704fbe112d924 (patch)
tree0cde0a2b9edac32533a96937503c979eb217a5ad
parenta06ec5611efa6f08bcf6782c0657e2d04a47c3e2 (diff)
downloadrecommendation-cac5ada8f9c9de77944d061476f704fbe112d924.tar.gz
Some more cleanup (probably last commit before I leave)
-rw-r--r--paper.tex9
1 files changed, 6 insertions, 3 deletions
diff --git a/paper.tex b/paper.tex
index 55e7209..1ba804c 100644
--- a/paper.tex
+++ b/paper.tex
@@ -18,7 +18,7 @@
\newcommand{\mse}{\mathop{\mathrm{MSE}}}
\DeclareMathOperator{\trace}{tr}
\DeclareMathOperator*{\argmax}{arg\,max}
-\title{Budgeted mechanism for optimal experiment design}
+\title{Budgeted Auctions for Experiment Design}
\begin{document}
\maketitle
@@ -218,18 +218,21 @@ the value function.
\subsection{Auction}
-Explain the optimization problem, why it has to be formulated as an auction
+TODO Explain the optimization problem, why it has to be formulated as an auction
problem. Explain the goals:
\begin{itemize}
\item truthful
\item individually rational
\item budget feasible
\item has a good approximation ratio
+
+TODO Explain what is already known: it is ok when the function is submodular. When
+should we introduce the notion of submodularity?
\end{itemize}
\section{Main result}
-Explain:
+TODO Explain:
\begin{itemize}
\item the mechanism uses the greedy heuristic
\item we know that the maximum of greedy and meatiest guy is a good