A new lower bound on the price of anarchy of selfish bin packing

DOI10.1016/J.IPL.2019.06.002MaRDI QIDQ2274500zbMATH OpenOpenAlexFDO

Authors Leah Epstein, György Dósa

Publication date 20 September 2019

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2019.06.002

zbMATH Keywords

bin packingcombinatorial problemsprice of anarchy

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial games (91A46)

Recommendations

• A new lower bound for classic online bin packing
• A new lower bound for classic online bin packing
• New lower bounds for certain classes of bin packing algorithms
• New Lower Bounds for Certain Classes of Bin Packing Algorithms
• An improved lower bound for the bin packing problem
• scientific article; zbMATH DE number 1187157
• A tight lower bound for optimal bin packing
• Quality of equilibria for selfish bin packing with cost sharing variants
• An analysis of lower bound procedures for the bin packing problem
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)

Cites work

• A note on a selfish bin packing problem
• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• Parametric packing of selfish items and the subset sum algorithm
• Selfish bin packing
• Selfish bin packing with cardinality constraints
• Worst-case equilibria

Cited in

(16)

• Bin packing game with a price of anarchy of \(\frac{3}{2}\)
• Bin packing games with weight decision: how to get a small value for the price of anarchy
• Selfish vector packing
• Selfish colorful bin packing games
• Selfish bin packing with parameterized punishment
• Selfish bin packing under harmonic mean cost sharing mechanism
• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• Pareto optimal equilibria for selfish bin packing with uniform cost sharing
• Using weight decision for decreasing the price of anarchy in selfish bin packing games
• The Convergence Time for Selfish Bin Packing
• Bin packing of selfish items with the parameter
• A bin packing game with cardinality constraints under the best cost rule
• Prices of anarchy of selfish 2D bin packing games
• Selfish bin packing with punishment
• New bounds on the price of anarchy of selfish bin packing with partial punishment
• Cost-sharing mechanisms for the selfish maximum open-end bin packing problem

This page was built for publication: A new lower bound on the price of anarchy of selfish bin packing

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