A note on a selfish bin packing problem
From MaRDI portal
Publication:2393075
DOI10.1007/s10898-012-9856-9zbMath1275.90082OpenAlexW2009126961WikidataQ105583417 ScholiaQ105583417MaRDI QIDQ2393075
Yong Zhang, Ruixin Ma, Deshi Ye, Xin Han, Hing-Fung Ting, György Dósa
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9856-9
Related Items
Selfish bin packing under harmonic mean cost sharing mechanism, Selfish Vector Packing, An Incentive Mechanism for Selfish Bin Covering, 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, Bin packing game with a price of anarchy of \(\frac{3}{2}\), Quality of equilibria for selfish bin packing with cost sharing variants, Prices of Anarchy of Selfish 2D Bin Packing Games, A bin packing game with cardinality constraints under the best cost rule, Selfish vector packing, The intermediate price of anarchy (IPoA) in bin packing games, A general bin packing game: interest taken into account, A new lower bound on the price of anarchy of selfish bin packing, Selfish colorful bin packing games, An improved mechanism for selfish bin packing, Quality of strong equilibria for selfish bin packing with uniform cost sharing, From packing rules to cost-sharing mechanisms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric packing of selfish items and the subset sum algorithm
- Selfish bin packing
- Next-fit packs a list and its reverse into the same number of bins
- Resource constrained scheduling as generalized bin packing
- How bad is selfish routing?
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- The price of selfish routing
