The price of anarchy is independent of the network topology
From MaRDI portal
Publication:5901056
DOI10.1145/509907.509971zbMath1192.68054OpenAlexW2053387401MaRDI QIDQ5901056
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509971
Related Items (27)
Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games ⋮ Bounding the inefficiency of equilibria in nonatomic congestion games ⋮ Strong equilibrium in cost sharing connection games ⋮ Worst-case Nash equilibria in restricted routing ⋮ A Selective Tour Through Congestion Games ⋮ Anarchy Is Free in Network Creation ⋮ Wary of the worst: maximizing award guarantees when new claimants may arrive ⋮ Delayed packing attack and countermeasure against transaction information based applications ⋮ The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. ⋮ Capacitated network design games ⋮ Efficient methods for selfish network design ⋮ A network pricing game for selfish traffic ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ The price of anarchy of serial, average and incremental cost sharing ⋮ On cost sharing in the provision of a binary and excludable public good ⋮ Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS ⋮ Connectivity and equilibrium in random games ⋮ Program equilibrium ⋮ Bounding the inefficiency of the C-logit stochastic user equilibrium assignment ⋮ Sensitivity of Wardrop equilibria ⋮ An efficient and almost budget balanced cost sharing method ⋮ Almost budget-balanced VCG mechanisms to assign multiple objects ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Sensitivity of Wardrop Equilibria ⋮ Efficient graph topologies in network routing games ⋮ Adversarial behavior in network games ⋮ Selfish unsplittable flows
This page was built for publication: The price of anarchy is independent of the network topology