Ferenc Forgó

Forgó’s attention then turned towards another kind of generalization of Nash equilibrium: Aumann’s correlated equilibrium. In his 2010 paper in Mathematical Social Sciences, he defined soft correlated equilibrium which enables players to achieve higher social welfare than that of Nash’s. In a series of papers, the performance of soft equilibrium was determined or estimated for some classes of two-facility congestion games including the prisoner’s dilemma and the chicken game.

In 1999, Forgó and Joó published a paper in the Journal of Global Optimization which opened a new avenue in the area of generalization of Nash equilibria. Several fixed point and Nash-like existence theorems were proved in pseudoconvex spaces, a notable generalization of traditional convex spaces.

In the 1990s, his research interest turned almost exclusively to game theory. The most important solution concept for non-cooperative games is the Nash equilibrium. From both a theoretical and an application point of view, the key question is in which models and under which conditions the Nash equilibrium exists. In a 1994 paper, Forgó used a generalized notion of convexity (CF-convexity) which enabled him to prove the existence of the Nash equilibrium point under conditions that are weaker than those previously used. As an application, in 1995, he gave sufficient conditions for the existence of a pure Nash equilibrium point of the Cournot oligopoly game for a nonlinear demand function and a nonconvex cost function. He, together with István Joó, proved a two-function minimax theorem under generalized convexity conditions. The paper appeared in Archiv der Mathematik in 1999 and has been cited many times.

A series of conference presentations and journal publications preceded his book Nonconvex and Discrete Programming, published in 1978, which for many years was one of the fundamental works on the subject in Hungarian. Ten years later, in 1988, Akadémiai Kiadó published Nonconvex Programming, an extended and improved edition. In the 1980s, Forgó applied game-theoretic and mathematical programming methods in a decision-theoretic framework to the solution of multi-objective decision problems, writing articles and papers on the subject in both English and Hungarian. His articles with József Abaffy (1993) and István Joó (1999) in the Journal of Optimization Theory and Applications and the Journal of Global Optimization demonstrate his wide interest in certain areas of optimization.

In the first phase of his scientific career, Forgó's main interests were the theory, methods, and applications of nonlinear mathematical programming. In his first paper in English, in 1969, he studied the relationship between the mixed 0-1 integer linear programming problem and certain quadratic programming problems. In the same year, he published a paper on the relation between zero-sum two-player games and linear programming. In 1972, he published an article in Acta Cybernetica on the solution of non-convex programming problems by the cutting plane method; his PhD thesis also dealt with this topic in 1974.

Between 1960 and 1965, Forgó studied at the Károly Marx University of Economics, where he was one of the first students to graduate as an economist / mathematician. After graduation, he joined the Mathematics Department and soon became an assistant professor. In 1970, he spent a year in the United States as a Ford Foundation Fellow at the University of Southern California, Los Angeles. In 1974, he successfully defended his PhD thesis in economics. He became a full professor in 1991 and professor emeritus after retiring in 2012. In 2015, he became a Doctor of the Hungarian National Academy.

Ferenc Forgó (born 16 April 1942 in Pécs) is a Hungarian economist and mathematician. He is a Doctor of the Hungarian Academy of Sciences and professor emeritus at the Corvinus University of Budapest. His main research interests have been mathematical programming and game theory.