Optimal Decentralized Formation of K-member Partnerships

A.A. Chmielowiec; M.R. van Steen

doi:10.1109/SASO.2010.14

Optimal Decentralized Formation of K-member Partnerships

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

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

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. © 2010 IEEE.

Original language	English
Title of host publication	Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems
Place of Publication	New York, NY
Publisher	IEEE
Pages	154-163
DOIs	https://doi.org/10.1109/SASO.2010.14
Publication status	Published - 2010
Event	International Conference on Self-Adaptive and Self-Organizing Systems (SASO) - New York, NY Duration: 27 Sept 2010 → 1 Oct 2010

Conference

Conference	International Conference on Self-Adaptive and Self-Organizing Systems (SASO)
Period	27/09/10 → 1/10/10

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/SASO.2010.14

Persistent URL (handle)

Persistent link

Cite this

@inproceedings{d79f87b13a1f479291c2207b367dc3b2,

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. {\textcopyright} 2010 IEEE.",

author = "A.A. Chmielowiec and {van Steen}, M.R.",

year = "2010",

doi = "10.1109/SASO.2010.14",

language = "English",

pages = "154--163",

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

publisher = "IEEE",

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

}

TY - GEN

T1 - Optimal Decentralized Formation of K-member Partnerships

AU - Chmielowiec, A.A.

AU - van Steen, M.R.

PY - 2010

Y1 - 2010

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. © 2010 IEEE.

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. © 2010 IEEE.

U2 - 10.1109/SASO.2010.14

DO - 10.1109/SASO.2010.14

M3 - Conference contribution

SP - 154

EP - 163

BT - Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems

PB - IEEE

CY - New York, NY

T2 - International Conference on Self-Adaptive and Self-Organizing Systems (SASO)

Y2 - 27 September 2010 through 1 October 2010

ER -

Optimal Decentralized Formation of K-member Partnerships

Abstract

Conference

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this