Generating bids for group-related actions in the context of prior commitments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2333 LNAI, Issue , 2002, Pages 248-263

  Hunsberger, Luke ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Bid generation; Collaborative planning; Combinatorial auctions; Group decision making; Simple temporal networks; Temporal constraints

Indexed keywords

COMMERCE; INTELLIGENT AGENTS; NETWORK ARCHITECTURE; SCHEDULING ALGORITHMS; ALGORITHMS; COMPUTATIONAL LINGUISTICS; DECISION MAKING;

BID GENERATION; COLLABORATIVE PLANNING; COMBINATORIAL AUCTION; GROUP DECISION MAKING; SIMPLE TEMPORAL NETWORKS; TEMPORAL CONSTRAINTS;

DECISION MAKING; SOFTWARE AGENTS;

EID: 84901702446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45448-9_18     Document Type: Conference Paper

References (14)

1. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
2. Rina Dechter, Itay Meiri, and Judea Pearl. Temporal constraint networks. Artificial Intelligence, 49:61-95, 1991.
3. Yuzo Fujishima, Kevin Leyton-Brown, and Yoav Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 548-553, 1999.
4. Barbara J. Grosz and Sarit Kraus. Collaborative plans for complex group action. Artificial Intelligence, 86:269-357, 1996.
5. John F. Horty and Martha E. Pollack. Evaluating new options in the context of existing plans. Artificial Intelligence, 127(2):199-220, April 2001.
6. Luke Hunsberger and Barbara J. Grosz.Acombinatorial auction for collaborative planning. In Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000), pages 151-158. IEEE Computer Society, 2000.
7. Tuomas Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI- 99), 1999.
8. Eddie Schwalb and Rina Dechter. Processing disjunctions in temporal constraint networks. Artificial Intelligence, 93:29-61, 1997.
9. Ioannis Tsamardinos. Reformulating temporal plans for efficient execution. Master's thesis, University of Pittsburgh, 2000.
10. Ioannis Tsamardinos, Nicola Muscettola, and Paul Morris. Fast transformation of temporal plans for efficient execution. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98). AAAI Press/MIT Press, 1998.
11. Ioannis Tsamardinos, Martha E. Pollack, and John F. Horty. Merging plans with quantitative temporal constraints, temporally extended actions, and conditional branches. In Proceedings of the Artificial Intelligence Planning and Scheduling 2000 Conference (AIPS 2000), 2000.
12. Ioannis Tsamardinos, Martha E. Pollack, and Colleen McCarthy. Efficient solution techniques for the disjunctive temporal problem. Technical Report ISP001-01, Univeristy of Pittsburgh, 2001.
13. Thierry Vidal and Hélène Fargier. Contingent durations in temporal CSPs: from consistency to controllabilities. Linkoping Electronic Articles in Computer and Information Science, ISSN 1401-9841, 2(2), 1997. Available from: http://www.ep.liu.se/ea/cis/1997/002/.
14. Rattana Wetprasit and Abdul Sattar. Qualitative and quantitative temporal reasoning with points and durations. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98). AAAI Press/MIT Press, 1998.