The price of anarchy of finite congestion games

DOI10.1145/1060590.1060600zbMath1192.91039OpenAlexW2021677593MaRDI QIDQ3581415

George Christodoulou, Elias Koutsoupias

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060600

Mathematics Subject Classification ID

Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (only showing first 100 items - show all)

Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ The price of anarchy in series-parallel network congestion games ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ The calculation and simulation of the price of anarchy for network formation games ⋮ Congestion games with priority-based scheduling ⋮ Generalized graph \(k\)-coloring games ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ The Influence of Link Restrictions on (Random) Selfish Routing ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ Cost-Sharing in Generalised Selfish Routing ⋮ Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ Concurrent imitation dynamics in congestion games ⋮ Strong equilibrium in cost sharing connection games ⋮ Tight inefficiency bounds for perception-parameterized affine congestion games ⋮ The impact of local policies on the quality of packet routing in paths, trees, and rings ⋮ Coordination mechanisms ⋮ Atomic routing games on maximum congestion ⋮ Tight Bounds for Cost-Sharing in Weighted Congestion Games ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Competitive online multicommodity routing ⋮ The Price of Matching with Metric Preferences ⋮ On Stackelberg Strategies in Affine Congestion Games ⋮ The Curse of Sequentiality in Routing Games ⋮ The Price of Anarchy of generic valid utility systems ⋮ Computing approximate Nash equilibria in network congestion games ⋮ A Selective Tour Through Congestion Games ⋮ Collusion in atomic splittable routing games ⋮ The price of anarchy for polynomial social cost ⋮ On a generalized Cournot oligopolistic competition game ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Mixing time and stationary expected social welfare of logit dynamics ⋮ On Lookahead Equilibria in Congestion Games ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ Social context congestion games ⋮ The equivalence of uniform and Shapley value-based cost allocations in a specific game ⋮ Equilibria in routing games with edge priorities ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ Computer-Aided Verification for Mechanism Design ⋮ Transportation network with externalities ⋮ Computing Approximate Nash Equilibria in Network Congestion Games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Congestion games with capacitated resources ⋮ Inefficiency of games with social context ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ On the performance of approximate equilibria in congestion games ⋮ On lookahead equilibria in congestion games ⋮ Graphical congestion games ⋮ The price of stability for undirected broadcast network design with fair cost allocation is constant ⋮ Convergence and approximation in potential games ⋮ A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ Congestion games with failures ⋮ Tight bounds for selfish and greedy load balancing ⋮ Performance of one-round walks in linear congestion games ⋮ Stability vs. optimality in selfish ring routing ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Non-atomic one-round walks in congestion games ⋮ Design of price mechanisms for network resource allocation via price of anarchy ⋮ Scheduling to maximize participation ⋮ The minimum tollbooth problem in atomic network congestion games with unsplittable flows ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness ⋮ A new model for selfish routing ⋮ Selfish routing with incomplete information ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ Colocating tasks in data centers using a side-effects performance model ⋮ The impact of social ignorance on weighted congestion games ⋮ How to find Nash equilibria with extreme total latency in network congestion games? ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Good programming in transactional memory: game theory meets multicore architecture ⋮ The price of atomic selfish ring routing ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Stackelberg strategies for atomic congestion games ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Competitive routing over time ⋮ Malicious Bayesian Congestion Games ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Scheduling to Maximize Participation ⋮ Network Games with Quantum Strategies ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms ⋮ Network design with weighted players ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Price of anarchy for Mean Field Games ⋮ Rare Nash Equilibria and the Price of Anarchy in Large Static Games ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games ⋮ Efficient graph topologies in network routing games

This page was built for publication: The price of anarchy of finite congestion games