Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems (Q4300608): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Simplicial algorithms on the simplotope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure for finding Nash equilibria in bi-matrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of economic equilibria by a sequence of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Generalization of the Lemke–Howson Algorithm to Noncooperative <i>N</i>-Person Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Equilibria of <i>N</i>-Person Games / rank
 
Normal rank

Revision as of 16:12, 22 May 2024

scientific article; zbMATH DE number 614189
Language Label Description Also known as
English
Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
scientific article; zbMATH DE number 614189

    Statements

    Identifiers