Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2-player non-zero-sum strategic games, whose Nash equilibria are only mixed.

We develop a strategic model of network interdiction in a non-cooperative game of flow. An adversary, endowed with a bounded quantity of bads, chooses a flow specifying a plan for carrying bads through a network from a base to a target. Simultaneously, an agency chooses a blockage specifying a...

In this article we address the problem of finding feedback Nash equilibria for linear quadratic differential games defined on descriptor systems. First, we decouple the dynamic and algebraic parts of a descriptor system using canonical projectors. We discuss the effects of feedback on the...

In this note we reconsider Nash equilibria for the linear quadratic differential game for an infinite planning horizon. We consider an open-loop information structure. In the standard literature this problem is solved under the assumption that every player can stabilize the system on his own. In...

In this paper we consider the discounted linear quadratic differential game for descriptor systems that have an index larger than one. We derive both necessary and sufficient conditions for existence of an open-loop Nash (OLN) equilibrium. In a small macro-economic stabilization game we...

In this paper we consider the linear quadratic differential game for descriptor systems that have index one. We derive both necessary and sufficient conditions for existence of an open-loop Nash equilibrium

Many conditions have been introduced to weaken the continuity re-quirements for equilibrium existence in games. We introduce a new con-dition, called regularity, that is simple and easy to verify. It is implied both by Reny's better-reply security and Simon and Zame's endogenous sharing rule...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...

We call a correspondence, defined on the set of mixed strategy profiles, a generalized best reply correspondence if it has (1) a product structure, is (2) upper semi-continuous, (3) always includes a best reply to any mixed strategy profile, and is (4) convex- and closed-valued. For each...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...