Abstract
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.
Original language | English |
---|---|
Title of host publication | 2010 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010 |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 154-163 |
Number of pages | 10 |
ISBN (Electronic) | 978-0-7695-4232-4 |
ISBN (Print) | 978-1-4244-8537-6 |
DOIs | |
Publication status | Published - 1 Dec 2010 |
Externally published | Yes |
Event | 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010 - Budapest, Hungary Duration: 27 Sept 2010 → 1 Oct 2010 Conference number: 4 http://www.inf.u-szeged.hu/projectdirs/saso10/index.php?menu=calls |
Publication series
Name | IEEE International Conference on Self-Adaptive and Self-Organizing Systems |
---|---|
Publisher | IEEE |
Volume | 2010 |
ISSN (Print) | 1949-3673 |
ISSN (Electronic) | 1949-3681 |
Conference
Conference | 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010 |
---|---|
Abbreviated title | SASO 2010 |
Country/Territory | Hungary |
City | Budapest |
Period | 27/09/10 → 1/10/10 |
Internet address |
Keywords
- Overlay networks
- Protocols
- Self-organization
- Self-stabilization
- Variable neighbourhood search
- Weighted k-clique matching