1. K.J. Arrow and F.H. Hahn,General competitive analysis (Holden-Day, San Francisco, 1971).
2. R.W. Cottle, “Note on a fundamental theorem in quadratic programming,”SIAM Journal 12 (1964) 663–665.
3. R.W. Cottle, “The principal pivoting method of quadratic programming,” in:Mathematics of the decision sciences, part I, Eds. G.B. Dantzig and A.F. Veinott, Jr. (American Mathematical Society, Providence, 1968).
4. R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming,”Linear Algebra and Its Applications 1 (1968) 103–125.
5. R.W. Cottle and A.F. Veinott, Jr., “Polyhedral sets having a least element,” Technical Report No. 71-15. Operations Research House, Stanford University, August 20, 1971.Mathematical Programming 3 (1972) 000–000 (this issue).