In this note we present both necessary and sufficient conditions for the existence of a linear static state feedback controller if the system is described by an index one descriptor system. A priori no definiteness restrictions are made w.r.t. the quadratic performance criterium. It is shown...

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...

Outcomes of the shallow lake interest conflict are presented in a number of different contexts: quasi-static and dynamic social planning, and quasi-static one-shot and repeated non-cooperative play. As the underlying dynamics are non-convex, the analysis uses geometrical-numerical methods: the...

Outcomes of the shallow lake interest conflict are presented in a number of different contexts: quasi-static and dynamic social planning, and quasi-static one-shot and repeated non-cooperative play. As the underlying dynamics are non-convex, the analysis uses geometrical-numerical methods: the...

We challenge the global optimality of one-shot punishments in infinitely repeated games with discounting. Specifically, we show that the stick-and-carrot punishment à la Abreu (1986) may not be globally optimal. We prove our result by investigating tacit collusion in the infinite repetition of...

We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount factor tends to one for stochastic games with observable states and public (but not necessarily perfect) monitoring when the limiting set of (long-run players') equilibrium payoffs is independent of...

We study strategic negotiation models featuring costless delay, general recognition procedures, endogenous voting orders, and finite sets of alternatives. Two examples show: 1. non-existence of stationary subgame-perfect equilibrium (SSPE). 2. the recursive equations and optimality conditions...

We study strategic negotiation models featuring costless delay, general recognition procedures, endogenous voting orders, and finite sets of alternatives. Two examples show: 1. non-existence of stationary subgame-perfect equilibrium (SSPE). 2. the recursive equations and optimality conditions...

We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount factor tends to one for stochastic games with observable states and public (but not necessarily perfect) monitoring when the limiting set of (long-run players') equilibrium payoffs is independent of...

We study strategic negotiation models featuring costless delay, general recognition procedures, endogenous voting orders, and finite sets of alternatives. Two examples show: 1. non-existence of stationary subgame-perfect equilibrium (SSPE). 2. the recursive equations and optimality conditions...