From 77c46b94395fec64421f181b5b3373c6bb9366c8 Mon Sep 17 00:00:00 2001
From: Paul <Paul@Pauls-MacBook-Air.local>
Date: Tue, 12 May 2015 18:03:51 -0400
Subject: Changing n to m to be consistent throughout

---
 final/main.tex | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

(limited to 'final/main.tex')

diff --git a/final/main.tex b/final/main.tex
index 36f0b04..46e6c67 100644
--- a/final/main.tex
+++ b/final/main.tex
@@ -300,7 +300,7 @@ price. Then we have:
 
 As noted by \citep{yao}, the above mechanism $\M$ has the additional property of being
 $p$-exclusive, where $p$-exclusivity\footnote{\citep{yao} actually uses the
-notation $\beta$-exclusive for the same thing, but use $p$ here to have
+notation $\beta$-exclusive for the same thing, but use $p$ here to have
 consistent notations.} is defined as follows: for a vector $p = (p_1,\dots,p_m)$
 a mechanism is said to be $p$-exclusive if $x_i = 0$ whenever $p_i > t_i$. This
 is essentially saying that there is a reserve price for each item.
@@ -322,12 +322,12 @@ Lemma.
     = \big(F^{-1}(1-p_1), \dots, F^{-1}(1-p_m)\big).$$
 \end{lemma}
 
-\section{$n$-to-1 Bidders Reductions}
+\section{$m$-to-1 Bidders Reductions}
 
 The goal of this section is to compare the two ways of constraining the single
 buyer problem that we discussed: namely $p$-exclusivity and ex-ante allocation
 constraints and draw a parallel in how these two notions are used to construct
-$n$-to-1 bidders reductions in \citep{yao} and \citep{alaei} respectively.
+$m$-to-1 bidders reductions in \citep{yao} and \citep{alaei} respectively.
 
 
 The notion of $p$-exclusivity introduced by \citep{yao} was crucial in his
-- 
cgit v1.2.3-70-g09d2

