Resource allocation games with multiple resource classes

DOI10.1007/978-3-319-51741-4_13MaRDI QIDQ2971166zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Conflicting congestion effects in resource allocation games
• Dynamic resource allocation games
• Dynamic resource allocation games
• Efficiency Loss in a Network Resource Allocation Game
• Utilitarian resource assignment

Cites work

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

Cited in

(5)

• Dynamic resource allocation games
• Dynamic resource allocation games
• Conflicting congestion effects in resource allocation games
• Fast Nash bargaining algorithm for resource scheduling problems with a large number of media streaming channels
• Complexity and approximability of optimal resource allocation and Nash equilibrium over networks

This page was built for publication: Resource allocation games with multiple resource classes

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