Informational Braess’ Paradox: The Effect of Information on Traffic Congestion (Q4971386): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963642727 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.02039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition and Efficiency in Congested Markets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-terminal routing games with unknown active players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding Braess’s Paradox in Nonatomic Selfish Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network characterizations for excluding Braess's paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Inefficiency of Equilibria in Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph topologies in network routing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Braess paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids Are Immune to Braess’ Paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion Games with Player-Specific Costs Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network structure and strong equilibrium in route selection games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in network congestion games: increasing versus decreasing costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency Loss in a Network Resource Allocation Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate control for communication networks: shadow prices, proportional fairness and stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibria in a model with partial rivalry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion Games with Player-Specific Constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Uniqueness of Equilibrium in Large Crowding Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Social optimality and cooperation in nonatomic congestion games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Conditions for Uniqueness of Equilibrium in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network topology and the efficiency of equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the severity of Braess's paradox: designing networks for selfish users is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium points of nonatomic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONGESTION GAMES AND POTENTIALS RECONSIDERED / rank
 
Normal rank

Latest revision as of 18:52, 23 July 2024

scientific article; zbMATH DE number 7258957
Language Label Description Also known as
English
Informational Braess’ Paradox: The Effect of Information on Traffic Congestion
scientific article; zbMATH DE number 7258957

    Statements

    Informational Braess’ Paradox: The Effect of Information on Traffic Congestion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 October 2020
    0 references
    Braess' paradox
    0 references
    wardrop equilibrium
    0 references
    information
    0 references
    traffic
    0 references
    transportation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references