Quality of equilibria for selfish bin packing with cost sharing variants

DOI10.1016/J.DISOPT.2019.100556MaRDI QIDQ2218642zbMATH OpenOpenAlexWikidataFDO

Authors Leah Epstein, György Dósa

Publication date 15 January 2021

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2019.100556

zbMATH Keywords

bin packingcost sharingprice of anarchy

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Noncooperative games (91A10)

Recommendations

• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• Bin packing games with weight decision: how to get a small value for the price of anarchy
• Pareto optimal equilibria for selfish bin packing with uniform cost sharing
• Selfish Bin Packing
• Using weight decision for decreasing the price of anarchy in selfish bin packing games

Cites work

• A note on a selfish bin packing problem
• A simple on-line bin-packing algorithm
• A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
• Bounds on the convergence time of distributed selfish bin packing
• Convergence time to Nash equilibrium in selfish bin packing
• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• Parametric packing of selfish items and the subset sum algorithm
• Pareto optimal equilibria for selfish bin packing with uniform cost sharing
• Pareto Optimality
• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• Repacking helps in bounded space on-line bin-packing
• Selfish bin packing
• Selfish bin packing with cardinality constraints
• Selfish square packing
• Selfish vector packing
• Strong and Pareto Price of Anarchy in Congestion Games
• Strong equilibrium in congestion games
• Strong price of anarchy
• The convergence time for selfish bin packing
• The Price of Stability for Network Design with Fair Cost Allocation
• Using weight decision for decreasing the price of anarchy in selfish bin packing games
• Worst-case analysis of the subset sum algorithm for bin packing.
• Worst-case equilibria

Cited in

(12)

• 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
• From packing rules to cost-sharing mechanisms
• A new lower bound on the price of anarchy of selfish bin packing
• 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
• A bin packing game with cardinality constraints under the best cost rule
• Selfish bin packing
• Selfish bin packing with punishment
• Cost-sharing mechanisms for the selfish maximum open-end bin packing problem

This page was built for publication: Quality of equilibria for selfish bin packing with cost sharing variants

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