The convergence time for selfish bin packing
From MaRDI portal
Publication:4584657
DOI10.14232/ACTACYB.23.3.2018.8zbMATH Open1413.68119OpenAlexW2821279296WikidataQ129527002 ScholiaQ129527002MaRDI QIDQ4584657FDOQ4584657
Authors: György Dósa, Leah Epstein
Publication date: 3 September 2018
Published in: Acta Cybernetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14232/actacyb.23.3.2018.8
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cited In (12)
- Quality of equilibria for selfish bin packing with cost sharing variants
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- An improved mechanism for selfish bin packing
- Bounds on the convergence time of distributed selfish bin packing
- The Convergence Time for Selfish Bin Packing
- Selfish bin packing with parameterized punishment
- A note on a selfish bin packing problem
- Selfish bin packing under harmonic mean cost sharing mechanism
- Convergence time to Nash equilibrium in selfish bin packing
- Selfish colorful bin packing games
- From packing rules to cost-sharing mechanisms
- Selfish vector packing
This page was built for publication: The convergence time for selfish bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584657)