Selfish bin packing with punishment
From MaRDI portal
Publication:6199400
DOI10.1016/j.tcs.2023.114276MaRDI QIDQ6199400
No author found.
Publication date: 23 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Selfish bin packing with cardinality constraints
- Worst-case equilibria
- Selfish bin packing
- Finitely additive and epsilon Nash equilibria
- A general bin packing game: interest taken into account
- Selfish colorful bin packing games
- Selfish bin packing with parameterized punishment
- From packing rules to cost-sharing mechanisms
- Quality of equilibria for selfish bin packing with cost sharing variants
- A new lower bound on the price of anarchy of selfish bin packing
- 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
- Contemporaneous perfect epsilon-equilibria
- Prices of Anarchy of Selfish 2D Bin Packing Games
- An improved mechanism for selfish bin packing
This page was built for publication: Selfish bin packing with punishment
