Introduction to algorithms
Artificial Intelligence - Special issue on knowledge representation
Collaborative plans for complex group action
Artificial Intelligence
Processing disjunctions in temporal constraint networks
Artificial Intelligence
Fast transformation of temporal plans for efficient execution
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Evaluating new options in the context of existing plans
Artificial Intelligence
Qualitative and Quantitative Temporal Reasoning with Points and Durations
TIME '98 Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning
A Combinatorial Auction for Collaborative Planning
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
An algorithm for optimal winner determination in combinatorial auctions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Algorithms for a temporal decoupling problem in multi-agent planning
Eighteenth national conference on Artificial intelligence
Hi-index | 0.00 |
This paper addresses the problem of bid generation for a group decision-making mechanism based on a combinatorial auction in which agents bid on sets of tasks in a proposed group activity. It presents algorithms that an agent may use to generate temporal constraints for bids in such auctions. These constraints allow an agent making a bid to protect its private schedule of pre-existing commitments in case the bid is ultimately awarded. A task-integration-scheduling algorithm determines whether a new set of tasks can be merged into an agent's private schedule of pre-existing commitments. A temporal-constraint-generation algorithm generates the weakest set of temporal constraints (for inclusion in a bid) sufficient to protect the agent's modified schedule from any possible auction outcome. A proof of correctness for the temporal-constraint-generation algorithm is given. Both algorithms employ Simple Temporal Networks. Although the algorithms are presented in the context of a particular group decision-making mechanism, they have broader applicability to scenarios in which one agent makes an offer to other agents.