Sciweavers

197 search results - page 5 / 40
» Bidding and allocation in combinatorial auctions
Sort
View
AI
2002
Springer
14 years 10 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
SIGECOM
2003
ACM
143views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
Differential-revelation VCG mechanisms for combinatorial auctions
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the biddersā...
Wolfram Conen, Tuomas Sandholm
EOR
2011
140views more  EOR 2011»
14 years 1 months ago
Compact bidding languages and supplier selection for markets with economies of scale and scope
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...
Martin Bichler, Stefan Schneider, Kemal Guler, Meh...
ACMICEC
2003
ACM
160views ECommerce» more  ACMICEC 2003»
15 years 3 months ago
An algorithm for computing the outcome of combinatorial auctions with proxy bidding
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
Peter R. Wurman, Gangshu Cai, Jie Zhong, Ashish Su...
100
Voted
WSC
2008
15 years 13 days ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese