Parametric packing of selfish items and the subset sum algorithm
From MaRDI portal
Recommendations
- Bin packing of selfish items with the parameter
- Selfish bin packing with parameterized punishment
- An efficient parameterized algorithm for m-set packing
- Parameterized approximation algorithms for packing problems
- Selfish bin packing with cardinality constraints
- A fixed-parameter-tractable algorithm for set packing
- A note on a selfish bin packing problem
- A faster parameterized algorithm for set packing
- On the parameterized complexity of compact set packing
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 6469241 (Why is no real title available?)
- A simple on-line bin-packing algorithm
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- How bad is selfish routing?
- Modified subset sum heuristics for bin packing
- Reducibility among combinatorial problems
- STACS 2005
- Selfish bin packing
- Strong Price of Anarchy for Machine Load Balancing
- Strong price of anarchy
- The price of selfish routing
- Tight bounds for worst-case equilibria
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Worst-case analysis of the subset sum algorithm for bin packing.
- Worst-case equilibria
Cited in
(17)- 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
- 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
- Selfish bin packing with cardinality constraints
- An improved mechanism for selfish bin packing
- Online variable-sized bin packing with conflicts
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- Selfish bin packing with parameterized punishment
- On the sequential price of anarchy of isolation games
- A note on a selfish bin packing problem
- 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
- Selfish vector packing
This page was built for publication: Parametric packing of selfish items and the subset sum algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q261356)
