Selfish Routing in Capacitated Networks
From MaRDI portal
Recommendations
- SOFSEM 2006: Theory and Practice of Computer Science
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 2156279
- A selfish routing based network improvement problem
- Stochastic selfish routing
- Selfish routing in the presence of network uncertainty
- Equilibria in dynamic selfish routing
- A new model for selfish routing
- STACS 2004
- Tradeoffs and Average-Case Equilibria in Selfish Routing
Cited in
(only showing first 100 items - show all)- Profit loss in differentiated oligopolies
- The path player game
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Existence of equilibria in a decentralized two-level supply chain
- Non-cooperative tree creation
- Stackelberg strategies for selfish routing in general multicommodity networks
- Price and capacity competition
- Efficiency of atomic splittable selfish routing with polynomial cost functions
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
- Bounding the inefficiency of logit-based stochastic user equilibrium
- Selfish routing in public services
- Self-fulfilling signal of an endogenous state in network congestion games
- Efficiency analysis with respect to the unit cost objectives in scheduling games
- Price of anarchy for highly congested routing games in parallel networks
- Toll caps in privatized road networks
- Price of anarchy in a linear-state stochastic dynamic game
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
- Self-organising behaviour in the presence of negative externalities: a conceptual model of commuter choice
- Bounding the inefficiency of equilibria in nonatomic congestion games
- A network pricing game for selfish traffic
- Congestion control for a system with parallel stations and homogeneous customers using priority passes
- Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery
- Constraint games for stable and optimal allocation of demands in SDN
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- Equilibrium strategies for multiple interdictors on a common network
- Price of Pareto optimality in hedonic games
- Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks
- Optimal improvement of communication network congestion via nonlinear programming with generalized Nash equilibrium constraints
- On weak Pareto optimality of nonatomic routing networks
- Atomic congestion games with random players: network equilibrium and the price of anarchy
- On Pareto optimality in social distance games
- Nonatomic aggregative games with infinitely many types
- Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem
- A traffic congestion analysis by user equilibrium and system optimum with incomplete information
- Atomic routing game with capacity constraints
- Equilibria in routing games with edge priorities
- The efficiency of greedy best response algorithm in road traffic assignment
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Local smoothness and the price of anarchy in splittable congestion games
- The effect of supplier capacity on the supply chain profit
- Two-group knapsack game
- The price of anarchy of affine congestion games with similar strategies
- Improving selfish routing for risk-averse players
- Pathwise smooth splittable congestion games and inefficiency
- Nonlinear min-cost-pursued route-swapping dynamic system
- A mixed traffic assignment problem and its upper bound of efficiency loss
- Equilibrium routing under uncertainty
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands
- Collusion in atomic splittable routing games
- Bottleneck routing with elastic demands
- A survey on the continuous nonlinear resource allocation problem
- The toll effect on price of anarchy when costs are nonlinear and asymmetric
- Bounding the inefficiency of Nash equilibria in games with finitely many players
- Mixed Nash equilibria in selfish routing problems with dynamic constraints
- How much can taxes help selfish routing?
- On the severity of Braess's paradox: designing networks for selfish users is hard
- On the efficiency of equilibria in mean-field oscillator games
- A Stackelberg strategy for routing flow over time
- A geometric approach to the price of anarchy in nonatomic congestion games
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
- The price of anarchy in nonatomic consumption-relevance congestion games
- Network topologies for weakly Pareto optimal nonatomic selfish routing
- On the price of anarchy of highly congested nonatomic network games
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Optimal cost sharing for capacitated facility location games
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Self-interested routing in queueing networks
- Capacity allocation under noncooperative routing
- Wardrop equilibrium for networks with the BPR latency function
- Price competition with elastic traffic
- Hierarchical network formation games
- Braess paradox and properties of Wardrop equilibrium in some multiservice networks
- Network-formation games with regular objectives
- Improving selfish routing for risk-averse players
- Bottleneck routing with elastic demands
- A selective tour through congestion games
- Routing games
- Routing problem with splitable traffic and incomplete information
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Traffic Networks and Flows over Time
- Management of Variable Data Streams in Networks
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
- Doing good with spam is hard
- On the relationship between Nash—Cournot and Wardrop equilibria
- Price of anarchy for supply chains with partial positive externalities
- Efficient methods for selfish network design
- Repeated congestion games with bounded rationality
- scientific article; zbMATH DE number 2079324 (Why is no real title available?)
- Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions
- Routing games in the wild: efficiency, equilibration and regret. Large-scale field experiments in Singapore
- scientific article; zbMATH DE number 1908192 (Why is no real title available?)
- Atomic routing game with capacity constraints
- Dynamic Atomic Congestion Games with Seasonal Flows
- Informational Braess' paradox: the effect of information on traffic congestion
- Selfishness need not be bad
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
- Wealth Inequality and the Price of Anarchy
- The inefficiency of Nash and subgame perfect equilibria for network routing
- When is selfish routing bad? The price of anarchy in light and heavy traffic
This page was built for publication: Selfish Routing in Capacitated Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704208)
