Preference elicitation in combinatorial auctions
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Bidtree Ordering in IDA* Combinatorial Auction Winner-Determination with Side Constraints
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Auction design with costly preference elicitation
Annals of Mathematics and Artificial Intelligence
An adaptive solution to dynamic transport optimization
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
A Multi-Agent Negotiation Testbed for Contracting Tasks with Temporal and Precedence Constraints
International Journal of Electronic Commerce
The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver
IEEE Transactions on Computers
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Multi-objective optimization for dynamic task allocation in a multi-robot system
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
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 paper presents an approach to make such preferences explicit and to use these preferences in bids for reverse combinatorial auctions. Three different types of preference are considered: (1) preferences for particular durations of tasks, (2) preferences for certain time points, and (3) preferences for specific types of tasks. We study empirically the tradeoffs between the quality of the solutions obtained and the use of preferences in the bidding process, focusing on effects such as increased execution time. We use both synthetic data as well as real data from a logistics company.