Computing approximate Nash equilibria in network congestion games (Q2913950): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20444
@@ Property / full work available at URL: https://doi.org/10.1002/net.20444 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2147373582
@@ Property / OpenAlex ID: W2147373582 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934594
@@ Property / cites work: Q2934594 / rank @@
+Normal rank
@@ Property / cites work @@
+The price of anarchy of finite congestion games
@@ Property / cites work: The price of anarchy of finite congestion games / 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 @@
+Q5808656
@@ Property / cites work: Q5808656 / rank @@
+Normal rank
@@ Property / cites work @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+A class of games possessing pure-strategy Nash equilibria
+Normal rank
@@ Property / cites work @@
+How bad is selfish routing?
@@ Property / cites work: How bad is selfish routing? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549719
@@ Property / cites work: Q3549719 / rank @@
+Normal rank