Efficient methods for selfish network design (Q442104): Difference between revisions

@@ Property / author @@
-Q239694
@@ Property / author: Q239694 / rank @@
-Normal rank
@@ Property / author @@
+Paul G. Spirakis
@@ Property / author: Paul G. Spirakis / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M10
@@ Property / Mathematics Subject Classification ID: 68M10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A80
@@ Property / Mathematics Subject Classification ID: 91A80 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6064502
@@ Property / zbMATH DE Number: 6064502 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Braess's paradox
@@ Property / zbMATH Keywords: Braess's paradox / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+selfish flows
@@ Property / zbMATH Keywords: selfish flows / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Nash equilibrium
@@ Property / zbMATH Keywords: Nash equilibrium / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+real-world networks
@@ Property / zbMATH Keywords: real-world networks / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+equilibrium flow delays
@@ Property / zbMATH Keywords: equilibrium flow delays / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+paradox-ridden network
@@ Property / zbMATH Keywords: paradox-ridden network / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial-time algorithm
@@ Property / zbMATH Keywords: polynomial-time algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+linear latency
@@ Property / zbMATH Keywords: linear latency / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.04.033
+Normal rank
@@ Property / OpenAlex ID @@
+W2035766543
@@ Property / OpenAlex ID: W2035766543 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q59818405
@@ Property / Wikidata QID: Q59818405 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+On sparse approximations to randomized strategies and convex combinations
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Über ein Paradoxon aus der Verkehrsplanung
@@ Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank @@
+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 @@
+How much can taxes help selfish routing?
@@ Property / cites work: How much can taxes help selfish routing? / rank @@
+Normal rank
@@ Property / cites work @@
+Selfish Routing in Capacitated Networks
@@ Property / cites work: Selfish Routing in Capacitated Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Stackelberg Strategies for Atomic Congestion Games
+Normal rank
@@ Property / cites work @@
+Convex separable optimization is not much harder than linear optimization
+Normal rank
@@ Property / cites work @@
+Probability Inequalities for Sums of Bounded Random Variables
+Normal rank
@@ Property / cites work @@
+The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
+Normal rank
@@ Property / cites work @@
+Selfish splittable flows and NP-completeness
@@ Property / cites work: Selfish splittable flows and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+Stackelberg strategies for selfish routing in general multicommodity networks
+Normal rank
@@ Property / cites work @@
+Q3533739
@@ Property / cites work: Q3533739 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case equilibria
@@ Property / cites work: Worst-case equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Q3873927
@@ Property / cites work: Q3873927 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501276
@@ Property / cites work: Q5501276 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Simple strategies for large zero-sum games with applications to complexity theory
+Normal rank
@@ Property / cites work @@
+Uniqueness of solution in linear programming
@@ Property / cites work: Uniqueness of solution in linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Network topology and the efficiency of equilibrium
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for minimum quadratic cost flow problems
+Normal rank
@@ Property / cites work @@
+The price of anarchy is independent of the network topology
+Normal rank
@@ Property / cites work @@
+Stackelberg Scheduling Strategies
@@ Property / cites work: Stackelberg Scheduling Strategies / rank @@
+Normal rank
@@ Property / cites work @@
+On the severity of Braess's paradox: designing networks for selfish users is hard
+Normal rank
@@ Property / cites work @@
+How bad is selfish routing?
@@ Property / cites work: How bad is selfish routing? / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:442104