Optimal Decentralized Formation of K-member Partnerships

A.A. Chmielowiec, M.R. van Steen

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review


To keep pace with constantly changing markets, many companies are seeking strategic partnerships. In this paper, we assume that a company can electronically provide a profile of the product or service it has to offer. This profile is described in such a way that potential partners can assess the fitness of the company for eventually teaming up. We concentrate on the fully decentralized optimal formation of teams consisting of k members. This problem boils down to developing a decentralized, efficient algorithm for solving a variant of the maximal weighted k-subgraph problem. We provide a first solution, along with an assessment of its performance, thereby concentrating on the feasibility of an actual embedding in real-world scenarios consisting of thousands of companies. In particular, any solution should be highly adaptive when new or fresh information concerning potential partners comes available. © 2010 IEEE.
Original languageEnglish
Title of host publicationFourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Place of PublicationNew York, NY
Publication statusPublished - 2010
EventInternational Conference on Self-Adaptive and Self-Organizing Systems (SASO) - New York, NY
Duration: 27 Sep 20101 Oct 2010


ConferenceInternational Conference on Self-Adaptive and Self-Organizing Systems (SASO)


Dive into the research topics of 'Optimal Decentralized Formation of K-member Partnerships'. Together they form a unique fingerprint.

Cite this