From packing rules to cost-sharing mechanisms
From MaRDI portal
Publication:2082177
DOI10.1007/s10878-019-00519-6zbMath1502.90161OpenAlexW2999963698MaRDI QIDQ2082177
Chenhao Zhang, Guo-Chuan Zhang
Publication date: 4 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00519-6
Related Items (1)
Cites Work
- Unnamed Item
- Parametric packing of selfish items and the subset sum algorithm
- Selfish bin packing with cardinality constraints
- Selfish bin packing
- Selfish bin covering
- Bin packing can be solved within 1+epsilon in linear time
- Bin packing game with a price of anarchy of \(\frac{3}{2}\)
- A note on a selfish bin packing problem
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- An Incentive Mechanism for Selfish Bin Covering
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Other Solutions to Nash's Bargaining Problem
- A Logarithmic Additive Integrality Gap for Bin Packing
- The Convergence Time for Selfish Bin Packing
- An improved mechanism for selfish bin packing
This page was built for publication: From packing rules to cost-sharing mechanisms
