We propose a meta-heuristic approach for solving nonlinear dynamic tracking games. In contrast to more "traditional" methods based on linear-quadratic (LQ) techniques, this derivative-free method is very flexible (e.g. to introduce inequality constraints). The meta-heuristic is applied to a...

In this paper we review a number of algorithms to compute Nash equilibria in deterministic linear quadratic differential games. We will review the open-loop and feedback information case. In both cases we address both the finite and the infinite-planning horizon

In this note we consider the non-cooperative linear feedback Nash quadratic differential game with an infinite planning horizon for descriptor systems of index one. The performance function is assumed to be indefinite. We derive both necessary and sufficient conditions under which this game has...

In this note, we reconsider the indefinite open-loop Nash linear quadratic differential game with an infinite planning horizon. In particular, we derive both necessary and sufficient conditions under which the game will have a unique equilibrium

In this note, we consider the open-loop Nash linear quadratic differential game with an infinite planning horizon. The performance function is assumed to be indefinite and the underlying system affine. We derive both necessary and sufficient conditions under which this game has a unique Nash...

This paper introduces the notion of mixed leadership in non-zero-sum differential games, where there is no fixed hierarchy in decision making with respect to the players. Whether a particular player is leader or follower depends on the instrument variable s/he is controlling, and it is possible...

We study non-linear Markov perfect equilibria in a two agent linear quadratic differential game. In contrast to the literature owing to Tsutsui and Mino (1990), we do not associate endogenous subsets of the state space with candidate solutions. Instead, we address the problem of unbounded-below...

Intuitively, we expect that players who are allowed to engage in costless communication before playing a game would be foolish to agree on an inefficient equilibrium. At the same time, however, such preplay communication has been suggested as a rationale for expecting Nash equilibrium in...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

The alternating offers game due to Rubinstein (1982) had been used by Binmore (1980) and by Binmore et.al. (1986) to provide via its unique subgame perfect equilibrium an approximate non-cooperative support for the Nash bargaining solution of associated cooperative two-person bargaining games....