Combinatorial auctions: A survey

被引:496
作者
de Vries, S [1 ]
Vohra, RV
机构
[1] Tech Univ Munich, Zentrum Mathemat, D-80290 Munich, Germany
[2] Northwestern Univ, JL Kellogg Grad Sch Management, Dept Managerial Econ & Decis Sci, Evanston, IL 60208 USA
关键词
auctions; combinatorial optimization;
D O I
10.1287/ijoc.15.3.284.16077
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Many auctions involve the sale of a variety of distinct assets. Examples are airport time slots, delivery routes, network routing, and furniture. Because of complementarities or substitution effects between the different assets, bidders have preferences not just for particular items but for sets of items. For this reason, economic efficiency is enhanced if bidders are allowed to bid on bundles or combinations of different assets. This paper surveys the state of knowledge about the design of combinatorial auctions and presents some new insights. Periodic updates of portions of this survey will be posted to this journal's Online Supplements web page at http://joc.pubs.informs.org/OnlineSupplements.html.
引用
收藏
页码:284 / 309
页数:26
相关论文
共 103 条
[1]   Integer programming for combinatorial auction winner determination [J].
Andersson, A ;
Tenhunen, M ;
Ygge, F .
FOURTH INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS, PROCEEDINGS, 2000, :39-46
[2]  
[Anonymous], APPL OPTIMIZATION CO
[3]  
[Anonymous], 1971, PUBLIC CHOICE
[4]  
[Anonymous], 2000, PROCEEDINGS OF THE 2
[5]  
[Anonymous], P 1 ACM C EL COMM
[6]  
AUSUBEL L, 1998, UNPUB DEMAND REDUCTI
[7]  
AUSUBEL LM, 1997, 9706 U MAR DEP EC
[8]  
AUSUBEL LM, 2000, EFFICIENT DYNAMIC AU
[9]   A dynamic subgradient-based branch-and-bound procedure for set covering [J].
Balas, E ;
Carrera, MC .
OPERATIONS RESEARCH, 1996, 44 (06) :875-890
[10]   A LIFT-AND-PROJECT CUTTING PLANE ALGORITHM FOR MIXED 0-1 PROGRAMS [J].
BALAS, E ;
CERIA, S ;
CORNUEJOLS, G .
MATHEMATICAL PROGRAMMING, 1993, 58 (03) :295-324