From 343839c8cf27bed56fbceb7898055398cff426c8 Mon Sep 17 00:00:00 2001 From: Paul Date: Wed, 13 May 2015 11:22:36 -0400 Subject: Fixing one k to m --- final/main.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'final/main.tex') diff --git a/final/main.tex b/final/main.tex index 39d9c06..6da4e59 100644 --- a/final/main.tex +++ b/final/main.tex @@ -371,7 +371,7 @@ $n$-to-1 bidders reductions in \citep{yao} and \citep{alaei} respectively. The notion of $p$-exclusivity introduced by \citep{yao} was crucial in his -reduction from the $k$-item $n$-buyer setting to the $m$-item single buyer +reduction from the $m$-item $n$-buyer setting to the $m$-item single buyer setting. He describes a mechanism known as \emph{Best-Guess Reduction}, which conducts $n$ single-buyer $m$-item auctions, using an IR-IC $p$-exclusive mechanism, for a particular value of $p$ drawn from the joint bid distribution -- cgit v1.2.3-70-g09d2