Truthful mechanism design for bin packing with applications on cloud computing
From MaRDI portal
Publication:2084605
DOI10.1007/s10878-020-00601-4zbMath1503.90123MaRDI QIDQ2084605
Deshi Ye, Feng Xie, Guo-Chuan Zhang
Publication date: 18 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00601-4
90C27: Combinatorial optimization
91B26: Auctions, bargaining, bidding and selling, and other market models
Cites Work
- Unnamed Item
- Unnamed Item
- There is no asymptotic PTAS for two-dimensional vector packing
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Resource allocation algorithms for virtualized service hosting platforms
- Anomalous behavior in bin packing algorithms
- Bin packing can be solved within 1+epsilon in linear time
- Algorithms for the variable sized bin packing problem
- Truthful approximation mechanisms for restricted combinatorial auctions
- Approximation Techniques for Utilitarian Mechanism Design
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Truthful Mechanisms via Greedy Iterative Packing
- Variable Sized Bin Packing
- Improved Approximation for Vector Bin Packing
- On Multidimensional Packing Problems
- Algorithmic Game Theory