To make high-quality research more accessible and easier to explore.

5 results

A Partial Theory of Takeover Bids

Journal of Finance 1984 39(1), 167-183
ABSTRACT There is a natural separation between production decisions affecting the firm as a whole and individual decisions by each shareholder about his portfolio of securities. The end result of these two types of decisions is normally referred to as a productive exchange equilibrium. At such an equilibrium, no individual wants to adjust his portfolio and no firm can muster majority support for a change in its production plans. This paper presents a partial theory of takeover bids in that it examines the role of a takeover bid as a mechanism by which a simultaneous change in shareholdings and production plans can be achieved. This enables a new production exchange equilibrium to be reached which is preferred by a majority of the shareholders but which is inaccessible without a contingent contract in the form of a takeover bid.

A Partial Theory of Takeover Bids

Journal of Finance 1984 39(1), 167
There is a natural separation between production decisions affecting the firm as a whole and individual decisions by each shareholder about his portfolio of securities. The end result of these two types of decisions is normally referred to as a productive exchange equilibrium. At such an equilibrium, no individual wants to adjust his portfolio and no firm can muster majority support for a change in its production plans. This paper presents a partial theory of takeover bids in that it examines the role of a takeover bid as a mechanism by which a simultaneous change in shareholdings and production plans can be achieved. This enables a new production exchange equilibrium to be reached which is preferred by a majority of the shareholders but which is inaccessible without a contingent contract in the form of a takeover bid.

Connectedness in Multiple Linear Fractional Programming

Management Science 1983 29(2), 250-255
The geometric properties of the sets of efficient and weakly efficient solutions of multiple linear fractional programming problems are investigated. Weakly efficient solutions are path-connected by finitely many linear line segments when the constrained region is compact.