develops the necessary background and formalism from the theory of algorithms and complexity developed in computer science, in …

oligopoly producers in two-stage zonal power markets. In part II of this paper, we propose a solution algorithm which decomposes … the proposed MILP model into several subproblems and solve them in parallel and iteratively. Our solution algorithm … and the proposed solution algorithm finds a representative SPNE in each subinterval. Each subinterval is independent from …

In this note we generalize a numerical algorithm presented in [9] to calculate all solutions of the scalar algebraic …-quadratic differential game. The algorithm is based on calculating the positive roots of a polynomial matrix …

In this paper we review a number of algorithms to compute Nash equilibria in deterministic linear quadratic …

Relaxation algorithms provide a powerful method of finding noncooperative equilibria in general synchronous games …

This paper is a self-contained survey of algorithms for computing Nash equilibria of two-person games. The games may be … given in strategic form or extensive form. The classical Lemke-Howson algorithm finds one equilibrium of a bimatrix game … that show the subdivision of the players' mixed strategy sets into best-response regions. The Lemke-Howson algorithm is …

selected by various selection theories. We present all relevant techniques underlying homotopy algorithms. We give detailed … expositions of the Lemke-Howson algorithm and the Van den Elzen-Talman algorithm to compute Nash equilibria in 2-person games, and … the Herings-Van den Elzen, Herings-Peeters, and McKelvey-Palfrey algorithms to compute Nash equilibria in general n …

-Nash equilibria for this two-stage game with partial coalitional strategies are determined by means of a mathematical-based algorithm …