Pages that link to "Item:Q5267281"
From MaRDI portal
The following pages link to Competitive routing in networks with polynomial costs (Q5267281):
Displaying 35 items.
- Competitive routing of traffic flows by navigation providers (Q278911) (← links)
- Worst-case analysis of non-cooperative load balancing (Q291317) (← links)
- Modeling conflict processes on the Internet (Q466412) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Competitive routing over time (Q719282) (← links)
- Competitive online multicommodity routing (Q839644) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- A new model for selfish routing (Q952441) (← links)
- Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
- Two-terminal routing games with unknown active players (Q1045998) (← links)
- A Stackelberg network game with a large number of followers (Q1411367) (← links)
- Uniqueness of equilibria in atomic splittable polymatroid congestion games (Q1631639) (← links)
- A communication network routing problem: modeling and optimization using non-cooperative game theory (Q2043002) (← links)
- Internalization of social cost in congestion games (Q2061126) (← links)
- Optimal improvement of communication network congestion via nonlinear programming with generalized Nash equilibrium constraints (Q2072566) (← links)
- Congestion control and optimal maintenance of communication networks with stochastic cost functions: a variational formulation (Q2080626) (← links)
- A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems (Q2095329) (← links)
- Game theory-based optimization of distributed idle computing resources in cloud environments (Q2285147) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- On a generalized Cournot oligopolistic competition game (Q2393078) (← links)
- Decentralized bandwidth control subject to two-layer constraints (Q2437789) (← links)
- Top-percentile traffic routing problem by dynamic programming (Q2443403) (← links)
- A flow and routing control policy for communication networks with multiple competitive users (Q2462515) (← links)
- A Stackelberg strategy for routing flow over time (Q2516242) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games (Q2835665) (← links)
- Collusion in Atomic Splittable Routing Games (Q3012948) (← links)
- On the Uniqueness of Equilibrium in Atomic Splittable Routing Games (Q3449452) (← links)
- GAME THEORETIC BEST-RESPONSE DYNAMICS FOR EVACUEES' EXIT SELECTION (Q3552549) (← links)
- A Survey of Uniqueness Results for Selfish Routing (Q3614959) (← links)
- NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS (Q4797295) (← links)
- (Q5009624) (← links)
- Competitive energy consumption under transmission constraints in a multi-supplier power grid system (Q5347315) (← links)
- Nonadaptive Selfish Routing with Online Demands (Q5458504) (← links)
- Competitive Resource Allocation Among Urban Congestion Areas in a Modern Big City (Q6495225) (← links)