Cost-sharing mechanisms for selfish bin packing
From MaRDI portal
Publication:1699799
DOI10.1007/978-3-319-71150-8_30zbMath1470.90043OpenAlexW2769942856MaRDI QIDQ1699799
Chenhao Zhang, Guo-Chuan Zhang
Publication date: 26 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_30
Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Using weight decision for decreasing the price of anarchy in selfish bin packing games ⋮ A bin packing game with cardinality constraints under the best cost rule ⋮ An improved mechanism for selfish bin packing ⋮ Selfish bin packing with parameterized punishment
