Cost-Sharing Scheduling Games on Restricted Unrelated Machines

DOI10.1007/978-3-662-48433-3_6zbMath1358.90041OpenAlexW2187134935MaRDI QIDQ3449583

Guy Avni, Tami Tamir

Publication date: 4 November 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-48433-3_6

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• Network design with weighted players
• Strong equilibrium in cost sharing connection games
• Strong price of anarchy
• Weighted congestion games with separable preferences
• A class of games possessing pure-strategy Nash equilibria
• Restoring Pure Equilibria to Weighted Congestion Games
• The Price of Stability for Network Design with Fair Cost Allocation
• Optimal Cost Sharing for Resource Selection Games
• Algorithms, games, and the internet
• Network-Formation Games with Regular Objectives
• Scheduling

This page was built for publication: Cost-Sharing Scheduling Games on Restricted Unrelated Machines