Sciweavers

197 search results - page 4 / 40
» Bidding and allocation in combinatorial auctions
Sort
View
IJCAI
2001
14 years 11 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
Using value queries in combinatorial auctions
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
Benoît Hudson, Tuomas Sandholm
ECAI
2008
Springer
14 years 12 months ago
Agents Preferences in Decentralized Task Allocation
The ability to express preferences for specific tasks in multi-agent auctions is an important element for potential users who are considering to use such auctioning systems. This p...
Mark Hoogendoorn, Maria L. Gini
88
Voted
IAT
2007
IEEE
15 years 4 months ago
Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling
We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resource...
Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, J...
ATAL
2010
Springer
14 years 11 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson