diff options
| author | Paul <Paul@Pauls-MacBook-Air.local> | 2015-05-12 18:03:51 -0400 |
|---|---|---|
| committer | Paul <Paul@Pauls-MacBook-Air.local> | 2015-05-12 18:03:51 -0400 |
| commit | 77c46b94395fec64421f181b5b3373c6bb9366c8 (patch) | |
| tree | af0304f68664c69c5773d970b3b5932f5f6c52ed /final/main.tex | |
| parent | 014a6b0119afdd1dc9982e2600a5f1b57f9c77f4 (diff) | |
| download | econ2099-77c46b94395fec64421f181b5b3373c6bb9366c8.tar.gz | |
Changing n to m to be consistent throughout
Diffstat (limited to 'final/main.tex')
| -rw-r--r-- | final/main.tex | 6 |
1 files changed, 3 insertions, 3 deletions
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 |