Optimal decentralized formation of k-member partnerships

Anna Chmielowiec; Maarten Van Steen

doi:10.1109/SASO.2010.14

Optimal decentralized formation of k-member partnerships

Anna Chmielowiec^*, Maarten Van Steen

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

3 Citations (Scopus)

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	https://doi.org/10.1109/SASO.2010.14
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	http://www.inf.u-szeged.hu/projectdirs/saso10/index.php?menu=calls

Keywords

Overlay networks
Protocols
Self-organization
Self-stabilization
Variable neighbourhood search
Weighted k-clique matching

Access to Document

10.1109/SASO.2010.14

Cite this

@inproceedings{73698a4b7361463abdcbb6ee09de9ff7,

title = "Optimal decentralized formation of k-member partnerships",

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.",

keywords = "Overlay networks, Protocols, Self-organization, Self-stabilization, Variable neighbourhood search, Weighted k-clique matching",

author = "Anna Chmielowiec and {Van Steen}, Maarten",

year = "2010",

month = dec,

day = "1",

doi = "10.1109/SASO.2010.14",

language = "English",

isbn = "978-1-4244-8537-6",

series = "IEEE International Conference on Self-Adaptive and Self-Organizing Systems",

publisher = "IEEE",

pages = "154--163",

booktitle = "2010 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010",

address = "United States",

note = "4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010, SASO 2010 ; Conference date: 27-09-2010 Through 01-10-2010",

url = "http://www.inf.u-szeged.hu/projectdirs/saso10/index.php?menu=calls",

}

Chmielowiec, A & Van Steen, M 2010, Optimal decentralized formation of k-member partnerships. in 2010 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010., 5630461, IEEE International Conference on Self-Adaptive and Self-Organizing Systems, vol. 2010, IEEE, Piscataway, NJ, pp. 154-163, 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010, Budapest, Hungary, 27/09/10. https://doi.org/10.1109/SASO.2010.14

Optimal decentralized formation of k-member partnerships. / Chmielowiec, Anna; Van Steen, Maarten.
2010 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010. Piscataway, NJ: IEEE, 2010. p. 154-163 5630461 (IEEE International Conference on Self-Adaptive and Self-Organizing Systems; Vol. 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Optimal decentralized formation of k-member partnerships

AU - Chmielowiec, Anna

AU - Van Steen, Maarten

N1 - Conference code: 4

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

KW - Overlay networks

KW - Protocols

KW - Self-organization

KW - Self-stabilization

KW - Variable neighbourhood search

KW - Weighted k-clique matching

UR - http://www.scopus.com/inward/record.url?scp=79952048850&partnerID=8YFLogxK

U2 - 10.1109/SASO.2010.14

DO - 10.1109/SASO.2010.14

M3 - Conference contribution

AN - SCOPUS:79952048850

SN - 978-1-4244-8537-6

T3 - IEEE International Conference on Self-Adaptive and Self-Organizing Systems

SP - 154

EP - 163

BT - 2010 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010

PB - IEEE

CY - Piscataway, NJ

T2 - 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010

Y2 - 27 September 2010 through 1 October 2010

ER -

Optimal decentralized formation of k-member partnerships

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this