The intermediate price of anarchy (IPoA) in bin packing games
From MaRDI portal
Publication:1744237
DOI10.1016/j.dam.2017.10.010zbMath1386.91020OpenAlexW2768536740MaRDI QIDQ1744237
Publication date: 20 April 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.010
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Parametric packing of selfish items and the subset sum algorithm
- Selfish bin packing
- Strong price of anarchy
- Strong equilibrium in congestion games
- A note on a selfish bin packing problem
- Bin Packing Game with an Interest Matrix
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
This page was built for publication: The intermediate price of anarchy (IPoA) in bin packing games