Abstract
We extend Sandholm’s bidtree-based IDA* algorithm for combinatorial auction winner determination to deal with negotiation over tasks with precedence constraints. We evaluate its performance, and show that the order of items in the bidtree has a major impact on performance. Specifically, performance is enhanced if the items with the largest numbers of bids are at the top of the bidtree. This is due to the fact that the effective branching factor in the search tree is controlled by the number of bids returned from a query to the bidtree, which in turn is strongly related to its construction.
| Original language | English (US) |
|---|---|
| Title of host publication | Agent-Mediated Electronic Commerce IV |
| Subtitle of host publication | Designing Mechanisms and Systems - AAMAS 2002 Workshop on Agent-Mediated Electronic Commerce, Revised Papers |
| Editors | Julian Padget, Onn Shehory, David Parkes, Norman Sadeh, William E. Walsh |
| Publisher | Springer Verlag |
| Pages | 17-33 |
| Number of pages | 17 |
| ISBN (Print) | 9783540003274 |
| DOIs | |
| State | Published - 2002 |
| Event | Workshop on Agent-Mediated Electronic Commerce, AAMAS 2002 - Bologna, Italy Duration: Jul 16 2002 → Jul 16 2002 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 2531 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | Workshop on Agent-Mediated Electronic Commerce, AAMAS 2002 |
|---|---|
| Country/Territory | Italy |
| City | Bologna |
| Period | 7/16/02 → 7/16/02 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2002.