Pricing combinatorial auctions

被引:50
作者
Xia, M [1 ]
Koehler, GJ
Whinston, AB
机构
[1] Univ Illinois, Coll Commerce & Business Adm, Dept Business Adm, Champaign, IL 61820 USA
[2] Univ Florida, Warrington Coll Business Adm, Dept Decis & Informat Sci, Gainesville, FL 32611 USA
[3] Univ Texas, Dept Management Sci & Informat Syst, Ctr Res Elect Commerce, Austin, TX 78712 USA
关键词
combinatorial auction; bidding; pricing; incentive compatibility;
D O I
10.1016/S0377-2217(02)00678-1
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Single-item auctions have many desirable properties. Mechanisms exist to ensure optimality, incentive compatibility and market-clearing prices. When multiple items are offered through individual auctions, a bidder wanting a bundle of items faces an exposure problem if the bidder places a high value on a combination of goods but a low value on strict subsets of the desired collection. To remedy this, combinatorial auctions permit bids on bundles of goods. However, combinatorial auctions are hard to optimize and may not have incentive compatible mechanisms or market-clearing individual item prices. Several papers give approaches to provide incentive compatibility and imputed, individual prices. We find the relationships between these approaches and analyze their advantages and disadvantages. (C) 2002 Elsevier B.V. All rights reserved.
引用
收藏
页码:251 / 270
页数:20
相关论文
共 29 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]   Optimal investment in knowledge within a firm using a market mechanism [J].
Ba, SL ;
Stallaert, J ;
Whinston, AB .
MANAGEMENT SCIENCE, 2001, 47 (09) :1203-1219
[3]  
BIKHCHANDANI S, 2001, LINEAR PROGRAMMING V
[4]  
Clarke E, 1971, Public Choice, V11, P17, DOI DOI 10.1007/BF01726210
[5]  
DEMARTINI C, 1999, NEW IMPROVED DESIGN
[6]  
FAN M, 2000, DECENTRALIZED MECH D
[7]  
Fujishima Y, 1999, IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, P548
[8]  
GONEN R, 2000, P ACM C EL COMM EC 0
[9]   INCENTIVES IN TEAMS [J].
GROVES, T .
ECONOMETRICA, 1973, 41 (04) :617-631
[10]   SOLVING AIRLINE CREW SCHEDULING PROBLEMS BY BRANCH-AND-CUT [J].
HOFFMAN, KL ;
PADBERG, M .
MANAGEMENT SCIENCE, 1993, 39 (06) :657-682