Selfish colorful bin packing games
From MaRDI portal
Publication:2023116
Recommendations
Cites work
- A new lower bound on the price of anarchy of selfish bin packing
- A note on a selfish bin packing problem
- Approximate Core Allocation for Binpacking Games
- Approximate core allocations and integrality gap for the bin packing game
- Approximation algorithms for NP-hard problems.
- Bin packing games with selfish items
- Bincoloring
- Colored bin packing: online algorithms and lower bounds
- Colorful bin packing
- Offline black and white bin packing
- On colorful bin packing games
- Online colored bin packing
- Online results for black and white bin packing
- Selfish bin coloring
- Selfish bin covering
- Selfish bin packing
- Selfish bin packing with cardinality constraints
- Selfish square packing
- Selfish vector packing
- The Convergence Time for Selfish Bin Packing
- The convergence time for selfish bin packing
Cited in
(5)
This page was built for publication: Selfish colorful bin packing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2023116)