A note on a selfish bin packing problem
From MaRDI portal
Publication:2393075
DOI10.1007/S10898-012-9856-9zbMATH Open1275.90082OpenAlexW2009126961WikidataQ105583417 ScholiaQ105583417MaRDI QIDQ2393075FDOQ2393075
Authors: Ruixin Ma, Xin Han, Hing-Fung Ting, Deshi Ye, Yong Zhang, 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
Recommendations
Cites Work
- Worst-case equilibria
- How bad is selfish routing?
- Title not available (Why is that?)
- Parametric packing of selfish items and the subset sum algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Selfish bin packing
- Resource constrained scheduling as generalized bin packing
- The price of selfish routing
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- Title not available (Why is that?)
- Next-fit packs a list and its reverse into the same number of bins
Cited In (24)
- A new lower bound on the price of anarchy of selfish bin packing
- Quality of equilibria for selfish bin packing with cost sharing variants
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Parametric packing of selfish items and the subset sum algorithm
- An Incentive Mechanism for Selfish Bin Covering
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- An improved mechanism for selfish bin packing
- Selfish bin packing with cardinality constraints
- Selfish bin packing
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- A general bin packing game: interest taken into account
- Selfish Vector Packing
- Bounds on the convergence time of distributed selfish bin packing
- Bin packing of selfish items with the parameter
- The Convergence Time for Selfish Bin Packing
- Selfish bin packing with parameterized punishment
- Selfish bin packing under harmonic mean cost sharing mechanism
- Prices of Anarchy of Selfish 2D Bin Packing Games
- Selfish colorful bin packing games
- A bin packing game with cardinality constraints under the best cost rule
- From packing rules to cost-sharing mechanisms
- The intermediate price of anarchy (IPoA) in bin packing games
- Selfish vector packing
This page was built for publication: A note on a selfish bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393075)
