Sciweavers

80 search results - page 8 / 16
» Bidding algorithms for a distributed combinatorial auction
Sort
View
ATAL
2004
Springer
15 years 2 months ago
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...
Benoît Hudson, Tuomas Sandholm
ATAL
2007
Springer
15 years 3 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...
CEC
2008
IEEE
15 years 3 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
AAAI
2004
14 years 10 months ago
Combinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
Vincent Conitzer, Jonathan Derryberry, Tuomas Sand...
ATAL
2003
Springer
15 years 2 months ago
Risk-averse auction agents
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
Yaxin Liu, Richard Goodwin, Sven Koenig