Stable team formation among self-interested agents

AAAI Workshop - Technical Report

Volumn WS-04-06, Issue , 2004, Pages 29-36

  Rathod, Priyang ^a   Desjardins, Marie ^a  

^a Baltimore County   (United States)

Author keywords

Long term team formation; Multi agent systems; Stable teams

Indexed keywords

LONG-TERM TEAM FORMATION; ORGANIZATIONAL EFFICIENCY; STABLE CONTRACTUAL ALLIANCE; STABLE TEAMS;

ARTIFICIAL INTELLIGENCE; COMPUTER SUPPORTED COOPERATIVE WORK; INTELLIGENT AGENTS; MULTI AGENT SYSTEMS;

AUTONOMOUS AGENTS;

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

References (19)

1. Axtell, R. 1999. The emergence of fi rms in & population of agents: Local increasing returns, unstable Nash equilibria, and power law size distributions. Technical Report Working Paper No.3, Brookings Institution.
2. Boutilier, C.; Goldszmidt, M.; and Sabata, B. 1999. Sequential auctions for the allocation of resources with complementarities., In IJCAI, 527-523.
3. Chavez, A.;Moukas, A.; and Macs, P 1997. Challenger: A multi -agent system for distributed resource allocation. In Johnson, W.L., and Hayes-Roth, B., eds., Proceedings of the First, international Conference on Autonomous Agents (Agents '97), 323-331. New York: ACM Press.
4. Gerkey, B. P., and Matarić, M. J. 2002. Sold!: Auction methods for multi-robot coordination. IEEE Transactions on Robotics and Automation 18(5):758-768.
5. Gerkey, B. P., and Matarić, M. J. 2003. Multi-robot task allocation: Analyzing the complexity and optimality of key architectures. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA),3862-3868.
6. Greenwald, A., and Boyan, J. 2001. Bid determination in simultaneous auctions-a case study. In Proceedings of the Third ACM Conference on Electronic Commerce, 210-212.
7. Huberman, B. A., and Hogg, T. 1995. Communities of practice: Performance and evolution. Computational and Mathematical Organization Theory 1:73-92.
8. Huhns, M. N., and Stephens, L. M. 2001. Multiagent systems and societies of agents. In Weiss, G., ed., Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. The MIT Press. 79 - 120.
9. Modi, P. J.; Jung, H.; Tambe, M.; Shen, W.-M.; and Kulkarni, S. 2001. A dynamic distributed constraint satisfaction approach to resource allocation. In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, 685-700.
10. Niemelä, I. 1999. On the complexity of dynamic constraint satisfaction. In Proceedings of the FLoC Workshop on Complexity-Theoretic and Recursion-Theoretic Methods in Databases, Artificial Intelligence and Finite Model Theory, 38-47.
11. Sandholm, T. 2002. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2):1-54.
12. Tambe, M. 1997a. Agent architectures for flexible, practical teamwork. In Proceedings of the 14th National Conference on Artificial Intelligence, 22-28.
13. Tambe, M. 1997b. Towards flexible teamwork. Journal of Artificial Intelligence Research 7:83-124.
14. Tambe, M. 1998. Implementing agent teams in dynamic multi-agent environments. Applied Artificial Intelligence 12:189-210.
15. Wellman, M. P., and Wurman, P. R. 1998. Market-aware agents for a multiagent world. Robotics and Autonomous Systems 24:115-125.
16. Wellman, M. P. 1995. The economic approach to artificial intelligence. ACM Computing Surveys 27(3):340-342.
17. Wellman, M. P. 1996. Market-oriented programming: Some early lessons. In Clearwater, S., ed., Market-Based Control: A Paradigm for Distributed Resource Allocation. River Edge, New Jersey: World Scientifi c. 74-95.
18. Yokoo, M., and Hirayama, K. 2000. Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems 3(2): 185-207.
19. Yokoo, M.; Durfee, E. H.; Ishida, T.; and Kuwabara, K. 1998. The distributed constraint satisfaction problem: Formalization and algorithms. Knowledge and Data Engineering 10(5):673-685.