Bin packing game with a price of anarchy of \(\frac{3}{2}\)

DOI10.1007/s10878-017-0201-6zbMath1390.91022OpenAlexW2767440689MaRDI QIDQ1702843

Tao Sun, Qizhi Fang, Qingqin Nong, Cheng, T. C. Edwin

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0201-6

zbMATH Keywords

Nash equilibriumgamebin packingprice of anarchy

Mathematics Subject Classification ID

Noncooperative games (91A10) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Related Items

Using weight decision for decreasing the price of anarchy in selfish bin packing games, A new lower bound on the price of anarchy of selfish bin packing, An improved mechanism for selfish bin packing, From packing rules to cost-sharing mechanisms

Cites Work

• Unnamed Item
• Parametric packing of selfish items and the subset sum algorithm
• Selfish bin packing
• Resource constrained scheduling as generalized bin packing
• A note on a selfish bin packing problem
• Bin Packing Games with Selfish Items
• The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms