Exact price of anarchy for weighted congestion games with two players

DOI10.1007/978-3-031-18530-4_12zbMath1528.91002arXiv2203.01740MaRDI QIDQ6166899

Marc Uetz, Matthias Walter, Joran van den Bosse

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.01740

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80) Deterministic network models in operations research (90B10) (n)-person games, (n>2) (91A06)

Related Items (1)

Exact price of anarchy for weighted congestion games with two players

Cites Work

• Worst-case equilibria
• Tight bounds for selfish and greedy load balancing
• A new model for selfish routing
• A simple model of imperfect competition where 4 are few and 6 are many
• Potential games
• Congestion games with player-specific payoff functions
• The sequential price of anarchy for affine congestion games with few players
• Some anomalies of farsighted strategic behavior
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Non-cooperative games
• Congestion Games with Variable Demands
• The curse of simultaneity
• Iterative Refinement for Linear Programming
• A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
• The Sequential Price of Anarchy for Atomic Congestion Games
• Algorithms for pure Nash equilibria in weighted congestion games
• The price of anarchy of finite congestion games
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing
• Equilibrium points in n -person games
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• Game Theory
• The Price of Routing Unsplittable Flow
• The price of anarchy is independent of the network topology
• Exact price of anarchy for weighted congestion games with two players

This page was built for publication: Exact price of anarchy for weighted congestion games with two players