summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorThibaut Horel <thibaut.horel@gmail.com>2015-08-30 01:56:57 +0200
committerThibaut Horel <thibaut.horel@gmail.com>2015-08-30 01:56:57 +0200
commit7eb00cfe5a7b7a37491a7a1d8f48b0bf642136b3 (patch)
tree591c8f30519390ca09087f35026e71aec552644c
parent3c3d9ff1f0c76e1a859ad8a582fe79a12dbb7920 (diff)
downloadecon2099-7eb00cfe5a7b7a37491a7a1d8f48b0bf642136b3.tar.gz
Comment out counter-example
-rw-r--r--final/main.tex6
1 files changed, 3 insertions, 3 deletions
diff --git a/final/main.tex b/final/main.tex
index 9e2f3f3..6f751df 100644
--- a/final/main.tex
+++ b/final/main.tex
@@ -541,9 +541,9 @@ constrained case: the main idea is to use induction and
Lemma~\ref{lemma:marginal} to ``split'' the set of items and reduce to the
induction hypothesis.
-However, A. Rubinstein identifies the following counterexample to this potential approach:
-\begin{counterexample}[\citep{rubinstein2},Example 4 adapted] Consider a single-item auction with a single bidder, $m$ items, with each item having an ex-ante allocation probability of $\frac{1}{m^{1/4}}$
-\end{counterexample}
+% However, A. Rubinstein identifies the following counterexample to this potential approach:
+% \begin{counterexample}[\citep{rubinstein2},Example 4 adapted] Consider a single-item auction with a single bidder, $m$ items, with each item having an ex-ante allocation probability of $\frac{1}{m^{1/4}}$
+% \end{counterexample}
\bibliographystyle{abbrvnat}