Pages that link to "Item:Q5341354"
From MaRDI portal
The following pages link to Equilibrium Points of Bimatrix Games (Q5341354):
Displaying 25 items.
- Polymatrix games and optimization problems (Q463366) (← links)
- Action-graph games (Q625044) (← links)
- Games of fixed rank: a hierarchy of bimatrix games (Q847799) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games (Q868531) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- Simple search methods for finding a Nash equilibrium (Q932813) (← links)
- A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
- Constructing bimatrix games with unique equilibrium points (Q1107452) (← links)
- Uniqueness of equilibrium points in bimatrix games (Q1258257) (← links)
- Equilibrium points in special n-person games (Q1263538) (← links)
- Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- Solving multispecies population games in continuous space and time (Q2169165) (← links)
- A note on bimatrix game maximal Selten subsets (Q2254918) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
- Geometrie und Kombinatorik von Nash-Gleichgewichten. (Q2491987) (← links)
- On a formulation of discrete, N-person non-cooperative games (Q2550362) (← links)
- On the number of solutions to the complementarity problem and spanning properties of complementary cones (Q2553906) (← links)
- Local search in quadratic two-person game (Q2627186) (← links)
- Graph Transduction as a Noncooperative Game (Q2885112) (← links)
- A cutting plane algorithm for solving bilinear programs (Q4124613) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)