This paper yields sufficient conditions for Pareto inoptimality of controls forming Nash equilibria in differential games. In Appendix a result on existence of open loop Nash equilibria is added.

When firms possess unique R & D assets such as ideas or particular researchers, and there are aggregate increasing returns to scale in R & D, then there can be several Nash equilibria involving different levels of investment in R & D. However when costless communication is possible firms may be...

This paper examines the problem of nonexistence of equilibrium in a simple search model with asymmetric information. A pure-strategy, symmetric Nash equilibrium fails to exist because adverse selection arising from steady-state considerations causes a nonconcavity in the payoff function.

We consider the problem of matching a set of medical students to a set of medical residency positions (hospitals) under the assumption that hospitals' preferences over groups of students are responsive. In this context, we study the preference revelation game induced by the student proposing...

This paper investigates an oligopolistic market with vertical product differentiation, where qualities are represented by a uni-dimensional interval. We examine the Nash equilibrium in the oligopoly game with a finite number of consumers, where each firm uses its technology and can offer a range...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. Inparticular,...

We show that if limit orders are required to vary smoothly, then strategic (Nash) equilibria of the double auction mechanism yield competitive (Walras) allocations. It is not necessary to have competitors on any side of any market: smooth trading is a substitute for price wars. In particular,...

In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of...

In this paper we demonstrate a new method for computing approximate Nash equilibria in n-person games. Strategy spaces are assumed to be represented by simplices, while payoff functions are assumed to be concave. Our procedure relies on a simplicial algorithm that traces paths through the set of...

This paper is devoted to a theoretical and numerical investigation of Nash equilibria and Nash bargaining problems governed by bilinear (input-affine) differential models. These systems with a bilinear state-control structure arise in many applications in, e.g., biology, economics, physics,...