A Metaheuristic Approach to Compute Pure Nash Equilibria (Q5111130): Difference between revisions

@@ Property / cites work @@
+Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing a Nash Equilibrium
@@ Property / cites work: The Complexity of Computing a Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449199
@@ Property / cites work: Q4449199 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of pure Nash equilibria
@@ Property / cites work: The complexity of pure Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate well-supported Nash equilibria below two-thirds
+Normal rank
@@ Property / cites work @@
+Q5715720
@@ Property / cites work: Q5715720 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Equilibrium Points of Bimatrix Games
@@ Property / cites work: Equilibrium Points of Bimatrix Games / rank @@
+Normal rank
@@ Property / cites work @@
+Q4452900
@@ Property / cites work: Q4452900 / rank @@
+Normal rank
@@ Property / cites work @@
+Combining simulated annealing with local search heuristics
+Normal rank
@@ Property / cites work @@
+An Optimization Approach for Approximate Nash Equilibria
+Normal rank