On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games

From MaRDI portal
Publication:5627935

DOI10.1137/0121010zbMath0222.90053OpenAlexW2008968905WikidataQ96323959 ScholiaQ96323959MaRDI QIDQ5627935

Joachim Rosenmüller

Publication date: 1971

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

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




Related Items

A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodesHomotopy methods to compute equilibria in game theoryA variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form gamesFinding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problemsGeneric finiteness of equilibrium distributions for bimatrix outcome game formsMarkov perfect equilibria in repeated asynchronous choice gamesA global Newton method to compute Nash equilibria.Generalized multilinear games and vertical tensor complementarity problemsNash equilibria: complexity, symmetries, and approximationA mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal formNonlinear programming and stationary equilibria in stochastic gamesOn the robustness of the competitive equilibrium: utility-improvements and equilibrium pointsImplementing the modified LH algorithmSemidefinite programming for min-max problems and gamesComputing Nash equilibria by iterated polymatrix approximationA path-following procedure to find a proper equilibrium of finite gamesComputation of the Nash equilibrium selected by the tracing procedure in \(N\)-person gamesA Bayesian optimization approach to find Nash equilibriaDeterminacy of equilibrium in outcome game formsFinding mixed strategies with small supports in extensive form gamesStar-shapedness of the kernel for homogeneous gamesA mathematical programming approach for determining oligopolistic market equilibriumComplementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibriaA globally convergent algorithm to compute all Nash equilibria for \(n\)-person games