Selfish colorful bin packing games
From MaRDI portal
Publication:2023116
DOI10.1007/S10878-020-00599-9zbMATH Open1466.91006OpenAlexW3034380711MaRDI QIDQ2023116FDOQ2023116
Authors: Vittorio Bilò, Francesco Cellinese, Giovanna Melideo, Gianpiero Monaco
Publication date: 3 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00599-9
Recommendations
Cites Work
- Approximation algorithms for NP-hard problems.
- A note on a selfish bin packing problem
- Approximate core allocations and integrality gap for the bin packing game
- Selfish bin packing with cardinality constraints
- Approximate Core Allocation for Binpacking Games
- Selfish bin packing
- Selfish square packing
- Selfish bin coloring
- Bincoloring
- Selfish bin covering
- Colored bin packing: online algorithms and lower bounds
- Online Colored Bin Packing
- A new lower bound on the price of anarchy of selfish bin packing
- Online results for black and white bin packing
- Bin packing games with selfish items
- Colorful bin packing
- The Convergence Time for Selfish Bin Packing
- On colorful bin packing games
- Selfish Vector Packing
- The Convergence Time for Selfish Bin Packing
- Offline black and white 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)