An experimental study of a DC optimization algorithm for bimatrix games (Q5164671): Difference between revisions

@@ Property / cites work @@
+Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Convex analysis approach to d. c. programming: Theory, algorithms and applications
+Normal rank
@@ Property / cites work @@
+On solving linear complementarity problems by DC programming and DCA
+Normal rank
@@ Property / cites work @@
+Equilibrium Points of Bimatrix Games
@@ Property / cites work: Equilibrium Points of Bimatrix Games / rank @@
+Normal rank
@@ Property / cites work @@
+Bimatrix Equilibrium Points and Mathematical Programming
+Normal rank
@@ Property / cites work @@
+Q4369429
@@ Property / cites work: Q4369429 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / rank @@
+Normal rank
@@ Property / cites work @@
+Transactions on Computational Collective Intelligence XIII
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the linear complementarity problem through concave programming
+Normal rank