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 9 of 9 for “"n-player"”.

  1. The cybernetics of nonzero sum games – the prisoner's dilemma reinterpreted as a pure conflict game with nature, with empirical applications

    … thesis a new solution concept is developed for n-player, nonzero sum games. The solution concept is based in reinterpreting the n-player nonzero sum game into 2-player zero sum games. The n-player nonzero sum game is first rewritten as an n + 1 player coalition game. The definition of zero sum …

    brunel Repository record for The cybernetics of nonzero sum games – the prisoner's dilemma reinterpreted as a pure conflict game with nature, with empirical applications (opens in a new tab)

  2. Analysis of non-unique solutions in mean field games

    … The symmetric Markov perfect information N-player game is considered and restricted to finite states and continuous time. The players' transitions are random with a parameter determined by their control. There is a unique joint distribution of the players for the symmetric Markov perfect …

    uiuc Repository record for Analysis of non-unique solutions in mean field games (opens in a new tab)

  3. COARSE CORRELATED EQUILIBRIA IN CONTINUOUS-TIME MEAN FIELD GAMES

    … arise as the limit formulation of symmetric N-player games with mean field interactions, and they act as a treatable approximation of such games, when the numbers of players is large enough. The usual notion of MFG solution can be regarded as the infinitely many players counterpart of the …

    milano Repository record for COARSE CORRELATED EQUILIBRIA IN CONTINUOUS-TIME MEAN FIELD GAMES (opens in a new tab)

  4. COMPUTATIONAL AND EXPERIMENTAL STUDIES ON NETWORK FORMATION

    … and validated agent-based models, theoretical N-player network formation games investigated through agent-based models, and laboratory experiments. Although our strategy was not to apply methodological triangulation straightforwardly, our ambition is that these examples can testify to the …

    milano Repository record for COMPUTATIONAL AND EXPERIMENTAL STUDIES ON NETWORK FORMATION (opens in a new tab)

  5. Stochastically Stable States for Perturbed Repeated Play of Coordination Games

    Perturbed repeated play of a two-player two-move coordination game is modeled as an irreducible Markov process on a set of history states describing the most recent m stages of play. At every stage, each player draws a sample from the history state to forecast his opponent's behavior and either …

    uiuc Repository record for Stochastically Stable States for Perturbed Repeated Play of Coordination Games (opens in a new tab)

  6. Stochastic singular control: existence, characterization and approximation of solutions in cost minimization problems and games

    … and approximation of Nash equilibria in N-player stochastic games of multi-dimensional singular control with submodular costs. In a not necessarily Markovian setting, we establish the existence of Nash equilibria via Tarski's fixed point theorem, and we propose an algorithm to determine a …

    bielefeld Repository record for Stochastic singular control: existence, characterization and approximation of solutions in cost minimization problems and games (opens in a new tab)

  7. Optimal choices: mean field games with controlled jumps and optimality in a stochastic volatility model

    … games represent the limit, as the number of players tends to infinity, of nonzero-sum stochastic differential games. Under the assumption that the former admit a regular Markovian solution, an approximate Nash equilibrium for the corresponding n-player games is constructed, and the rate of …

    trento Repository record for Optimal choices: mean field games with controlled jumps and optimality in a stochastic volatility model (opens in a new tab)

  8. On two utility maximization problems

    … (Chapter 3) studies Nash equilibria in an N-player game of utility maximization under relative performance criteria. The main and unifying approach to the two problems is convex duality in a semimartingale market model. Utility maximization under ratchet and drawdown constraints on …

    texas Repository record for On two utility maximization problems (opens in a new tab)

  9. Generalized Nash games with shared constraints: Existence, efficiency, refinement and equilibrium constraints

    … Our focus is on a class of noncooperative N -player games, called generalized Nash games with shared constraints, or simply, shared-constraint games. In such a game, every strategy-tuple is constrained to lie in a subset C of the product space of strategies. Thus strategies available to a …

    uiuc Repository record for Generalized Nash games with shared constraints: Existence, efficiency, refinement and equilibrium constraints (opens in a new tab)