Improved lower bounds on the price of stability of undirected network design games (Q2392248): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-012-9411-6
+Normal rank
@@ Property / OpenAlex ID @@
+W1992071237
@@ Property / OpenAlex ID: W1992071237 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Value of Coordination in Network Design
@@ Property / cites work: On the Value of Coordination in Network Design / rank @@
+Normal rank
@@ Property / cites work @@
+The Price of Stability for Network Design with Fair Cost Allocation
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Selfish and Greedy Load Balancing
+Normal rank
@@ Property / cites work @@
+Network design with weighted players
@@ Property / cites work: Network design with weighted players / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Price of Stability for Undirected Network Design
+Normal rank
@@ Property / cites work @@
+On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
+Normal rank
@@ Property / cites work @@
+Q3409969
@@ Property / cites work: Q3409969 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
+Normal rank
@@ Property / cites work @@
+Algorithms, games, and the internet
@@ Property / cites work: Algorithms, games, and the internet / rank @@
+Normal rank
@@ Property / cites work @@
+A class of games possessing pure-strategy Nash equilibria
+Normal rank