Efficiency of Equilibria in Uniform Matroid Congestion Games

DOI10.1007/978-3-662-53354-3_9zbMath1403.91072OpenAlexW2335882758MaRDI QIDQ2819451

Max Klimm, Jasper de Jong, Marc Uetz

Publication date: 29 September 2016

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/efficiency-of-equilibria-in-uniform-matroid-congestion-games(1ece4bbd-de19-4389-b0fa-025328c7864d).html

zbMATH Keywords

matroid congestion gamesaffine cost functions, network routing games

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Games involving graphs (91A43)

Related Items (7)

The price of anarchy in series-parallel network congestion games ⋮ Scheduling games with rank-based utilities ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games

Cites Work

• Unnamed Item
• Resource buying games
• Selfish load balancing and atomic congestion games
• A new model for selfish routing
• Stackelberg strategies for atomic congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• Congestion games with player-specific payoff functions
• A class of games possessing pure-strategy Nash equilibria
• Efficiency of Equilibria in Uniform Matroid Congestion Games
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Resource Competition on Integral Polymatroids
• On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
• Exact Price of Anarchy for Polynomial Congestion Games
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• How bad is selfish routing?
• On the impact of combinatorial structure on congestion games
• The price of anarchy of finite congestion games
• Tight Bounds for Selfish and Greedy Load Balancing
• Matroids Are Immune to Braess’ Paradox
• Automata, Languages and Programming
• Über ein Paradoxon aus der Verkehrsplanung
• The network equilibrium problem in integers
• The Price of Routing Unsplittable Flow
• The price of anarchy is independent of the network topology

This page was built for publication: Efficiency of Equilibria in Uniform Matroid Congestion Games