Truthful mechanism design for bin packing with applications on cloud computing
type: Item
instance of: scholarly article
title: Truthful mechanism design for bin packing with applications on cloud computing
zbMATH Open document ID: 1503.90123
author: Deshi Ye
author: Feng Xie
author: Guochuan Zhang
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91B26
zbMATH DE Number: 7603265
zbMATH Keywords: auction and mechanism design
zbMATH Keywords: approximation ratio
zbMATH Keywords: multi-dimensional bin packing
MaRDI profile type: Publication
full work available at URL: s10878-020-00601-4
OpenAlex ID: W3034327324
cites work: Improved Approximation for Vector Bin Packing
cites work: Approximation Techniques for Utilitarian Mechanism Design
cites work: Truthful Mechanisms via Greedy Iterative Packing
cites work: On Multidimensional Packing Problems
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: An APTAS for Generalized Cost Variable-Sized Bin Packing
cites work: Variable Sized Bin Packing
cites work: Vector bin packing with heterogeneous bins: application to the machine reassignment problem
cites work: Algorithms for the variable sized bin packing problem
cites work: Q4821303
cites work: Truthful approximation mechanisms for restricted combinatorial auctions
cites work: Anomalous behavior in bin packing algorithms
cites work: Q3624066
cites work: Algorithmic Game Theory
cites work: Resource allocation algorithms for virtualized service hosting platforms
cites work: There is no asymptotic PTAS for two-dimensional vector packing
DOI: 10.1007/S10878-020-00601-4
Recommended article: Truthful Mechanisms via Greedy Iterative Packing
Recommended article: Truthful mechanism design of reversed auction on cloud computing
Recommended article: A Truthful Mechanism for Value-Based Scheduling in Cloud Computing
Recommended article: A truthful mechanism for value-based scheduling in cloud computing
Recommended article: A Framework for Truthful Online Auctions in Cloud Computing with Heterogeneous User Demands
Recommended article: Truthful Mechanisms for Competitive Reward-Based Scheduling
Recommended article: Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem
Recommended article: Truthful approximation mechanisms for restricted combinatorial auctions
description: scientific article; zbMATH DE number 7603265