The sum of a supermodular function, assumed nondecreasing in the choice variable, and of a 'concavely supermodularizable' function, assumed nonincreasing in the parameter variable, satisfies the Milgrom- Shannon (1994, Monotone comparative statics, Econometrica 62, 157-180) single crossing...

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 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 consider the non-cooperative linear feedback Nash 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...

The main objects here are Nash equilibria in spatial Cournot oligopolies when profits depend on coordinated distribution. Production is non-cooperative, but the subsequent transportation must be performed jointly to minimize costs. Cournot-Nash equilibria for this two-stage game with partial...

In this note we generalize a numerical algorithm presented in [9] to calculate all solutions of the scalar algebraic Riccati equations that play an important role in finding feedback Nash equilibria of the scalar N-player linear affine-quadratic differential game. The algorithm is based on...

An uninformed sender designs a mechanism that discloses information about her type to a privately informed receiver, who then decides whether to act. I impose a single-crossing assumption, so that the receiver with a higher type is more willing to act. Using a linear programming approach, I...

We provide a technique for constructing optimal multiattribute screening contracts in a general setting with one-dimensional types based on necessary optimality conditions. Our approach allows for type-dependent participation constraints and arbitrary risk profiles. As an example we discuss...