aboutsummaryrefslogtreecommitdiff
path: root/tex-stuff/math.tex
diff options
context:
space:
mode:
Diffstat (limited to 'tex-stuff/math.tex')
-rw-r--r--tex-stuff/math.tex4
1 files changed, 3 insertions, 1 deletions
diff --git a/tex-stuff/math.tex b/tex-stuff/math.tex
index e274e39..c515973 100644
--- a/tex-stuff/math.tex
+++ b/tex-stuff/math.tex
@@ -76,7 +76,7 @@ case, in other words, it is shown that $M \in \{0, G\}$. \\
Proof: & $A_1, A_2, B_1, B_2, d_1, d_2, r_1, r_2$
\end{tabular}
-\subsection{Protocol}
+\subsection{First Price Auction Protocol With Private Outcome}
Let $n$ be the number of participating bidders/agents in the protocol and $k$ be
the amount of possible valuations/prices for the sold good. Let $G$ be the
@@ -131,6 +131,8 @@ each $i, j$ and $h \neq i$ after having received all of them.
\item If $\exists w: V_{aw} = 0$, then bidder $a$ is the winner of the auction. $p_w$ is the selling price.
\end{enumerate}
+\subsection{First Price Auction Protocol With Public Outcome}
+