summaryrefslogtreecommitdiffstats
path: root/problem.tex
diff options
context:
space:
mode:
authorStratis Ioannidis <stratis@stratis-Latitude-E6320.(none)>2012-11-05 07:15:03 -0800
committerStratis Ioannidis <stratis@stratis-Latitude-E6320.(none)>2012-11-05 07:15:03 -0800
commit2929dffcdea48cb437e8f8e794c674baee94a8ca (patch)
tree58979b7679db581c7b60865982d037ae3235298e /problem.tex
parente93cb61907ed3b50712b8ca2e25457716041b8df (diff)
downloadrecommendation-2929dffcdea48cb437e8f8e794c674baee94a8ca.tar.gz
muthu fix edits
Diffstat (limited to 'problem.tex')
-rw-r--r--problem.tex9
1 files changed, 0 insertions, 9 deletions
diff --git a/problem.tex b/problem.tex
index a0a4419..8b1cb2b 100644
--- a/problem.tex
+++ b/problem.tex
@@ -108,19 +108,10 @@ c_{-i})$ implies $i\in f(c_i', c_{-i})$, and (b)
%\end{enumerate}
\end{lemma}
\fussy
-<<<<<<< HEAD
Myerson's Theorem
% is particularly useful when designing a budget feasible truthful mechanism, as it
allows us to focus on designing a monotone allocation function. Then, the
mechanism will be truthful as long as we give each agent her threshold payment---the caveat being that the latter need to sum to a value below $B$.
-=======
-Myerson's Theorem is particularly useful when designing a budget feasible truthful
-mechanism. One can focus on designing a monotone allocation function, and the
-resulting mechanism will be truthful as long as each agent is given her
-threshold payment---the caveat being that the latter need to sum to a value
-below $B$.
->>>>>>> c29302b25adf190f98019eb8ce5f79b10b66d54d
-
\subsection{Budget Feasible Experimental Design}
We approach the problem of optimal experimental design from the