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 2429–2528 of 3949. Source text is displayed literally.

2429The key hypothesis here is a common transformation of the returns2430being compared. A translation depending on the output may alter2431their order and must be included in the continuation itself.2432\par2433\chapter{Parallel games and higher comparisons}2434\label{ch:compositional-games}2435 2436Sequence describes a change of context through an intermediate2437interface. Parallel composition retains two interfaces and asks how2438the environment evaluates their joint output. A joint continuation2439can couple the decisions even when their play maps factor.2440 2441\section{Parallel composition}2442 2443For \(\mathcal G:(X,S)\to(Y,R)\) and2444\(\mathcal H:(U,T)\to(V,Q)\), their product has object types2445\((X\times U,S\times T)\) and \((Y\times V,R\times Q)\), and2446strategy set \(\Sigma_{\mathcal G}\times\Sigma_{\mathcal H}\).2447Its play and coplay are the products of the fixed-strategy lenses.2448Given a context with forward state \((x,u)\) and continuation2449\(k:Y\times V\to R\times Q\), an incumbent \((\sigma,\tau)\)2450produces \(y_* = P_{\mathcal G}(\sigma,x)\) and2451\(v_* = P_{\mathcal H}(\tau,u)\). Define the two continuations2452seen by the components as2453\begin{align*}2454 k_1(y)&=\pi_R k(y,v_*),&2455 k_2(v)&=\pi_Q k(y_*,v).2456\end{align*}2457The parallel best-response relation requires2458\((\sigma,\sigma')\in B_{\mathcal G}(x,k_1)\) and2459\((\tau,\tau')\in B_{\mathcal H}(u,k_2)\).2460A trial change in one component thus sees the same incumbent2461output from the other. In particular, even a product of games2462whose input states are independent can have coupled equilibrium2463conditions when the continuation is joint. If2464\(k(y,v)=(r(y),q(v))\), the continuations are \(r\) and \(q\)2465independently of \(\sigma,\tau\), so the equilibrium sets multiply.2466 2467\begin{proposition}[Interchange]2468Parallel composition commutes with sequential composition up to2469the canonical exchange of strategy factors. Its associativity,2470unit and symmetry are given by the corresponding product2471bijections.2472\end{proposition}2473 2474\begin{proof}2475Consider two chains, \(\mathcal G\) followed by \(\mathcal H\)2476and \(\widetilde{\mathcal G}\) followed by2477\(\widetilde{\mathcal H}\), with incumbent strategies2478\(\sigma,\tau\) and \(\widetilde\sigma,\widetilde\tau\),2479respectively. Let \(y_*,\widetilde y_*\) be the intermediate2480outputs, \(z_*,\widetilde z_*\) the final outputs, and \(k\) the2481joint 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 the