Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games (Q5283383): Difference between revisions

@@ Property / OpenAlex ID @@
+W2580025469
@@ Property / OpenAlex ID: W2580025469 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07614
@@ Property / arXiv ID: 1701.07614 / rank @@
+Normal rank
@@ Property / cites work @@
+The Price of Stability for Network Design with Fair Cost Allocation
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
+Normal rank
@@ Property / cites work @@
+Taxes for linear atomic congestion games
@@ Property / cites work: Taxes for linear atomic congestion games / 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 @@
+On the performance of approximate equilibria in congestion games
+Normal rank
@@ Property / cites work @@
+The Curse of Sequentiality in Routing Games
@@ Property / cites work: The Curse of Sequentiality in Routing Games / rank @@
+Normal rank
@@ Property / cites work @@
+Path deviations outperform approximate stability in heterogeneous congestion games
+Normal rank
@@ Property / cites work @@
+Q3409969
@@ Property / cites work: Q3409969 / rank @@
+Normal rank
@@ Property / cites work @@
+Potential games
@@ Property / cites work: Potential games / rank @@
+Normal rank
@@ Property / cites work @@
+A class of games possessing pure-strategy Nash equilibria
+Normal rank