Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem
From MaRDI portal
Publication:3196401
DOI10.1007/978-3-319-21398-9_31zbMath1353.91020MaRDI QIDQ3196401
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
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
91B26: Auctions, bargaining, bidding and selling, and other market models
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online multiple-strip packing
- There is no EPTAS for two-dimensional knapsack
- Maximizing the total profit of rectangles packed into a rectangle
- Computationally-feasible truthful auctions for convex bundles
- Truthful approximation mechanisms for restricted combinatorial auctions
- The Multiple Subset Sum Problem
- Algorithmic mechanism design (extended abstract)
- Coordination Mechanisms for Selfish Parallel Jobs Scheduling
- Truthful Approximation Schemes for Single-Parameter Agents
- Approximating the Non-contiguous Multiple Organization Packing Problem
- Approximation Techniques for Utilitarian Mechanism Design
- Truth revelation in approximately efficient combinatorial auctions
- Approximation Algorithms for Multiple Strip Packing
- Parameterized Approximation Scheme for the Multiple Knapsack Problem
- Truthful Mechanisms via Greedy Iterative Packing
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- STACS 2004
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- Black-Box Randomized Reductions in Algorithmic Mechanism Design
- Approximate algorithms to pack rectangles into several strips
- STACS 2005
