Resource Allocation Games with Multiple Resource Classes

DOI10.1007/978-3-319-51741-4_13zbMath1484.91230OpenAlexW2569085684MaRDI QIDQ2971166

Roy B. Ofer, Tami Tamir

Publication date: 4 April 2017

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51741-4_13

Mathematics Subject Classification ID

Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Algorithmic game theory and complexity (91A68)

Cites Work

• Worst-case equilibria
• Tight bounds for online class-constrained packing
• Algorithms for storage allocation based on client preferences
• Potential games
• Scheduling games on uniform machines with activation cost
• Efficiency analysis of load balancing games with and without activation costs
• A class of games possessing pure-strategy Nash equilibria
• The PoA of Scheduling Game with Machine Activation Costs
• The Price of Stability for Network Design with Fair Cost Allocation
• Conflicting Congestion Effects in Resource Allocation Games
• Bounds on Multiprocessing Timing Anomalies
• On two class-constrained versions of the multiple knapsack problem

This page was built for publication: Resource Allocation Games with Multiple Resource Classes