Pubblicazioni del prof. Harold Kuhn

(with A.W. Tucker) Contributions to the theory of games, Volume I, Annals of Math. Studies 24, Princeton University Press, 1950, 217 pages. (with A.W. Tucker) Contributions to the theory of games,Volume II, Annals of Math. Studies, 28, Princeton University Press, 1953, 395 pages. (with A.W. Tucker) Linear inequalities and related systems, Annals of Math. Studies 38, Princeton University Press,] 956, 352 pages. Extensive games, Proceedings of the National Academy of Sciences, USA, 36, 1950, 570-576. A simplified two-person poker, Annals of Math. Studies, 24, 1950, 97103. (with David Gale & A.W. Tucker) On symmetric games, Annals of Math. Studies, 24, 1950, 81-87. (with David Gale & A.W. Tucker) Reductions of game matrices, Annals of Math. Studies, 24, 1950, 89-96. (with David Gale & A.W. Tucker) Linear programming and the theory of games, Chapter XIX of Activity Analysis of Production Allocation, Cowles Commission Monograph No. 13, New York: John Wiley and Sons, 1951, 317-329 (with A.W. Tucker) Nonlinear programming, Proceedings of the second Berkeley symposium on mathematical statistics and probability, University of California Press, 1951, 481-492. Subgroup theorems for groups presented by generators and relations, Annals of Mathematics, 56, 1952, 22-46. Lectures on the theory of games, issued by O.N.R. Logistics Project, Dept. of Math., Princeton Univ., 1953, 159 pages, multilithed. Extensive games and the problems of information, Annals of Math. Studies, 28, 1953, 193-216. Contractibility and convexity, Proceedings of the American Mathematical Society, 5, October 1954, 777-779. On combinatorial properties of matrices,(a translation of "Matrixok kombinatorius tulajdonsagairol" Math. Fiz. Lapok, 38,1931, 1627) Logistics Papers, Issue 11, 1955, Paper 4, George Washington University, 1-11. The Hungarian method for the assignment problem, Naval Research Logistics uarterly, 2, March-June 1955, 83- 87 Solvability and consistency for linear equations and inequalities, American Math. Monthly, 63, April 1956, 217- 232. (with A.W. Tucker) "Games, Theory of," Encyclopedia Britannica, 1956, 1121-1126. (with A.J. Hotfman) Systems of distinct representatives and linear programming, American Math. Monthly, 63, August-Sept., 1956,455 459. On a theorem of Wald, Annals of Math. Studies, 38,1956, 265-274. (with A.J. Hoffman) On systems of distinct representatives, Annals of Math. Studies, 38, 1956, 199-206. A note on "the law of supply and demand," Mathematica Scandinavica, 4, 1956, 143-146. Illustrations of linear programming, Proceedings of the 7111 Annual National Conference, Amer. Inst. of Industrial Engineers}, Washington, DC, 1956, Section 18, 1-17 Variants of the Hungarian method for assignment problems, Naval Research Logistics uarterly, 3, December 1956, 253-258. A note on Prager's transformation problem, Jour. Math.Phys., MIT, 36, July 195; , 107-111. (with A.W. Tucker) John von Neumann's work in the theory of games and mathematical economics, Bulletin of the American Math Soc., 64, May 1958, No. 3, Part II, 100-122. Factor endowments and factor princes: mathematical appendix, Economica, N.S. 26, May 1959, 142-144. Linear inequalities and the Pauli principle, Combinatorial Analysis, Proceedings of the Symposia in Applied Math., Vol. 10, Amer. Math. Soc., 1960, 141-147. On the transportation problem, Information Processing, Proceedings of the International Conference on Information Processing,UNESCO, Paris, 1960, 99-101. Some combinatorial lemmas in topology, IBM Jour. of Research and Development, 4, Dec. 1960, 518-524. An algorithm for equilibrium points in bimatrix games, Proceedings of the National Academy of Sciences, 47, October 1961, 1657-1662. Game theory and models of negotiation, Journal of Conflict Resolution, Vol. \'I, No. 1, March 1962, 1-5 (with W.J. Baumol) An approximative algorithm for the fixed charges transportation problem, Naval Research Logistics uarterly, Vol 9, No. 1 . March 1962, 1-15. (with R.E. Quandt) An experimental study of the simplex method, in Experimental arithmetic, high speed computing and mathematics: Symposia of applied mathematics, Vol. 15, Providence: Amer. Math. Society, 1963, 107-124. Mathematics and operations research, Proceedings of the U.S. Army Operations Research Symposium, Durham: U.S. Army, 1962, 29-31. (with R.E. Quandt) On some computer experiments in linear progranirming, Bulletin de I'Institut International de Statistique,Vol. 39, 1762, 363-372. Locational economics and mathematical programming, Proceedings of the Colloquium on the Application of Mathematics to Economics Budapest, 1963}, Publishing House of the Hungarian Academy of Sciences, 1965, 235-242. (with R.E. KLienne) An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics, journal of Regional Science, Vol. 4, 1962, 21-33. (with R.E. Quandt) On upper bounds for the number of iterations in solving linear programs, Operations Research, Vol. 12, Jan.-Feb. 1964, 161-165. Mathematics and marketing, in Models, Measurement and Marketing, Prentice-Hall, 1965, 41-54. On mathematical programming and locational theory, in Mathematical Optimization in Economics, Edizione Cremonese, Rome, 1966, 57-76. On a pair of dual nonlinear programs, in Nonlinear programming, ed. J. Abadie, Amsterdam: North-Holland Publ. Co., 1967,38-54. On games of fair division, in Essays in Mathematical Economics, ed. M. Shubik, Princeton: Princeton U. Press, 1967, 29-3 7. Some remarks on games of fair division, in Economia Mathematica, ed. B. de Finetti, Edizioni Cremonese, Roma, 1967, 87-102. On two theorems in international trade, in Economia Mathematica, ed. B. de Finetti, Edizioni Cremonese, Roma, 1967, 103-118. Award for distinguished service to Professor Albert W. Tucker, American Math. Monthly, 75, 1968, 1-3. Lectures on Mathematical Economics, in Mathematics of the Decision Sciences, Part 2, ed. G. B. Dantzig and A.F. Veinott, Jr., American Math. Society, 1968, 49-84. James Waldegrave: Excerpt from a letter (translation and preface), in Precursors in Mathematical Economics, ed. W.J. Baumol and S. Goldfeld, London School of Economics, 1968, 3-9. Simplicial approximations of fixed points, Proceedings of the National Academy of Sciences, 61, 1968, 1238- 1242. Mathematical Systems Theory and Economics, (ed. with G.P. Szegö), Vol. 11/12, Lecture Notes in Operations Research and Mathematical Economics, Springer-Verlag, 1969, 486 pages. Duality in mathematical programming, op. cit., 67-92. (with Mark L. Yoseloff) A combinatorial approach to the n-representability of P-density matrices, Journal of Math. Physics, 10, 1969, 703-706. (with A.W. Tucker) John von Neumann, 1903-1957: Game theory, in The Intellectual Migration, Harvard U. Press, 1969, 244-248. Proceedings of the Princeton Symposium on Mathematical Programming (editor), Princeton University Press, 1970, 620 pages. Approximate search for fixed points, in Computing methods in optimization problems, ed. L. A. Zadeh, L.W. Neustadt, and A. V. Balakrishnan, Academic Press, 1969, 199-211. Algorithms for Sperner's lemma by systematic search, in OR 69, Proceedings of the 5th Int. Conference on Operations Research, ed.J. Lawrence, Tavistock Pub., London, 1970, 465-472. Differential games and related topics, (edited with G.P. Szegö), Amsterdam: North-Holland Publ. Co., 1971, 489 pages. A note on Ferniat's problem, Mathematical Programming, 4, 1973, 98-107. (with A.W. Tucker), "The Theory of Games" in "Optimization, Mathematical Theory of", in 15th Edition of the Encyclopedia Britannica, 1974, 622-628. A new proof of the fundamental theorem of algebra, Mathematical Programming, Study 1, 1974, 148-158. "Steiner's" problem revisited, in Studies in Optimization, ed. G.B. Dantzig and B.C. Eaves, Math. Assoc. of Amer., 1974, 52-70. (with J.G. MacKinnon) Sandwich method for finding fixed points, jour Optimization Th. and Appl., 17, 1975, 189- 204. (with O.D. Hart) A proof of the existence of equilibrium without the tree disposal assumption, Jour. Math. Econ., 2, 1975, 335-343. Nonlinear programming: a historical view, in Nonlinear programming, (edited by R.W. Cottle and C.E. Lemke), Amer. Math.Soc., 1976, 1-26. How to compute economic equilibria by pivotal methods, in Computing Equilibria: How and Why}, (edited by J. Los and M. Los), North-Holland. 1976. Finding roots of polynomials by pivoting, in Fixed points: Algorithms and applications, (edited by S. Karamardian), Academic Press, 1977, 11-40. Pathfix: An algorithm for computing traffic equilibria, in Proceedings of IEEE Conference on Decision Theory, New Orleans, 1977 Pivotal exchange algorithms, in Nonlinear optimization: theory and algorithms, edited by L.C.W. Dixon, E. Speclicato, and G.P. Szegö, Boston: Birkhauser, 1980, 319-386. Comments on "Extremum Problems with Inequalities as Subsidiary Conditions," in Complete Works of F. John, Birkhauser, Boston, 1982. Complementarity problems: an eclectic view, in Proceedings of Nordic Symposium On Complementarity Problems, Linkoping, Sweden, April, 1982. (with Z. Wang and S. XU) On the cost of computing roots of polynomials, Mathematical Programming, 28, 1984, 156-163. How to Compute Economic Equilibria by Pivotal Methods, in M.A.A. Studies in Mathematics, Vol. 25, Studies in Mathematical Economics, Stanley Reiter, ed., 1986, 199-218. On the Origin of the Hungarian Method in History of Mathematical Programming, eds. J.K. Lenstra, A.H.G. Rinnooy Kan, A. Schrijver, North-Holland, 1991, 77-81. Non-linear Programming: A Historical Note, in History of Mathematical Programming, eds. J.K. Lenstra, A.H.G. Rinnooy Kan, A. Schrijver, North-Holland, 1991-82-96. The Work of John Nash in Game Theory, Nobel Seminar, December 9, 1994, with the participation of J.C. Harsanyi, R. Selten, J.W. Weibull, E. van Damme, J.F. Nash, Jr., and P. Hammerstein, in Les Prix Nobels, 1994, Stockholm, Almgvist \& Wiksell, 1995, 280310. The Work of John Nash in Game Theory (see No. 71.) Journal of Economic Theory, 69, No. 1, 1996, 153-185. The Work of John Nash in Game Theory (see No. 71.) in A Celebration of John F. Nash jr., eds. H.W. Kuhn, L. Nirenberg, P. Sarnak, Duke University Press, 1995, 1-29. Introduction to A Celebration of John F. Nash Jr., eds. H.W. Kuhn, L. Nirenberg, P. Sarnak, Duke University Press, 1995, i-v. Classics in Game Theory, Princeton University Press, 1997, 362 pages.