Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Infinite games"”.

  1. Characterization and computation of equilibria in infinite games

    Broadly, we study continuous games (those with continuous strategy spaces and utility functions) with a view towards computation of equilibria. We cover all of the game-theoretic background needed to understand these results in detail. Then we present new work, which can be divided into three …

    mit Repository record for Characterization and computation of equilibria in infinite games (opens in a new tab)

  2. Complexity in Infinite Games on Graphs and Temporal Constraint Networks

    … with Instantaneous Reaction Time, Update Games, Explicit McNaughton-Muller Games, Mean Payoff Games.

    trento Repository record for Complexity in Infinite Games on Graphs and Temporal Constraint Networks (opens in a new tab)

  3. The dichotomy in the determinacy of certain two-person infinite games with moves from {0,1}

    We investigate certain well-known games from the field of set theory; namely, certain two-person games of perfect information with small complexity and with small infinite length. We consider games with moves from the natural numbers and games with moves from {0,1}. We show that the determinacy of …

    unlv Repository record for The dichotomy in the determinacy of certain two-person infinite games with moves from {0,1} (opens in a new tab)

  4. Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen : Syntheseverfahren, Optimierung und Implementierung

    … thesis we develop methods for the solution of infinite games and present implementations of corresponding algorithms in the framework of a platform for the experimental study of automata theoretic algorithms. Our focus is on games with winning conditions that express certain liveness …

    aachen Repository record for Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen : Syntheseverfahren, Optimierung und Implementierung (opens in a new tab)

  5. Structures and dynamics

    "Our results are divided in three independent chapters. In Chapter 2, we show that if g is a generic isometry of a generic subspace X of the Urysohn metric space U then g does not extend to a full isometry of U. The same applies to the Urysohn sphere S. Let M be a Fraisse L-structure, where L is a …

    uiuc Repository record for Structures and dynamics (opens in a new tab)

  6. Games on pushdown graphs and extensions

    Two player games are a standard model of reactive computation, where e.g. one player is the controller and the other is the environment. A game is won by a player if she has a winning strategy, ie, if she can win every play. Given a finite description of the game, our aim is to compute the winner …

    aachen Repository record for Games on pushdown graphs and extensions (opens in a new tab)