.png){kind=icon}
返回
Combinatorial auctions using rule-based bids
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-9236(02)00004-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
combinatorial auction
heuristics
constraint satisfaction
integer programming
期刊
IF:
6.8
论文数:
3.8K
被引数:
1.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容