Bin packing game with a price of anarchy of 32

DOI10.1007/S10878-017-0201-6MaRDI QIDQ1702843zbMATH OpenOpenAlexFDO

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

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

bin packinggameNash equilibriumprice of anarchy

Mathematics Subject Classification ID

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

Recommendations

• Bin packing games with weight decision: how to get a small value for the price of anarchy
• Prices of anarchy of selfish 2D bin packing games
• The intermediate price of anarchy (IPoA) in bin packing games
• A bin packing game with cardinality constraints under the best cost rule
• A new lower bound on the price of anarchy of selfish bin packing
• scientific article; zbMATH DE number 1417714
• Approximate core allocations and integrality gap for the bin packing game
• Note on non-uniform bin packing games
• Complexity of core allocation for the bin packing game
• Using weight decision for decreasing the price of anarchy in selfish bin packing games

Cites work

• A note on a selfish bin packing problem
• Bin packing games with selfish items
• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• Parametric packing of selfish items and the subset sum algorithm
• Resource constrained scheduling as generalized bin packing
• Selfish bin packing
• 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

Cited in

(19)

• The intermediate price of anarchy (IPoA) in bin packing games
• A general bin packing game: interest taken into account
• Bin packing games with weight decision: how to get a small value for the price of anarchy
• From packing rules to cost-sharing mechanisms
• The quality of equilibria for set packing and throughput scheduling games
• A new lower bound on the price of anarchy of selfish bin packing
• Using weight decision for decreasing the price of anarchy in selfish bin packing games
• Convergence time to Nash equilibrium in selfish bin packing
• Selfish square packing
• Bin packing games with selfish items
• Bin packing game with an interest matrix
• scientific article; zbMATH DE number 1164583 (Why is no real title available?)
• A bin packing game with cardinality constraints under the best cost rule
• scientific article; zbMATH DE number 1417714 (Why is no real title available?)
• Prices of anarchy of selfish 2D bin packing games
• An improved mechanism for selfish bin packing
• Cost-sharing mechanisms for the selfish maximum open-end bin packing problem
• A scheduling game on parallel batch machines with setup cost
• Complexity of core allocation for the bin packing game

This page was built for publication: Bin packing game with a price of anarchy of \(\frac{3}{2}\)

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