Efficiency of equilibria in uniform matroid congestion games

DOI10.1007/978-3-662-53354-3_9MaRDI QIDQ2819451zbMATH OpenOpenAlexFDO

Authors Jasper de Jong, Max Klimm, 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)

Recommendations

• The asymptotic price of anarchy for \(k\)-uniform congestion games
• The price of anarchy of affine congestion games with similar strategies
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Atomic Routing Games on Maximum Congestion
• Atomic routing games on maximum congestion

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A new model for selfish routing
• Automata, Languages and Programming
• Congestion games with player-specific payoff functions
• Efficiency of equilibria in uniform matroid congestion games
• Exact price of anarchy for polynomial congestion games
• How bad is selfish routing?
• Matroids are immune to Braess' paradox
• On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
• On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games
• On the impact of combinatorial structure on congestion games
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Pure Nash equilibria in player-specific and weighted congestion games
• Resource buying games
• Resource competition on integral polymatroids
• Selfish load balancing and atomic congestion games
• Stackelberg strategies for atomic congestion games
• The network equilibrium problem in integers
• The price of anarchy is independent of the network topology
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• Tight Bounds for Selfish and Greedy Load Balancing
• Worst-case equilibria
• Über ein Paradoxon aus der Verkehrsplanung

Cited in

(12)

• On the impact of singleton strategies in congestion games
• Uniqueness of equilibria in atomic splittable polymatroid congestion games
• Efficiency of equilibria in uniform matroid congestion games
• Scheduling games with rank-based utilities
• Cost-sharing games in real-time scheduling systems
• Uniqueness of equilibria in atomic splittable polymatroid congestion games
• Cost-sharing games in real-time scheduling systems
• The asymptotic price of anarchy for \(k\)-uniform congestion games
• Uniform mixed equilibria in network congestion games with link failures
• A logarithmic approximation for polymatroid congestion games
• The price of anarchy of affine congestion games with similar strategies
• The price of anarchy in series-parallel network congestion games

This page was built for publication: Efficiency of equilibria in uniform matroid congestion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819451)