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.
|Title of host publication||Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems|
|Place of Publication||New York, NY|
|Publication status||Published - 2010|
|Event||International Conference on Self-Adaptive and Self-Organizing Systems (SASO) - New York, NY|
Duration: 27 Sep 2010 → 1 Oct 2010
|Conference||International Conference on Self-Adaptive and Self-Organizing Systems (SASO)|
|Period||27/09/10 → 1/10/10|