Privacy-Preserving Coalition Forming between Rational Service Agents

Bastian Blankenburg, Matthias Klusch

In: A. Günter , Klaus-Dieter Althoff , R. Bergmann , F. Klügl , B. Ludwig , U. Schmid , J. Schneeberger , U. Visser , T. Böttcher (Hrsg.). KI - Künstliche Intelligenz, German Journal on Artificial Intelligence - Organ des Fachbereiches "Künstliche Intelligenz" der Gesellschaft für Informatik e.V. (KI) 1/2006 Seiten 18-24 BöttcherIT 2006.


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.

Deutsches Forschungszentrum für Künstliche Intelligenz
German Research Center for Artificial Intelligence