Paper Info
Title
Computing Pareto Optimal Agreements in Multi-issue Negotiation for Service Composition
Abstract
In a market of services, customers require Service Based Applications (SBAs) with specific QoS constraints usually expressed as end-to-end requirements. Here, we show that mechanisms used to find Pareto optimal agreements can be extended in order to compute them also in the case of ne- gotiation for market-based service composition, where dif- ferent provider agents compete to provide the same service. Moreover, we discuss how these mechanisms allow a cus- tomer agent to concurrently negotiate with all available ser- vice provider agents.
Year
DOI
Venue
2015
10.5555/2772879.2773433
Autonomous Agents and Multi-Agent Systems
Keywords
Field
DocType
Electronic markets, Bargaining and Negotiation
Service based applications,Computer science,Quality of service,Electronic markets,Pareto optimal,Service composition,Distributed computing,Negotiation
Conference
Citations 
PageRank 
References 
2
0.39
2
Authors
3
Name
Order
Citations
PageRank
Claudia Di Napoli18321.12
Dario Di Nocera2123.39
Silvia Rossi3227.08