Bimatrix Equilibrium Points and Mathematical Programming
نویسندگان
چکیده
منابع مشابه
An Algorithm for Equilibrium Points in Bimatrix Games.
pi[M] = 3a(M). (Cf. Hirzebruch, ref. 4, Theorem 8.2.2, p. 85.) The proof of Lemma 1 is bagbd on the fact that 7rn+3(S5) is cyclic of order 24 for n > 5. t In the sense of J. H. C. Whitehead.'0 Any two regular neighborhoods of K in M are combinatorially equivalent by reference 10, Theorem 23. 1 Blij, F. van der, "An invariant of quadratic forms mod 8.," Proc. Nederl. Akad. v. Wetenschappen, Ser....
متن کاملEquilibrium Tracing in Bimatrix Games
We analyze the relations of the van den Elzen-Talman algorithm, the Lemke-Howson algorithm and the global Newton method introduced by Govindan and Wilson. It is known that the global Newton method encompasses the Lemke-Howson algorithm; we prove that it also comprises the van den Elzen-Talman algorithm, and more generally, the linear tracing procedure, as a special case. This will lead us to a ...
متن کاملImproved Equilibrium Enumeration for Bimatrix Games
The enumeration of all equilibria of a bimatrix game is a classical algorithmic problem in game theory. As shown by Vorob’ev (1958), Kuhn (1961), and Mangasarian (1964), all equilibria can be represented as convex combinations of the vertices of certain polyhedra defined by the payoff matrices. Simplified by a projective transformation that eliminates the payoff variable, these polyhedra have t...
متن کاملMathematical programming approaches for generating p-efficient points
Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has been widely used to develop efficient methods to solve such problems. Those methods require the generation of p-efficient points (pLEPs) and use an enumeration scheme to identify pLEPs. In this paper, we consider a random vector...
متن کاملOn the solution of mathematical programming problems with equilibrium constraints
Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1965
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.11.7.681