Sequential Games

A mix of human-written and AI-generated textHuman understanding: some partsmath.FA — Functional Analysismath.CA — Classical Analysis and ODEs

Contributed by Rajesh Dachiraju ↗

Version 1 / Oct 15, 2026 / CC BY 4.0

Abstract

We formulate a time-series game in which each player chooses a hidden Markov model (HMM) as a mixed strategy. The HMM generates a finite, variable-length sequence of probability vectors, and the payoff is assigned to the completed game as the sum of its stage rewards. We prove a conditional Nash-equilibrium existence result for games with a common finite bound on output lengths. The proof applies a fixed-point argument to the best-response correspondence when each player's admissible HMM-density set is nonempty, convex, and compact in (L1)(L^1), and the completed-game payoff is bounded and measurable. A common BV bound together with (L1)(L^1)-closedness can ensure compactness; closure under suitable disjoint-state mixtures can ensure convexity. These properties do not follow from the HMM representation or BV regularity alone and must be verified for a specified model. Consistent estimation of HMM densities may support computation, but by itself does not establish equilibrium existence or replace the theorem's assumptions.

Provenance statement

ChatGPT was used to prepare this document.

References

  1. Fudenberg, Drew; Maskin, Eric. The Folk Theorem in Repeated Games with Discounting or with Incomplete Information. Econometrica, vol. 54, no. 3, pp. 533–554. 1986DOI
  2. Glicksberg, Irving L. A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points. Proceedings of the American Mathematical Society, vol. 3, no. 1, pp. 170–174. 1952DOI
  3. Kreps, David M.; Wilson, Robert. Sequential Equilibria. Econometrica, vol. 50, no. 4, pp. 863–894. 1982DOI
  4. Kuhn, Harold W. Extensive Games and the Problem of Information. Contributions to the Theory of Games, vol. 2, pp. 193–216. 1953
  5. Nash, John. Non-cooperative games. Annals of Mathematics, vol. 54, no. 2, pp. 286–295. 1951
  6. Rabiner, Lawrence R. A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proceedings of the IEEE, vol. 77, no. 2, pp. 257–286. 1989DOI
  7. Shapley, Lloyd S. Stochastic Games. Proceedings of the National Academy of Sciences, vol. 39, no. 10, pp. 1095–1100. 1953DOI

Version history

  1. v1Submitted by Rajesh DachirajuInitial depositCurrentOct 15, 2026