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 条
12345