Independent scholarship · Open accessThe monthly digest

Indexed text attachment

games-and-information-in-higher-categories.tex

Source for Games and Information in Higher Categories

View paper · Download original file

Lines 4661–4760 of 6559. Source text is displayed literally.

4661$\tfrac16$ under efficiency: a fraction $\tfrac{27}{32}$ is realized. Myerson and Satterthwaite showed that4662this is the best that any mechanism satisfying the other three conditions can do. The parties fail to4663trade when the gains are positive but small, each having shaded her bid to improve the price.4664\end{example}4665 4666The Coase theorem says that, absent transaction costs, parties bargain to an efficient outcome whatever4667the initial assignment of rights. \Cref{thm:MyS} identifies private information as a transaction cost in4668this sense, and an irreducible one. It also shows that the assignment of rights matters: if ownership is4669shared rather than assigned to one party, the participation constraints are relaxed and efficient4670dissolution can become possible \cite{CGK87}.4671 4672\section*{Notes}4673 4674The axiomatic theory is Nash's \cite{Nas50b}; the monotonic alternative is Kalai and Smorodinsky's4675\cite{KS75}. The strategic theory is due to Rubinstein \cite{Rub82}, following St\aa hl's finite-horizon4676analysis; the proof given is Shaked and Sutton's \cite{SS84b}. The relation between the two, and the role of4677outside options, are worked out in \cite{BRW86}. The impossibility theorem is \cite{MS83}; the linear4678equilibrium of the double auction is from Chatterjee and Samuelson \cite{CS83}; efficient dissolution of4679partnerships is \cite{CGK87}. A standard text is \cite{OR90}.4680 4681\section*{Exercises}4682 4683\begin{exercise}4684Verify \cref{ex:nash-risk}, and compute the Nash solution when player~2's utility is $(1-x)^\gamma$ with4685$0<\gamma\le1$. How does her share vary with $\gamma$?4686\end{exercise}4687\begin{exercise}4688Show that the Nash solution is equivariant under $(s_1,s_2)\mapsto(\alpha_1s_1+\beta_1,\alpha_2s_2+\beta_2)$, and give an4689example showing that it is not monotone with respect to expansions of $S$.4690\end{exercise}4691\begin{exercise}4692Compute the finite-horizon shares $x_T$ for $T=1,\dots,5$ and $\delta=0.9$, and verify geometric convergence4693to $\frac{1}{1+\delta}$ at rate $\delta$.4694\end{exercise}4695\begin{exercise}4696In the infinite-horizon game suppose that player~2, whenever she rejects an offer, may leave and take an4697outside option worth $w$. Find the subgame perfect equilibrium for $w<\delta_2(1-\delta_1x^*)$ and for larger4698$w$.4699\end{exercise}4700\begin{exercise}4701Verify that the strategies of \cref{ex:CS} are mutual best responses, and compute the expected gains from4702trade.4703\end{exercise}4704\begin{exercise}4705For $v$ and $c$ uniform on $[0,1]$, compute the expected budget deficit of the Groves mechanism with4706efficient trade in which the worst types get zero, and confirm that it equals $\E[(v-c)^+]=\tfrac16$.4707\end{exercise}4708%% ---- end ch/16-bargaining.tex ----4709%% ---- begin ch/17-auctions.tex ----4710\chapter{Auctions}\label{ch:auctions}4711 4712An auction is a mechanism for selling to buyers whose willingness to pay the seller does not know. It is4713the part of the subject where theory, experiment and practice are closest, and where the apparatus of4714\cref{ch:mechanism} pays its way most visibly: the central theorem of the field is one line once payments4715are seen as potentials.4716 4717\section{Formats, and two kinds of equivalence}4718 4719Four formats are standard. In the \emph{English} auction the price rises until one bidder remains. In the4720\emph{Dutch} auction the price falls until someone claims the object. In the \emph{first-price} sealed-bid4721auction the highest bidder wins and pays her bid; in the \emph{second-price} auction she pays the highest4722losing bid. Values are \emph{private} if each bidder knows her own value and it does not depend on what4723others know, and \emph{common} if the object has the same unknown value to all and bidders hold different4724estimates of it.4725 4726\begin{proposition}\label{prop:auction-equiv}\Scl[\cite{Vic61}]4727\begin{enumerate}[label=(\roman*)]4728\item The Dutch and first-price auctions have the same reduced strategic form.4729\item With private values, the English and second-price auctions each have an equilibrium in weakly4730  dominant strategies, with the same outcome.4731\end{enumerate}4732\end{proposition}4733 4734The two statements are equivalences of different types, in the sense of \cref{sec:thompson}. In a Dutch4735auction a strategy is a price at which to stop the clock, nothing is learned before the auction ends, and4736the bidder who names the highest price wins and pays it: the tree differs from that of the first-price4737auction by Thompson moves, and the two are the same point of $\EFG_{\mathrm{T}}$. This holds for any values4738and any information. The second equivalence is not an identification of games. An English auction reveals4739when others drop out, and has many more strategies than a sealed bid. With private values that information4740is useless and the outcomes coincide; with common values it is valuable and they do not. One equivalence4741is of games, the other of solutions under a hypothesis.4742 4743\section{Private values}4744 4745Let $n$ bidders have values drawn independently from a distribution $F$ with density $\phi$ on $[0,\bar v]$,4746and let them be risk neutral.4747 4748\emph{Second-price.} Bidding one's value is weakly dominant: the bid determines whether one wins, not what4749one pays, and one wants to win exactly when the price is below one's value. The seller's revenue is the4750second-highest value.4751 4752\emph{First-price.} A bidder must shade her bid. Suppose the others use an increasing strategy $b(\cdot)$. A4753bidder with value $v$ who bids as if her value were $z$ wins with probability $F(z)^{n-1}$ and earns4754$(v-b(z))F(z)^{n-1}$. Optimality at $z=v$ gives a differential equation whose solution is4755\[ b(v)=v-\frac{\int_0^vF(s)^{n-1}\,ds}{F(v)^{n-1}}=\E\bigl[\,Y\mid Y<v\,\bigr], \]4756where $Y$ is the highest of the other $n-1$ values. Each bidder bids what she expects the runner-up's4757value to be, conditional on winning. For the uniform distribution on $[0,1]$, $b(v)=\frac{n-1}{n}v$.4758 4759\section{Revenue equivalence}4760