Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem

DOI10.1007/978-3-319-21398-9_31MaRDI QIDQ3196401zbMATH OpenOpenAlexFDO

Authors Deshi Ye, Guochuan Zhang

Publication date 29 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21398-9_31

zbMATH Keywords

approximation algorithmsknapsack auctionmechanism design

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Approximate composable truthful mechanism design
• Approximation techniques for utilitarian mechanism design
• Approximation techniques for utilitarian mechanism design
• Truthful and Near-Optimal Mechanism Design via Linear Programming
• Truthful Mechanisms via Greedy Iterative Packing

Cites work

• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Algorithmic mechanism design (extended abstract)
• Approximate algorithms to pack rectangles into several strips
• Approximating the non-contiguous multiple organization packing problem
• Approximation algorithms for multiple strip packing
• Approximation techniques for utilitarian mechanism design
• Black-box randomized reductions in algorithmic mechanism design
• Computationally-feasible truthful auctions for convex bundles
• Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
• scientific article; zbMATH DE number 1305407 (Why is no real title available?)
• scientific article; zbMATH DE number 1418266 (Why is no real title available?)
• scientific article; zbMATH DE number 6297731 (Why is no real title available?)
• scientific article; zbMATH DE number 6297764 (Why is no real title available?)
• Maximizing the total profit of rectangles packed into a rectangle
• On packing rectangles with resource augmentation: maximizing the profit
• Online multiple-strip packing
• Parameterized approximation scheme for the multiple knapsack problem
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• STACS 2004
• STACS 2005
• The multiple subset sum problem
• There is no EPTAS for two-dimensional knapsack
• Truth revelation in approximately efficient combinatorial auctions
• Truthful and Near-Optimal Mechanism Design via Linear Programming
• Truthful approximation mechanisms for restricted combinatorial auctions
• Truthful approximation schemes for single-parameter agents
• Truthful Mechanisms via Greedy Iterative Packing

Cited in

(2)

• Truthful mechanism design for bin packing with applications on cloud computing
• Approximate composable truthful mechanism design

This page was built for publication: Approximate truthful mechanism design for two-dimensional orthogonal knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196401)