Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem

被引：1
|
作者：
Ye, Deshi [1 ]
Zhang, Guochuan [1 ]
机构：
[1] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Zhejiang, Peoples R China
来源：
COMPUTING AND COMBINATORICS | 2015年 / 9198卷
关键词：
Mechanism design; Knapsack auction; Approximation algorithms; ALGORITHMS; RECTANGLES;
D O I：
10.1007/978-3-319-21398-9_31
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper provides a technique for designing truthful mechanisms for a combinatorial optimization problem, which requires composition algorithms. We show that the composition algorithm A o B is monotone if the algorithm A and the algorithm B are both monotone. Then, we apply this technique to the two-dimensional orthogonal knapsack problem with provable approximation bounds, improving the previous results in [5].
引用
收藏
页码：390 / 401
页数：12
相关论文
共 50 条
  • [1] On the two-dimensional knapsack problem
    Caprara, A
    Monaci, M
    OPERATIONS RESEARCH LETTERS, 2004, 32 (01) : 5 - 14
  • [2] Unconstrained two-dimensional knapsack problem
    Álvarez-Martínez, David
    Toro-Ocampo, Eliana Mirledy
    Gallego-Rendón, Ramón Alfonso
    Ingenieria y Universidad, 2010, 14 (02): : 327 - 344
  • [3] Enhancing the Efficiency of Heuristic Placement Algorithm for Two-dimensional Orthogonal Knapsack Packing Problem
    Shiangjen, Kanokwatt
    Chaijaruwanich, Jeerayut
    Srisujjalertwaja, Wijak
    Somhom, Samerkae
    PROCEEDINGS OF 2015 6TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE, 2015, : 33 - 36
  • [4] On the Two-Dimensional Knapsack Problem for Convex Polygons
    Merino, Arturo
    Wiese, Andreas
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (02)
  • [5] Approximate composable truthful mechanism design
    Ye, Deshi
    Zhang, Guochuan
    THEORETICAL COMPUTER SCIENCE, 2016, 654 : 188 - 198
  • [6] Faster approximation schemes for the two-dimensional knapsack problem
    Heydrich, Sandy
    Wiese, Andreas
    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 79 - 98
  • [7] The two-dimensional knapsack problem with splittable items in stacks
    Rapine, Christophe
    Pedroso, Joao Pedro
    Akbalik, Ayse
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2022, 112
  • [8] Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
    Heydrich, Sandy
    Wiese, Andreas
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (04)
  • [9] Two-dimensional knapsack-block packing problem
    Zhou, Shengchao
    Li, Xueping
    Zhang, Kaike
    Du, Ni
    APPLIED MATHEMATICAL MODELLING, 2019, 73 : 1 - 18
  • [10] An approximation scheme for the two-stage, two-dimensional knapsack problem
    Caprara, Alberto
    Lodi, Andrea
    Monaci, Michele
    DISCRETE OPTIMIZATION, 2010, 7 (03) : 114 - 124
12345