Indexed text attachment
games-and-information-in-higher-categories.tex
Source for Games and Information in Higher Categories
View paper · Download original file
Lines 1021–1120 of 6559. Source text is displayed literally.
10212-cells given by reparametrizations $\Pi'\to\Pi$. An open game is a lens parametrised by its strategy set1022together with a rule saying which parameters are acceptable. Capucci, Gavranovi\'c, Hedges and Rischel1023\cite{CGHR22} make this the definition: an \emph{arena} is a parametrised optic, the players are attached1024to the parameter boundary, and the equilibrium predicate is a selection function there. The reformulation1025separates the \emph{mechanics} of a game (the arena, which composes on the nose) from its \emph{agency} (who1026controls which parameters, and what they want).1027 1028\emph{Open games have morphisms.} Hedges \cite{Hed18} constructs a symmetric monoidal double category whose1029horizontal 1-cells are open games, whose vertical 1-cells are lenses and whose 2-cells are morphisms of1030open games; the identity type of the type of open games is then the type of invertible 2-cells, and1031\cref{prin:invariance} applies to it.1032 1033\section{What composition does not do}1034 1035It is important not to oversell. \Cref{def:og-comp} makes the equilibrium \emph{predicate} compositional:1036whether $(\sigma,\tau)$ is an equilibrium of $\mathcal{H}\circ\mathcal{G}$ is decided by consulting1037$E_{\mathcal{G}}$ and $E_{\mathcal{H}}$. It does not make the equilibrium \emph{set} of a composite a1038function of the equilibrium sets of its parts in any fixed contexts, because the context in which1039$\mathcal{G}$ is consulted depends on $\tau$. To compose, one must know each part's behaviour in \emph{every}1040context.1041 1042Seen from semantics this is as it should be: the meaning of an open term is its behaviour under all1043environments, and game theory itself insists that a strategy is a complete contingent plan. But it has two1044consequences that the reader should hold on to.1045 1046\begin{itemize}1047\item Open games give compositional \emph{modelling} and compositional \emph{equilibrium checking}. They do1048 not give compositional \emph{solving}, and cannot: computing a Nash equilibrium is hard for reasons that1049 have nothing to do with notation (\cref{ch:mixing}). The software built on this theory is, accordingly,1050 an equilibrium checker that is fed candidate profiles \cite{Hed24}.1051\item The equilibria of a composite can differ in kind from those of its parts. Multiplicity, coordination1052 failure and the need for refinement are emergent. A compositional language describes emergence1053 precisely; it does not abolish it.1054\end{itemize}1055 1056\section*{Notes}1057 1058Open games were introduced in \cite{GHWZ18} and in Hedges's thesis \cite{Hed16}; the survey-style account1059closest to the presentation here is \cite{BHZ19}, which also introduces contexts for optics. Lenses come1060from the theory of bidirectional transformations; their systematic generalization to optics is1061\cite{Ril18,CEGLMPR20}. Alternative axiomatizations that make the proof of \cref{thm:og-smc} itself1062compositional are given in \cite{AGGKLN21}, and the translation from extensive-form games into open games1063with agency is \cite{CGLN22}. Selection functions and their products are due to Escard\'o and Oliva1064\cite{EO10,EO11}; \cite{HOSWZ17} uses them to define equilibria for agents who do not maximize. A metric1065refinement, in which equilibrium predicates are relaxed by an $\epsilon$ budget compatibly with1066composition, is \cite{Gha25}. Earlier categorical treatments of games, which take games as objects rather1067than morphisms, are surveyed in \cite{TV23}.1068 1069\section*{Exercises}1070 1071\begin{exercise}1072Verify that composition of lenses is associative, and that a lens $I\to(X,S)$ is an element of $X$ while a1073lens $(Y,R)\to I$ is a function $Y\to R$.1074\end{exercise}1075\begin{exercise}1076Using \cref{def:og-comp}, compute the equilibrium predicate of the closed game of \cref{ex:og-seq} for the1077entry game in which player~1 chooses \emph{Out} (payoffs $(0,4)$) or \emph{In}, after which player~2 chooses1078\emph{Accommodate} $(1,2)$ or \emph{Fight} $(-1,0)$. List all equilibria and identify the one that is not1079subgame perfect.1080\end{exercise}1081\begin{exercise}1082Show that $(\varepsilon\otimes\delta)\otimes\gamma=\varepsilon\otimes(\delta\otimes\gamma)$ for selection1083functions, and that $\overline{\varepsilon\otimes\delta}(q)=\overline{\varepsilon}\bigl(x\mapsto\overline{\delta}(q(x,-))\bigr)$.1084Interpret the second identity when $\overline{\varepsilon}=\max$ and $\overline{\delta}=\min$.1085\end{exercise}1086\begin{exercise}1087For $\CC=\Set$ with cartesian product, prove that the coend defining $\Optic_\CC$ reduces to the set of lenses.1088(Use the bijection $\Set(X,M\times Y)\cong\Set(X,M)\times\Set(X,Y)$ and the co-Yoneda lemma.)1089\end{exercise}1090\begin{exercise}1091Let $\mathcal{G},\mathcal{G}'\colon I\to I$ be closed games. Show that the equilibria of $\mathcal{G}\otimes\mathcal{G}'$1092are the pairs of equilibria. Then give open games $\mathcal{G}\colon I\to(Y,R)$ and $\mathcal{H}\colon(Y,R)\to I$1093such that $\mathcal{H}\circ\mathcal{G}$ has an equilibrium $(\sigma,\tau)$ although $\sigma$ is not an equilibrium of1094$\mathcal{G}$ in the context induced by any $\tau'\neq\tau$.1095\end{exercise}1096%% ---- end ch/02-open.tex ----1097%% ---- begin ch/03-extensive.tex ----1098\chapter{The Extensive Form}\label{ch:extensive}1099 1100The strategic form hides time and information inside the word ``strategy''. The extensive form displays1101them: a tree of histories, a rule saying who moves where, and for each player a partition of her decision1102nodes into sets she cannot tell apart. This chapter sets up the extensive form in a way that makes its two1103structural hypotheses---that histories form a tree, and that players remember---into statements about a1104topos; it then confronts the question of \cref{ch:rules} in its sharpest classical form: when are two trees1105the same game?1106 1107\section{Trees are presheaves}1108 1109Let $\omega$ be the poset $0<1<2<\cdots$ regarded as a category.1110 1111\begin{definition}1112A \term{forest} is a presheaf $T\colon\omega^{\op}\to\Set$: a sequence of sets $T(n)$ with restriction maps1113$T(n+1)\to T(n)$. An element of $T(n)$ is a \term{node} of depth $n$, and its image in $T(n-1)$ is its1114\term{parent}. A forest is a \term{tree} if $T(0)=1$. The category of forests is the presheaf topos1115$\Trees=\Set^{\omega^{\op}}$.1116\end{definition}1117 1118That forests are exactly presheaves on $\omega$ is an old observation; the topos $\Trees$ has acquired the1119name \emph{topos of trees} in the semantics of guarded recursion \cite{BMSS12}, and we will use it in that1120role in \cref{ch:repetition}. Three pieces of tree vocabulary are topos vocabulary.