Indexed text attachment
evolutionary-game-theory-in-higher-categories.tex
Source for Evolutionary Game Theory in Higher Categories
View paper · Download original file
Lines 3921–3949 of 3949. Source text is displayed literally.
3921\bibitem{hofbauer-sandholm-stable} J. Hofbauer and W. H. Sandholm. Stable games and their dynamics. \emph{Journal of Economic Theory} 144 (2009), 1665--1693.e4. \href{https://doi.org/10.1016/j.jet.2009.01.007}{doi:10.1016/j.jet.2009.01.007}.3922\bibitem{sandholm-pairwise} W. H. Sandholm. Pairwise comparison dynamics and evolutionary foundations for Nash equilibrium. \emph{Games} 1 (2010), 3--17. \href{https://doi.org/10.3390/g1010003}{doi:10.3390/g1010003}.3923\bibitem{sandholm-population} W. H. Sandholm. \emph{Population Games and Evolutionary Dynamics}. MIT Press, 2010. \href{https://mitpress.mit.edu/9780262195874/population-games-and-evolutionary-dynamics/}{Publisher}.3924\bibitem{aubin-cellina} J.-P. Aubin and A. Cellina. \emph{Differential Inclusions: Set-Valued Maps and Viability Theory}. Springer, 1984. \href{https://doi.org/10.1007/978-3-642-69512-4}{doi:10.1007/978-3-642-69512-4}.3925\bibitem{hofbauer-sorin} J. Hofbauer and S. Sorin. Best response dynamics for continuous zero-sum games. \emph{Discrete and Continuous Dynamical Systems B} 6 (2006), 215--224. \href{https://doi.org/10.3934/dcdsb.2006.6.215}{doi:10.3934/dcdsb.2006.6.215}.3926\bibitem{ohtsuki-nowak} H. Ohtsuki and M. A. Nowak. The replicator equation on graphs. \emph{Journal of Theoretical Biology} 243 (2006), 86--97. \href{https://doi.org/10.1016/j.jtbi.2006.06.004}{doi:10.1016/j.jtbi.2006.06.004}.3927\bibitem{moran-random} P. A. P. Moran. Random processes in genetics. \emph{Mathematical Proceedings of the Cambridge Philosophical Society} 54 (1958), 60--71. \href{https://doi.org/10.1017/S0305004100033193}{doi:10.1017/S0305004100033193}.3928\bibitem{young-conventions} H. P. Young. The evolution of conventions. \emph{Econometrica} 61 (1993), 57--84. \href{https://doi.org/10.2307/2951783}{doi:10.2307/2951783}.3929\bibitem{leighton-rivest} F. T. Leighton and R. L. Rivest. Estimating a probability using finite memory. \emph{IEEE Transactions on Information Theory} 32 (1986), 733--742. \href{https://doi.org/10.1109/TIT.1986.1057250}{doi:10.1109/TIT.1986.1057250}.3930\bibitem{kurtz-limit} T. G. Kurtz. Solutions of ordinary differential equations as limits of pure jump Markov processes. \emph{Journal of Applied Probability} 7 (1970), 49--58. \href{https://doi.org/10.2307/3212147}{doi:10.2307/3212147}.3931\bibitem{benaim-weibull} M. Bena\"im and J. W. Weibull. Deterministic approximation of stochastic evolution in games. \emph{Econometrica} 71 (2003), 873--903. \href{https://doi.org/10.1111/1468-0262.00429}{doi:10.1111/1468-0262.00429}.3932\bibitem{kemeny-snell} J. G. Kemeny and J. L. Snell. \emph{Finite Markov Chains}. Springer, 1976. \href{https://link.springer.com/book/9780387901923}{Publisher}.3933\bibitem{fritz-markov} T. Fritz. A synthetic approach to Markov kernels, conditional independence, and theorems on sufficient statistics. \emph{Advances in Mathematics} 370 (2020), 107239. \href{https://doi.org/10.1016/j.aim.2020.107239}{doi:10.1016/j.aim.2020.107239}.3934\bibitem{ghani-open-games} N. Ghani, J. Hedges, V. Winschel, and P. Zahn. Compositional game theory. \emph{Proceedings of LICS} (2018), 472--481. \href{https://doi.org/10.1145/3209108.3209165}{doi:10.1145/3209108.3209165}.3935\bibitem{hedges-morphisms} J. Hedges. Morphisms of open games. \emph{Electronic Notes in Theoretical Computer Science} 341 (2018), 151--177. \href{https://doi.org/10.1016/j.entcs.2018.11.008}{doi:10.1016/j.entcs.2018.11.008}.3936\bibitem{bolt-bayesian} J. Bolt, J. Hedges, and P. Zahn. Bayesian open games. \emph{Compositionality} 5 (2023), no.~9. \href{https://doi.org/10.32408/compositionality-5-9}{doi:10.32408/compositionality-5-9}.3937\bibitem{vagner-wiring} D. Vagner, D. I. Spivak, and E. Lerman. Algebras of open dynamical systems on the operad of wiring diagrams. \emph{Theory and Applications of Categories} 30 (2015), 1793--1822. \href{https://tac.mta.ca/tac/volumes/30/51/30-51abs.html}{Journal}.3938\bibitem{baez-pollard-reactions} J. C. Baez and B. S. Pollard. A compositional framework for reaction networks. \emph{Reviews in Mathematical Physics} 29 (2017), 1750028. \href{https://doi.org/10.1142/S0129055X17500283}{doi:10.1142/S0129055X17500283}.3939\bibitem{baez-courser-markov} J. C. Baez and K. Courser. Coarse-graining open Markov processes. \emph{Theory and Applications of Categories} 33 (2018), 1223--1268. \href{https://tac.mta.ca/tac/volumes/33/39/33-39abs.html}{Journal}.3940\bibitem{cardelli-lumping} L. Cardelli, G. Squillace, M. Tribastone, M. Tschaikowski, and A. Vandin. Formal lumping of polynomial differential equations through approximate equivalences. \emph{Journal of Logical and Algebraic Methods in Programming} 134 (2023), 100876. \href{https://doi.org/10.1016/j.jlamp.2023.100876}{doi:10.1016/j.jlamp.2023.100876}.3941\bibitem{lurie-htt} J. Lurie. \emph{Higher Topos Theory}. Annals of Mathematics Studies 170, Princeton University Press, 2009. \href{https://www.math.ias.edu/~lurie/papers/HTT.pdf}{Author manuscript}.3942\bibitem{nss} T. Nikolaus, U. Schreiber, and D. Stevenson. Principal $\infty$-bundles: general theory. \emph{Journal of Homotopy and Related Structures} 10 (2015), 749--801. \href{https://doi.org/10.1007/s40062-014-0083-6}{doi:10.1007/s40062-014-0083-6}.3943\bibitem{freund-schapire} Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. \emph{Journal of Computer and System Sciences} 55 (1997), 119--139. \href{https://doi.org/10.1006/jcss.1997.1504}{doi:10.1006/jcss.1997.1504}.3944\bibitem{arora-mw} S. Arora, E. Hazan, and S. Kale. The multiplicative weights update method: a meta-algorithm and applications. \emph{Theory of Computing} 8 (2012), 121--164. \href{https://doi.org/10.4086/toc.2012.v008a006}{doi:10.4086/toc.2012.v008a006}.3945\bibitem{mertikopoulos-sandholm} P. Mertikopoulos and W. H. Sandholm. Learning in games via reinforcement and regularization. \emph{Mathematics of Operations Research} 41 (2016), 1297--1324. \href{https://doi.org/10.1287/moor.2016.0778}{doi:10.1287/moor.2016.0778}.3946\bibitem{lean4} L. de Moura and S. Ullrich. The Lean 4 theorem prover and programming language. \emph{Automated Deduction -- CADE 28} (2021), 625--635. \href{https://doi.org/10.1007/978-3-030-79876-5_37}{doi:10.1007/978-3-030-79876-5\_37}.3947\end{thebibliography}3948\end{document}3949