Pages that link to "Item:Q2730226"
From MaRDI portal
The following pages link to Braess-like paradoxes in distributed computer systems (Q2730226):
Displaying 16 items.
- Optimal routing for multiclass networks (Q666417) (← links)
- Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems (Q836011) (← links)
- Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess paradoxes (Q1021602) (← links)
- Nash equilibrium based fairness (Q1935941) (← links)
- Magnitude of inefficiency (Q2030487) (← links)
- Inefficiency in stochastic queueing systems with strategic customers (Q2239838) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems (Q2567165) (← links)
- A paradox in optimal flow control of \(M/M/n\) queues (Q2567166) (← links)
- Optimal behavior of agents in a piecewise linear taxation environment (Q2685539) (← links)
- Capacity Management in Decentralized Networks (Q3114822) (← links)
- (Q3374480) (← links)
- NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS (Q4797295) (← links)
- EFFECTS OF SYMMETRY ON GLOBALIZING SEPARATED MONOPOLIES TO A NASH-COURNOT OLIGOPOLY (Q4908591) (← links)
- Distributed Computing (Q5395135) (← links)
