Optimal routing in parallel, non-observable queues and the price of anarchy revisited (original) (raw)
Related papers
The price of forgetting in parallel and non-observable queues
Performance Evaluation, 2011
Price of Anarchy in Networks with Heterogeneous Latency Functions
Mathematics of Operations Research
User equilibria for a parallel queueing system with state dependent routing
Queueing Systems, 2010
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics, 2011
Pricing Networks with Selfish Routing
2003
Bottleneck Routing Games in Communication Networks
IEEE Journal on Selected Areas in Communications, 2000
Individually Optimal Routing in Parallel Systems
Journal of Applied Probability, 1985
The Price of Anarchy for Restricted Parallel Links
Parallel Processing Letters, 2006
On the pathwise optimal Bernoulli routing policy for homogeneous parallel servers
Mathematics of operations research, 1996
A new model for selfish routing
Theoretical Computer Science, 2008
Optimal Routing in Two Parallel Queues with Exponential Service Times
Discrete Event Dynamic Systems, 2006
2002
Upper Bounding the Price of Anarchy in Atomic Splittable Selfish Routing
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences, 2008
A note on a parameter relating traffic equilibria and system optimal routing
Applied Mathematics and Computation, 2007
European Journal of Operational Research, 2017
Network uncertainty in selfish routing
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006
Network calculus and queueing theory: two sides of one coin: invited paper
Proceedings of the 4th International ICST Conference on Performance Evaluation Methodologies and Tools, 2009
Routing into two parallel links: game-theoretic distributed algorithms
2001
Minimizing response times and queue lengths in systems of parallel queues
Journal of Applied Probability, 1999
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
2002
arXiv (Cornell University), 2016
On the nonconcavity of throughput in certain closed queueing networks
Performance Evaluation, 1986
Network Calculus and Queueing Theory: Two Sides of One Coin
Price of Anarchy in Transportation Networks: Efficiency and Optimality Control
Physical Review Letters, 2008
Lattice networks: capacity limits, optimal routing, and queueing behavior
IEEE/ACM Transactions on Networking, 2006
Models of Paradoxical Coincident Cost Degradation in Noncooperative Networks
Game Theory Relaunched, 2013
Beyond Shortest Queue Routing with Heterogeneous Servers and General Cost Functions
Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools
On the degradation of performance for traffic networks with oblivious users
Transportation Research Part B: …, 2011
Selfish Routing in Capacitated Networks
Mathematics of Operations Research, 2004
From Altruism to NonCooperation in Routing Games
Fundamental limits of locally-computed incentives in network routing
2017 American Control Conference (ACC), 2017
Rate stability and output rates in queueing networks with shared resources
W. van der Weij, Matthieu Jonckheere
Performance Evaluation, 2010