Pages that link to "Item:Q863283"

The following pages link to Network topology and the efficiency of equilibrium (Q863283):

Displaying 41 items.

• Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
• Braess's paradox for flows over time (Q372993) (← links)
• On the hardness of network design for bottleneck routing games (Q389953) (← links)
• Efficient methods for selfish network design (Q442104) (← links)
• Selfish splittable flows and NP-completeness (Q465681) (← links)
• Network topology and equilibrium existence in weighted network congestion games (Q495752) (← links)
• Strong equilibrium in network congestion games: increasing versus decreasing costs (Q495760) (← links)
• Network characterizations for excluding Braess's paradox (Q506543) (← links)
• Strong equilibrium in cost sharing connection games (Q834855) (← links)
• Capacitated network design games (Q904684) (← links)
• Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
• Efficient graph topologies in network routing games (Q1021587) (← links)
• Weighted congestion games with separable preferences (Q1036603) (← links)
• Inefficiencies in network models: a graph-theoretic perspective (Q1685026) (← links)
• A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106) (← links)
• Internalization of social cost in congestion games (Q2061126) (← links)
• Social learning in nonatomic routing games (Q2078068) (← links)
• On weak Pareto optimality of nonatomic routing networks (Q2082187) (← links)
• Polynomial recognition of vulnerable multi-commodities (Q2094357) (← links)
• Machine load balancing game with linear externalities (Q2096168) (← links)
• Optimal externalities in a parallel transportation network (Q2162683) (← links)
• Resolving Braess's paradox in random networks (Q2408090) (← links)
• Depletable channels: dynamics, behaviour, and efficiency in network design (Q2422775) (← links)
• Greediness and equilibrium in congestion games (Q2453056) (← links)
• Negative prices in network pricing games (Q2670481) (← links)
• Modifying link capacity to avoid Braess paradox considering elastic demand (Q2675881) (← links)
• The price of anarchy in nonatomic consumption-relevance congestion games (Q2811296) (← links)
• Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing (Q2817846) (← links)
• Braess's paradox in expanders (Q3145837) (← links)
• Excluding Braess’s Paradox in Nonatomic Selfish Routing (Q3449597) (← links)
• A Selective Tour Through Congestion Games (Q3464474) (← links)
• Dynamic Atomic Congestion Games with Seasonal Flows (Q4969328) (← links)
• Informational Braess’ Paradox: The Effect of Information on Traffic Congestion (Q4971386) (← links)
• (Q5005146) (← links)
• A Characterization of Undirected Graphs Admitting Optimal Cost Shares (Q5238743) (← links)
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy (Q5459970) (← links)
• A note on social learning in non-atomic routing games (Q6106531) (← links)
• The price of anarchy in series-parallel network congestion games (Q6120906) (← links)
• The price of anarchy in routing games as a function of the demand (Q6201916) (← links)
• Fighting for routes: resource allocation among competing planners in transportation networks (Q6555615) (← links)
• Monotonicity of equilibria in nonatomic congestion games (Q6565417) (← links)