Sciweavers

549 search results - page 2 / 110
» Computational Bundling for Auctions
Sort
View
CCGRID
2009
IEEE
13 years 6 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
SIGECOM
2003
ACM
107views ECommerce» more  SIGECOM 2003»
13 years 11 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
HUMAN
2003
Springer
13 years 11 months ago
A Framework of Winner Determination Algorithms for Internet Auctions
Auctions have become popular in conducting trade negotiations on the Internet. The design of new auction formats and other negotiation protocols has become an important topic for r...
Juhnyoung Lee, Sang-goo Lee, Suekyung Lee

Publication
325views
15 years 3 months ago
An Optimal Multi-Unit Combinatorial Procurement Auction with Single Minded Bidders
Abstract: The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (singl...
Sujit Guajr, Y Narahari
JAIR
2006
101views more  JAIR 2006»
13 years 5 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee