Cost-sharing mechanisms for selfish bin packing
DOI10.1007/978-3-319-71150-8_30zbMATH Open1470.90043OpenAlexW2769942856MaRDI QIDQ1699799FDOQ1699799
Authors: Chenhao Zhang, Guochuan Zhang 
Publication date: 26 February 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_30
Recommendations
Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Approximation algorithms (68W25) Discrete location and assignment (90B80)
Cited In (9)
- 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
- An improved mechanism for selfish bin packing
- An improved mechanism for selfish bin packing
- Selfish bin packing with parameterized punishment
- Selfish bin packing under harmonic mean cost sharing mechanism
- An incentive mechanism for selfish bin covering
- A bin packing game with cardinality constraints under the best cost rule
- From packing rules to cost-sharing mechanisms
This page was built for publication: Cost-sharing mechanisms for selfish bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699799)
