Sciweavers

41 search results - page 2 / 9
» A Lagrangian Heuristic for Winner Determination Problem in C...
Sort
View
ICMAS
2000
13 years 8 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
ATAL
2008
Springer
13 years 9 months ago
Computationally-efficient winner determination for mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner deter...
Andrea Giovannucci, Meritxell Vinyals, Juan A. Rod...
ATAL
2007
Springer
14 years 1 months ago
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high ...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
WSC
2008
13 years 9 months 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
JIFS
2007
115views more  JIFS 2007»
13 years 7 months ago
Winner determination for combinatorial auctions for tasks with time and precedence constraints
We present a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids, and which works for au...
Güleser K. Demir, Maria L. Gini