Dynamic, Topological & Designed Games

← Back to Domain-Specific Families

Abstractions about games with time, topology, uncertainty, natural moves, strategic foresight, algorithmic opponents, and deliberately designed rules.

9 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Axiom of determinacy — A set-theoretic axiom asserting that every infinite two-player perfect-information game on natural numbers has a winning strategy for one player.
• Differential game — A continuous-time strategic game whose shared state evolves by differential equations controlled by multiple players with distinct objectives.
• Farsightedness (game theory) — A strategic solution assumption under which players evaluate deviations by anticipating subsequent moves and terminal outcomes rather than only immediate payoffs.
• Game design — The iterative process of creating and balancing a game's goals, rules, mechanics, systems, information and player experience across physical or digital media.
• Markov strategy — A dynamic-game strategy whose action depends only on the current payoff-relevant state rather than the full history.
• Move by nature — A chance move in an extensive-form game that selects an outcome according to a specified probability distribution without strategic preferences.
• Outcome (game theory) — A terminal consequence of a strategic interaction—such as an action profile, terminal history, allocation or payoff vector—produced by the players' strategies and the game's rules.
• Paranoid algorithm — A multiplayer game-tree search that treats every opponent as a single coalition minimizing the focal player’s payoff.
• Topological game — An infinite perfect-information game on a topological space whose moves are points, sets or covers and whose winning condition encodes a topological property.