scientific article; zbMATH DE number 3571895
From MaRDI portal
Publication:4143064
zbMath0366.90133MaRDI QIDQ4143064
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of mathematical programming (90C90) Noncooperative games (91A10) Linear programming (90C05) Algorithms in computer science (68W99)
Related Items (33)
Games with the total bandwagon property meet the Quint-Shubik conjecture ⋮ Homotopy methods to compute equilibria in game theory ⋮ A note on determining pure-strategy equilibrium points of bimatrix games ⋮ Automatic verification of concurrent stochastic systems ⋮ A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities ⋮ A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games ⋮ A theorem on the number of Nash equilibria in a bimatrix game ⋮ On constructing games with a convex set of equilibrium strategies ⋮ On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game ⋮ A sandwich theorem for generic \(n \times n\) two person games ⋮ On sustainable equilibria ⋮ A global Newton method to compute Nash equilibria. ⋮ Strategic decompositions of normal form games: zero-sum games and potential games ⋮ Bounded homotopy path approach to the solution of linear complementarity problems ⋮ Recent development in computational complexity characterization of Nash equilibrium ⋮ Implementing the modified LH algorithm ⋮ An associated maximization problem for two-person nonzero-sum separable games ⋮ A fixed point theorem including the last theorem of Poincaré ⋮ Computing Nash equilibria by iterated polymatrix approximation ⋮ On generalizing shapley's index theory to labelled pseudomanifolds ⋮ Reinterpreting mixed strategy equilibria: a unification of the classical and Bayesian views ⋮ Geometrie und Kombinatorik von Nash-Gleichgewichten. ⋮ A procedure for finding Nash equilibria in bi-matrix games ⋮ A variable dimension algorithm for the linear complementarity problem ⋮ Strategic Characterization of the Index of an Equilibrium ⋮ Uniqueness of equilibrium points in bimatrix games ⋮ Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm ⋮ Generic \(4\times 4\) two person games have at most 15 Nash equilibria ⋮ Oriented Euler complexes and signed perfect matchings ⋮ Strictly perfect equilibrium points of bimatrix games ⋮ A bound on the number of Nash equilibria in a coordination game. ⋮ Circulant games ⋮ Game Theory Explorer: software for the applied game theorist
This page was built for publication:
