A bin packing game with cardinality constraints under the best cost rule
From MaRDI portal
(Redirected from Publication:4634294)
Recommendations
- Selfish bin packing with cardinality constraints
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- A new lower bound on the price of anarchy of selfish bin packing
- Quality of equilibria for selfish bin packing with cost sharing variants
- Bin packing games with weight decision: how to get a small value for the price of anarchy
Cites work
- A note on a selfish bin packing problem
- Algorithm design for computer system design.
- An improved mechanism for selfish bin packing
- Bin packing games with selfish items
- Cost-sharing mechanisms for selfish bin packing
- How bad is selfish routing?
- scientific article; zbMATH DE number 6678949 (Why is no real title available?)
- Non-cooperative games
- Parametric packing of selfish items and the subset sum algorithm
- Resource constrained scheduling as generalized bin packing
- Selfish bin packing
- Selfish bin packing with cardinality constraints
- Strong and Pareto Price of Anarchy in Congestion Games
- Strong equilibrium in congestion games
- The price of selfish routing
- The Price of Stability for Network Design with Fair Cost Allocation
- 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
(3)
This page was built for publication: A bin packing game with cardinality constraints under the best cost rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634294)
