BSCA-P: Privacy Preserving Coalition Formation

In the setting of cooperation of rational web service agents via coalition formation, we devise an algorithm BSCA-P to form recursively bilateral Shapley value stable coalitions. The main focus lies on privacy aspects: we show that the BSCA-P enables the formation of subgame stable and individually rational coalitions while hiding absolute coalition values and payoffs, as well as allowing for anonymous service requests and access.

• Type: Conference
• Year: 2005
• Where: MATES
• Authors: Bastian Blankenburg, Matthias Klusch
• Keywords: MATES 2005, Rational Coalitions, Rational Web Service, Value Stable Coalitions