diff options
| author | Paul <Paul@Pauls-MacBook-Air.local> | 2015-05-11 20:41:34 -0400 |
|---|---|---|
| committer | Paul <Paul@Pauls-MacBook-Air.local> | 2015-05-11 20:41:34 -0400 |
| commit | 9be0d4b4b08d5d6e8d8e102d9a2158e73b0378f7 (patch) | |
| tree | 0fba84ab97ba8e0295c74f4c42340a5b7ea26a76 /final | |
| parent | a4b9f75ef13e35d87d5b73c774117ba7022379eb (diff) | |
| download | econ2099-9be0d4b4b08d5d6e8d8e102d9a2158e73b0378f7.tar.gz | |
Minor updates
Diffstat (limited to 'final')
| -rw-r--r-- | final/main.bib | 2 | ||||
| -rw-r--r-- | final/main.tex | 6 |
2 files changed, 4 insertions, 4 deletions
diff --git a/final/main.bib b/final/main.bib index a0607dd..7ade571 100644 --- a/final/main.bib +++ b/final/main.bib @@ -37,7 +37,7 @@ } @book{hartline, - author = {Jason Hartline}, + author = {Jason D. Hartline}, title = {Mechanism Design and Approximation}, year = {2014}, publisher={Available at http://jasonhartline.com/MDnA/} diff --git a/final/main.tex b/final/main.tex index 3816d4a..066fabe 100644 --- a/final/main.tex +++ b/final/main.tex @@ -113,7 +113,7 @@ Problem~\ref{eq:opt}: which expresses that the ex-ante allocation probability is upper-bounded by $\hat{x}$. -We use the notation from \cite{alaei} where $R(\hat{x})$ denotes the revenue +We use the notation from \cite{alaei}, where $R(\hat{x})$ denotes the revenue obtained by the optimal mechanism solution to Problem~\ref{eq:opt} with ex-ante allocation constraint $\hat{x}$ given by \eqref{eq:ea}. The main question underlying this work can then be formulated as: @@ -124,8 +124,8 @@ $\hat{x}$ and whose revenue is a constant approximation to $R(\hat{x})$?} \subsection{Examples and Motivations} -\paragraph{}Note that when $\hat{x} = (1,\ldots,1)$, \eqref{eq:ea} does not further -constrain Problem~\ref{eq:opt}, i.e. the constraint is trivially satisfied. In +\paragraph{}Note that when $\hat{x} = (1,\ldots,1)$, the ex-ante allocation constraint \eqref{eq:ea} does not further +constrain the optimization problem given by Equation \ref{eq:opt}, i.e. the constraint is trivially satisfied. In this case, as discussed above, the mechanism described in \cite{babaioff} provides a 6-approximation to $R((1,...,1))$. |