A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM - Special 25th Anniversary Issue
Anonymity, unobservability, and pseudeonymity — a proposal for terminology
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
The Advantages of Compromising in Coalition Formation with Incomplete Information
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Bayesian Reinforcement Learning for Coalition Formation under Uncertainty
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Trusted kernel-based coalition formation
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Methods for task allocation via agent coalition formation
Artificial Intelligence
| Hi-index | 0.00 |
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.