Braess's paradox in a loss network
DOI10.2307/3215183zbMATH Open0883.60088OpenAlexW2077938414MaRDI QIDQ4339256FDOQ4339256
Authors: Nigel G. Bean, Frank Kelly, P. G. Taylor 
Publication date: 4 March 1998
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3215183
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Communication networks in operations research (90B18)
Cited In (13)
- The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
- Computing the value of information in quadratic stochastic decision problems
- A survey on networking games in telecommunications
- Non-negativity of information value in games, symmetry and invariance
- Probabilistic selfish routing in parallel batch and single-server queues
- Performance paradox of dynamic matching models under greedy policies
- A paradox in optimal flow control of \(M/M/n\) queues
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Optimal Routing in Closed Queueing Networks with State Dependent Queues
- The deregulated electricity market viewed as a bilevel programming problem
- Bio-inspired paradigms in network engineering games
- A paradox in a queueing network with state-dependent routing and loss
- Quantum coherent transport in a three-arm beam splitter and a Braess paradox
This page was built for publication: Braess's paradox in a loss network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339256)
