Network topology and the efficiency of equilibrium
From MaRDI portal
(Redirected from Publication:863283)
Recommendations
Cites work
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 6469163 (Why is no real title available?)
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Braess's paradox and power-law nonlinearities in networks
- CONGESTION GAMES AND POTENTIALS RECONSIDERED
- Congestion games with player-specific payoff functions
- Network structure and strong equilibrium in route selection games.
- Parallel concepts in graph theory
- Social optimality and cooperation in nonatomic congestion games.
- Strong equilibrium in congestion games
- The Braess paradox
- The price of anarchy is independent of the network topology
- Topological Conditions for Uniqueness of Equilibrium in Networks
- Topology of series-parallel networks
- Über ein Paradoxon aus der Verkehrsplanung
Cited in
(46)- Polynomial recognition of vulnerable multi-commodities
- Machine load balancing game with linear externalities
- Internalization of social cost in congestion games
- Network topology and the efficiency of equilibrium
- Optimal externalities in a parallel transportation network
- Fighting for routes: resource allocation among competing planners in transportation networks
- Investment paradoxes in electricity networks
- Informational Braess' paradox: the effect of information on traffic congestion
- scientific article; zbMATH DE number 1841944 (Why is no real title available?)
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- The price of anarchy in nonatomic consumption-relevance congestion games
- Capacitated network design games
- The price of anarchy in routing games as a function of the demand
- Inefficiencies in network models: a graph-theoretic perspective
- Network topology and equilibrium existence in weighted network congestion games
- Social learning in nonatomic routing games
- A selective tour through congestion games
- Braess's paradox in expanders
- On weak Pareto optimality of nonatomic routing networks
- Depletable channels: dynamics, behaviour, and efficiency in network design
- Efficient methods for selfish network design
- Efficient graph topologies in network routing games
- Congestion games with linearly independent paths: convergence time and price of anarchy
- scientific article; zbMATH DE number 956791 (Why is no real title available?)
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- Negative prices in network pricing games
- Weighted congestion games with separable preferences
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Excluding Braess's paradox in nonatomic selfish routing
- A note on social learning in non-atomic routing games
- Potential game in parallel transport network with symmetric externalities
- Selfish splittable flows and NP-completeness
- Strong equilibrium in cost sharing connection games
- Paradoxes in social networks with multiple products
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares
- Resolving Braess's paradox in random networks
- Greediness and equilibrium in congestion games
- Monotonicity of equilibria in nonatomic congestion games
- On the hardness of network design for bottleneck routing games
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Network characterizations for excluding Braess's paradox
- Modifying link capacity to avoid Braess paradox considering elastic demand
- The price of anarchy in series-parallel network congestion games
- Network topologies for weakly Pareto optimal nonatomic selfish routing
- Dynamic Atomic Congestion Games with Seasonal Flows
This page was built for publication: Network topology and the efficiency of equilibrium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863283)
