Pages that link to "Item:Q3129377"
From MaRDI portal
The following pages link to Capacity allocation under noncooperative routing (Q3129377):
Displayed 22 items.
- Worst-case analysis of non-cooperative load balancing (Q291317) (← links)
- Game-theoretic static load balancing for distributed systems (Q635345) (← links)
- Capacitated network design games (Q904684) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Equilibrium routing strategies in data transmission networks (Q1434558) (← links)
- Uniqueness of equilibria in atomic splittable polymatroid congestion games (Q1631639) (← links)
- A game-theoretic analysis of bandwidth allocation under a user-grouping constraint (Q2375559) (← links)
- Decentralized bandwidth control subject to two-layer constraints (Q2437789) (← links)
- A flow and routing control policy for communication networks with multiple competitive users (Q2462515) (← links)
- The problem of capacity addition in multi-user elastic demand communication networks (Q2474556) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- Braess's Paradox in large random graphs (Q3061184) (← links)
- Cooperative networks games with elastic demands (Q3515388) (← links)
- Existence and uniqueness of the Nash equilibrium in the non-cooperative QoS routing (Q3577880) (← links)
- A Survey of Uniqueness Results for Selfish Routing (Q3614959) (← links)
- Routing and dynamic resource assignment joint game: a non-cooperative model for QoS routing (Q4652103) (← links)
- NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS (Q4797295) (← links)
- Optimal service‐capacity allocation in a loss system (Q5249461) (← links)
- PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES (Q5358089) (← links)
- The price of anarchy is independent of the network topology (Q5917582) (← links)