Equilibrium Points of Bimatrix Games

From MaRDI portal
Publication:5341354

DOI10.1137/0112064zbMath0132.14002OpenAlexW2022537828MaRDI QIDQ5341354

Olvi L. Mangasarian

Publication date: 1964

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0112064




Related Items

Graph Transduction as a Noncooperative GameLocal search in quadratic two-person gameA simplicial branch and bound duality-bounds algorithm to linear multiplicative programmingGames of fixed rank: a hierarchy of bimatrix gamesEnumeration of Nash equilibria for two-player gamesA note on the solution of bilinear programming problems by reduction to concave minimizationConstructing bimatrix games with unique equilibrium pointsNondominated Nash points: application of biobjective mixed integer programmingEnumeration of all the extreme equilibria in game theory: bimatrix and polymatrix gamesSolving multispecies population games in continuous space and timeThe globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix gameAction-graph gamesJointly constrained bilinear programs and related problems: An overviewPolymatrix games and optimization problemsGlobal optimization for generalized linear multiplicative programming using convex relaxationGlobal maximization of a generalized concave multiplicative functionSimple search methods for finding a Nash equilibriumAccelerating convergence of cutting plane algorithms for disjoint bilinear programmingA note on bimatrix game maximal Selten subsetsA cutting plane algorithm for solving bilinear programsGeometrie und Kombinatorik von Nash-Gleichgewichten.Uniqueness of equilibrium points in bimatrix gamesEquilibrium points in special n-person gamesOn a formulation of discrete, N-person non-cooperative gamesOn the number of solutions to the complementarity problem and spanning properties of complementary conesFast Algorithms for Rank-1 Bimatrix Games