Independent scholarship · Open accessThe monthly digest

Indexed text attachment

evolutionary-game-theory-in-higher-categories.tex

Source for Evolutionary Game Theory in Higher Categories

View paper · Download original file

Lines 2481–2580 of 3949. Source text is displayed literally.

2481joint outer continuation. In either order of assembly the test at2482\(\mathcal H\) uses \(y_*\) and \(z\mapsto\pi_1 k(z,\widetilde z_*)\).2483The test at \(\mathcal G\) uses the continuation2484\[2485 y\longmapsto C_{\mathcal H}2486       \bigl(\tau,y,\pi_1 k(P_{\mathcal H}(\tau,y),\widetilde z_*)\bigr).2487\]2488Indeed, composing within the first chain propagates the first2489outer continuation through \(\mathcal H\). Composing across the2490parallel pair first propagates \(k\) through the product lens,2491and then freezes the second intermediate value at2492\(\widetilde y_*\). Its downstream output is precisely2493\(\widetilde z_*\). The formulas for the other chain follow by2494using \(\pi_2\) and holding \(z_*\) fixed. Thus all four response2495tests agree. The play and coplay maps agree because composition of2496product lenses is componentwise.2497 2498For any number of parallel factors the continuation for one2499factor fixes all other incumbent outputs and projects to the2500return for that factor. This gives the same formula for either2501parenthesization and after permutation of factors. The singleton2502unit introduces neither another output choice nor another return2503choice. Coherence follows from the corresponding equalities of2504tuples.2505\end{proof}2506 2507\section{Strategy maps and two-dimensional structure}2508 2509One can preserve more information by keeping morphisms between2510games. For games \(\mathcal G,\mathcal G'\) on the same interface,2511take a map \(\phi:\Sigma_{\mathcal G}\to\Sigma_{\mathcal G'}\)2512that preserves play and coplay at every state and return. Require2513also that2514\[2515 (\sigma,\eta)\in B_{\mathcal G}(x,k)2516 \ \Longrightarrow\2517 (\phi(\sigma),\phi(\eta))\in B_{\mathcal G'}(x,k).2518\]2519This gives a category for each pair of interfaces. Composition of2520strategy maps preserves the relation by transitivity of implication,2521and identity maps preserve all the specified data. Products of2522these maps preserve the sequential and parallel response2523formulas. For the sequential case, play preservation gives2524the same intermediate incumbent state and coplay preservation2525gives the same transported continuation. One can then apply2526response preservation separately in the two games. The parallel2527argument uses preservation of the two incumbent outputs.2528This yields a bicategorical description after retaining the2529canonical product reassociations as invertible cells.2530For a more general morphism allowing lenses between the2531boundary interfaces, see the double category of open games2532in \cite{hedges-morphisms}.2533 2534For sequential composition, the diagram below holds at every2535upstream state \(x\). Set \(E_x(\sigma,\tau)=2536P_{\mathcal H}(\tau,P_{\mathcal G}(\sigma,x))\), where2537\(Z\) is the final forward output space. Primes denote the2538corresponding maps for the target games.2539\[2540\begin{tikzcd}[column sep=large,row sep=large]2541\Sigma_{\mathcal G}\times\Sigma_{\mathcal H}2542  \arrow[r,"E_x"{above}]\arrow[d,"\phi\times\psi"']2543  & Z\arrow[d,equal]\\2544\Sigma_{\mathcal G'}\times\Sigma_{\mathcal H'}2545  \arrow[r,"E'_x"{above}]2546  & Z2547\end{tikzcd}2548\]2549The backward returns commute by coplay preservation. These2550two identities compare the boundary behavior independently of2551whether a pair of strategies satisfies the response tests.2552 2553Response-preserving maps carry equilibria to equilibria:2554one applies the implication to \((\sigma,\sigma)\).2555A noninvertible map can identify equilibria or fail to reach2556some equilibria of the target. An isomorphism of games2557instead preserves and reflects the response tests in every2558context. The geometric information carried by a morphism is2559therefore different from a claim about the size or structure2560of its image on equilibrium sets. This distinction matters2561when strategy representations are quotiented or multiple2562agents share an interface.2563 2564\section{Probability and continuation transport}2565 2566For a fixed strategy, one may model forward play by a2567probability kernel. For finitely supported probabilities2568\(P(y\mid x)\) and \(Q(z\mid y)\), their forward composite is2569\[2570       (QP)(z\mid x)=\sum_y P(y\mid x)\,Q(z\mid y).2571\]2572This has unit given by a point mass at the input. Associativity2573is the reassociation of the joint sum over intermediate values.2574If a continuation takes values in \(\mathbb R\), this kernel2575transports it by expectation. Indeed2576\[2577   \sum_y P(y\mid x)\sum_z Q(z\mid y)k(z)2578   =\sum_z (QP)(z\mid x)k(z).2579\]2580Thus a component that compares expected returns can use the