Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness

DOI10.1007/s00224-015-9646-0zbMath1354.91011arXiv1304.5149OpenAlexW1245519188MaRDI QIDQ503458

Tom Wexler, John Postl, Elliot Anshelevich

Publication date: 12 January 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

congestion gamesprice of anarchygroup formationcut gamesgames in networkssmooth games

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ The price of anarchy for utilitarian scheduling games on related machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On best response dynamics in weighted congestion games with polynomial delays
• Selfish load balancing and atomic congestion games
• Potential games
• Bounding the inefficiency of outcomes in generalized second price auctions
• Strong Price of Anarchy, Utility Games and Coalitional Dynamics
• The Speed of Convergence in Congestion Games under Best-Response Dynamics
• The Max k-Cut Game and Its Strong Equilibria
• The price of anarchy of finite congestion games
• Tight Bounds for Selfish and Greedy Load Balancing
• Contagion
• Intrinsic robustness of the price of anarchy
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Algorithmic Game Theory
• Convergence and Approximation in Potential Games

This page was built for publication: Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness