skip to main content
10.1145/1015330.1015380acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmlConference Proceedingsconference-collections
Article

Coalition calculation in a dynamic agent environment

Published:04 July 2004Publication History

ABSTRACT

We consider a dynamic market-place of self-interested agents with differing capabilities. A task to be completed is proposed to the agent population. An agent attempts to form a coalition of agents to perform the task. Before proposing a coalition, the agent must determine the optimal set of agents with whom to enter into a coalition for this task; we refer to this activity as coalition calculation. To determine the optimal coalition, the agent must have a means of calculating the value of any given coalition. Multiple metrics (cost, time, quality etc.) determine the true value of a coalition. However, because of conflicting metrics, differing metric importance and the tendency of metric importance to vary over time, it is difficult to obtain a true valuation of a given coalition. Previous work has not addressed these issues. We present a solution based on the adaptation of a multi-objective optimization evolutionary algorithm. In order to obtain a true valuation of any coalition, we use the concept of Pareto dominance coupled with a distance weighting algorithm. We determine the Pareto optimal set of coalitions and then use an instance-based learning algorithm to select the optimal coalition. We show through empirical evaluation that the proposed technique is capable of eliciting metric importance and adapting to metric variation over time.

References

  1. Caillou, P., Aknine, S., & Pinson, S. (2002). A multi-agent method for forming and dynamic restructuring of pareto optimal coalitions. Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems (pp. 1074--1081). Bologna, Italy: ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Dutta, P., & Sen, S. (2002). Emergence of stable coalitions via task exchanges. Proceedings of the First International Joint Conference of Autonomous Agents and Multi-Agent Systems (pp. 312--313). Bologna, Italy: ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. He, M., Jennings, N., & Leung, H. (2003). On agent-mediated electronic commerce. Knowledge and Data Engineering, IEEE Transactions on, 15, 985--1003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Saha, S., Sen, S., & Dutta, P. (2003). Helping based on future expectations. Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (pp. 289--296). Melbourne, Australia: ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Sandholm, T. W. (1999). Distributed rational decision making. In G. Weiss (Ed.), Multiagent systems: A modern approach to distributed artificial intelligence, 201--258. Cambridge, MA, USA: The MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Sen, S., & Dutta, P. (2000). Searching for the optimal coalition structure. Proceedings of the Fourth International Conference on Multiagent Systems (pp. 286--292). Boston, Massachusetts: IEEE. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Shehory, O. (2003a). Coalition formation: Towards feasible solutions. Proceedings of the 3rd International Central and Eastern European Conference on Multi-Agent Systems (pp. 218--251). Prague, Czech Republic: Springer-Verlag.Google ScholarGoogle Scholar
  8. Shehory, O. (2003b). Coalition formation with uncertain heterogeneous information. Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (pp. 1--8). Melbourne, Australia: ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Shehory, O., & Kraus, S. (1999). Feasible formation of coalitions among autonomous agents in nonsuperadditve environments. Computational Intelligence, 15, 218--251.Google ScholarGoogle ScholarCross RefCross Ref
  10. Srinivas, N., & Deb, K. (1994). Multiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation, 2, 221--248.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Tsvetovat, M., Sycara, K., Chen, Y., & Ying, J. (2000). Customer coalitions in the electronic marketplace. Proceedings of the Fourth International Conference on Autonomous Agents (pp. 263--264). Barcelona, Catalonia, Spain: ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Zitzler, E., Laumanns, M., & Bleuler, S. (2004). A tutorial on evolutionary multiobjective optimization. Proceedings of the Workshop on Multiple Objective Metaheuristics. Paris, France: Springer-Verlag.Google ScholarGoogle ScholarCross RefCross Ref
  13. Zitzler, E., Laumanns, M., & Thiele, L. (2001). Spea2: Improving the strength pareto evolutionary algorithm (Technical Report 103). Swiss Federal Institute of Technology, Gloriastrasse 35, CH-8092 Zurich, Switzerland.Google ScholarGoogle Scholar
  14. Zitzler, E., & Thiele, L. (1998). An evolutionary algorithm for multiobjective optimization: The strength pareto approach (Technical Report 43). Swiss Federal Institute of Technology, Gloriastrasse 35, CH-8092 Zurich, Switzerland.Google ScholarGoogle Scholar
  1. Coalition calculation in a dynamic agent environment

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ICML '04: Proceedings of the twenty-first international conference on Machine learning
      July 2004
      934 pages
      ISBN:1581138385
      DOI:10.1145/1015330
      • Conference Chair:
      • Carla Brodley

      Copyright © 2004 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 4 July 2004

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate140of548submissions,26%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader