The Association Between Technology Type and Diffusion Pattern Under Duopolistic Competition
We consider the one-colour triangle avoidance game. Using a high performance computing network, we showed that the first player can win the game on 16 vertices.
Este trabajo presenta una mejora del conocido método iterativo, propuesto por Brown (1951), y cuya validez fue demostrada por Robinson (1951), para resolver juegos matriciales mediante el desarrollo ficticio de una serie de partidas del juego.La mejora consiste en dotar al método de una mayor flexibilidad en la elección del punto inicial del algoritmo.
This article considers the problem of finding the optimal strategies in stochastic differential games with two players, using the weak infinitesimal operator of process xi the solution of d(xi) = f(xi,t,u1,u2)dt + sigma(xi,t,u1,u2)dW. For two-person zero-sum stochastic games we formulate the minimax solution; analogously, we perform the solution for coordination and non-cooperative stochastic differential games.