Combinatorial auctions using rule-based bids

作者:

Highlights:

摘要

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.

论文关键词:Combinatorial auction,Heuristics,Constraint satisfaction,Integer programming

论文评审过程:Accepted 1 December 2001, Available online 5 February 2002.

论文官网地址:https://doi.org/10.1016/S0167-9236(02)00004-0