Price of Anarchy in Networks with Heterogeneous Latency Functions
From MaRDI portal
Recommendations
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Design of price mechanisms for network resource allocation via price of anarchy
- Price of anarchy for highly congested routing games in parallel networks
- On the price of anarchy of highly congested nonatomic network games
- The price of anarchy in an exponential multi-server
- Integer Programming and Combinatorial Optimization
- The price of anarchy and the design of scalable resource allocation mechanisms
- On the price of anarchy for flows over time
- Price of anarchy for parallel link networks with generalized mean objective
Cites work
- A class of games possessing pure-strategy Nash equilibria
- A geometric approach to the price of anarchy in nonatomic congestion games
- A multiclass, multicriteria traffic network equilibrium model
- Congestion games with player-specific payoff functions
- Exact price of anarchy for polynomial congestion games
- Fast, Fair, and Efficient Flows in Networks
- How bad is selfish routing?
- scientific article; zbMATH DE number 6469241 (Why is no real title available?)
- Inefficiency of Nash Equilibria
- Potential games
- Priority Assignment in Waiting Line Problems
- Pure Nash equilibria in player-specific and weighted congestion games
- Selfish routing with atomic players
- Stronger bounds on Braess's paradox and the maximum latency of selfish routing
- The price of anarchy is independent of the network topology
- The price of routing unsplittable flow
- Traffic assignment problem for a general network
- Worst-case equilibria
Cited in
(10)- The impact of spillback on the price of anarchy for flows over time
- Sensitivity of wardrop equilibria: revisited
- Modifying link capacity to avoid Braess paradox considering elastic demand
- Price of Anarchy in the Link Destruction (Adversary) Model
- Structural Information and Communication Complexity
- A priority-based model of routing
- Utility Design for Distributed Resource Allocation—Part I: Characterizing and Optimizing the Exact Price of Anarchy
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Latencies in multicommunication. A view from game theory
- On the price of anarchy for high-price links
This page was built for publication: Price of Anarchy in Networks with Heterogeneous Latency Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119855)
