An improved mechanism for selfish bin packing
From MaRDI portal
Publication:5918389
DOI10.1007/s10878-019-00476-0zbMath1481.90272OpenAlexW2990672522WikidataQ126804907 ScholiaQ126804907MaRDI QIDQ5918389
Qizhi Fang, Qingqin Nong, Xin Chen
Publication date: 25 November 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00476-0
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Parametric packing of selfish items and the subset sum algorithm
- Selfish bin packing
- Cost-sharing mechanisms for selfish bin packing
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- A general bin packing game: interest taken into account
- A note on a selfish bin packing problem
- An Incentive Mechanism for Selfish Bin Covering
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Allocating Bandwidth for Bursty Connections
- The Convergence Time for Selfish Bin Packing
This page was built for publication: An improved mechanism for selfish bin packing