The Lemke-Howson algorithm for computing equilibria of finite 2-person non-cooperative games in normal form is modified to restrict the computations to the ordinarily small portion corresponding to the strategies actually used by the players, and further it is shown that in games with perfect...

A duality theory and two computational algorithms are developed for variable-factor programming, a name given to linear programming when the profit coefficients are functionally dependent upon a program of variable-factor inputs in limited supply. Computational experience is reported for one of...

A Pareto-optimal sequential dividend policy for a syndicate is obtained in a tractable special case. The relationship between the many-person and single-person problems is investigated, and it is shown that the group acts as though it were an individual with risk preferences and probability...

Investment projects are described in this paper as a pattern of uncertain cash flows over time; i.e., as a cash flow pattern over an event tree. Whereas the portfolio problem of selecting projects generally requires simultaneous consideration of all available projects, here we seek sufficient...

Modular representations of the integers are used to identify the successive integer grid points encountered as one varies the objective value of an all-integer programming problem. One can, therefore, proceed from a noninteger solution to an integer solution by monotonic variation of the...