Harnessing the search for rational bid schedules with stochastic search and domain-specific heuristics

Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004

Volumn 1, Issue , 2004, Pages 269-276

  Babanov, Alexander ^a   Collins, John ^a   Gini, Maria ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN-SPECIFIC HEURISTICS; EXPECTED UTILITY THEORY; RATIONAL BID SCHEDULES; STOCHASTIC SEARCH;

ALGORITHMS; BENCHMARKING; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FUNCTIONS; HEURISTIC METHODS; MULTI AGENT SYSTEMS; OPTIMIZATION; PROBABILITY; SCHEDULING; TREES (MATHEMATICS);

RANDOM PROCESSES;

EID: 4544221260     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. M. Babaioff and N. Nisan. Concurrent auctions across the supply chain. In Proceedings of the 3rd ACM conference on Electronic Commerce, pages 1-10. ACM Press, 2001.
2. A. Babanov, J. Collins, and M. Gini. Asking the right question: Risk and expectation in multi-agent contracting. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 17(4):173-186, September 2003.
3. A. Babanov, J. Collins, and M. Gini. Scheduling tasks with precedence constraints to solicit desirable bid combinations. In Proc. of the Second Int'l Conf. on Autonomous Agents and Multi-Agent Systems, pages 345-352, Melbourne, Australia, July 2003.
4. J. Collins, W. Ketter, and M. Gini. A multi-agent negotiation testbed for contracting tasks with temporal and precedence constraints. Int'l Journal of Electronic Commerce, 7(1):35-57, 2002.
5. W. Conen and T. Sandholm. Preference elicitation in combinatorial auctions. In Proc. of the First Int'l Conf. on Autonomous Agents and Multi-Agent Systems, volume 1, pages 168-169, Bologna, Italy, July 2002.
6. P. S. Dutta, S. Sen, and R. Mukherjee. Scheduling to be competitive in supply chains. In UCAI workshop on E-Business and the Intelligent Web, August 2001.
7. B. P. Gerkey and M. J. Matarić. Sold!: Auction methods for multi-robot coordination. IEEE Trans. Robotics and Automation, 18(5):758-786, October 2002.
8. L. Hunsberger. Generating bids for group-related actions in the context of prior commitments. In Intelligent Agents VIII, volume 2333 of LNAI. Springer-Verlag, 2002.
9. L. Hunsberger and B. J. Grosz. A combinatorial auction for collaborative planning. In Proc. of 4th Int'l Conf on Multi-Agent Systems, pages 151-158, Boston, MA, 2000. IEEE Computer Society Press.
10. V. Krishna. Auction Theory. Academic Press, London, UK, 2002.
11. A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, January 1995.
12. J. W. Pratt. Risk aversion in the small and in the large. Econometrica, 32:122-136, 1964.
13. C. R. Reeves. Modern Heuristic Techniques for Combinatorial Problems. John Wiley & Sons, New York, NY, 1993.
14. N. M. Sadeh, D. W. Hildum, D. Kjenstad, and A. Tseng. MASCOT: an agent-based architecture for coordinated mixed-initiative supply chain planning and scheduling. In Workshop on Agent-Based Decision Support in Managing the Internet-Enabled Supply-Chain, at Agents '99, pages 133-138, 1999.
15. R. G. Smith. The contract net protocol: High level communication and control in a distributed problem solver. IEEE Trans. Computers, 29(12):1104-1113, December 1980.
16. W. Walsh and M. Wellman. A market protocol for decentralized task allocation and scheduling with hierarchical dependencies. In Proc. of 3th Int'l Conf on Multi-Agent Systems, 1998.
17. W. E. Walsh, M. Wellman, and F. Ygge. Combinatorial auctions for supply chain formation. In Proc. of ACM Conf on Electronic Commerce (EC'00), pages 260-269, October 2000.
18. J. P. Watson, J. C. Beck, A. Howe, and L. D. Whitley. Problem diffl culty for tabu search in job-shop scheduling. Artificial Intelligence, pages 189-217, 2002.
19. M. Wellman, J. MacKie-Mason, D. Reeves, and S. Swaminathan. Exploring bidding strategies for market-based scheduling. In Proc. of Fourth ACM Conf on Electronic Commerce, 2003.
20. M. P. Wellman, W. E. Walsh, P. R. Wurman, and J. K. MacKie-Mason. Auction protocols for decentralized scheduling. Games and Economic Behavior, 35:271-303, 2001.
21. P. R. Wurman, M. P. Wellman, and W. E. Walsh. Specifying rules for electronic auctions. AI Magazine, 23(3): 15-24, 2002.