Prices of Anarchy of Selfish 2D Bin Packing Games

DOI10.1142/S0129054119500096zbMath1411.91156arXiv1707.07882OpenAlexW2964050527MaRDI QIDQ5384121

Cristina G. Fernandes, Flávio K. Miyazawa, Yoshiko Wakabayashi, Carlos E. Ferreira

Publication date: 21 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Nash equilibriumprice of anarchyrectangle packingstrong Nash equilibriumsquare packingselfish bin packing

Mathematics Subject Classification ID

Noncooperative games (91A10) Combinatorial games (91A46)

Related Items (2)

Selfish bin packing with punishment ⋮ Selfish bin packing with parameterized punishment

Cites Work

• Unnamed Item
• Worst-case equilibria
• Selfish bin packing
• Dynamic multi-dimensional bin packing
• Multidimensional cube packing
• A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
• A note on a selfish bin packing problem
• Bounds for online bounded space hypercube packing
• Selfish Square Packing
• Bin Packing Games with Selfish Items
• Bin Packing Game with an Interest Matrix
• Packing Rectangles into 2OPT Bins Using Rotations
• Convergence time to Nash equilibrium in load balancing
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Algorithms, games, and the internet
• On packing of squares and cubes

This page was built for publication: Prices of Anarchy of Selfish 2D Bin Packing Games