Combinatorial auctions using rule-based bids

被引:48
作者
Jones, JL
Koehler, GJ
机构
[1] Univ Michigan, Sch Business, Ann Arbor, MI 48109 USA
[2] Univ Florida, Warrington Coll Business, Gainesville, FL 32611 USA
关键词
combinatorial auction; heuristics; constraint satisfaction; integer programming;
D O I
10.1016/S0167-9236(02)00004-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The migration of auctions to the Internet provides a unique opportunity to harness the power of computing to create new auction forms that were previously impossible. We describe a new type of combinatorial auction that accepts rule-based bids. Allowing bids in the form of high-level rules relieves the buyer from the burden of enumerating all possible acceptable bundles. The allocation of goods requires solving a complex combinatorial problem, a task that is completely impractical in a conventional auction setting. We describe simplifying winner determination heuristics developed in this study to make large problems of this nature manageable. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:59 / 74
页数:16
相关论文
共 34 条