Software Agent Negotiation for Service Composition

Advances in Intelligent and Soft Computing

2011

Abstract. This paper presents a novel approach for managing multibilateral concurrent negotiations. We extend our previous work by considering a situation where a buyer agent negotiates with multiple seller agents concurrently over multiple continuous issues instead of a single issue. A related work in this area considers a meta-strategy for bilateral negotiations. This work adapts the previous related work to coordinate multi-bilateral concurrent negotiations taking into consideration the different behaviors of the opponents during negotiation to decide on choosing the appropriate negotiation strategy (i.e., trade-off or concession) for the buyer agent's delegates at each negotiation round. A negotiation meta-strategy to coordinate the one-to-many negotiation form is proposed and empirically tested under various negotiation environments. The experiments show the robustness of our coordination mechanism.

Section: Introductionmentioning

confidence: 98%

A Meta-Strategy for Coordinating of One-to-Many Negotiation over Multiple Issues

Advances in Intelligent and Soft Computing

2011

“…[29]. In the service-oriented domain for example, a service requester can negotiate concurrently with multiple service providers over the service level agreements for the purpose of procuring one or more services [17].…”

Section: Introductionmentioning

confidence: 99%

“…Automated QoS negotiation remains as an active research area especially in the service-oriented computing domain [17], [23], [26]. The one-to-many negotiation is an alternative mechanism to the single-sided auction protocol, which introduces more flexibility for both buyers and sellers in terms of expressing their preferences by exchanging offers and counteroffers [1], [2], [19], [21].…”

Section: Introductionmentioning

confidence: 99%

“…The parameter ρ 2 is used to determine the amount of change to each member in W. In testing different ρ 2 , we choose ρ 1 = 2. The new generated W matrix is adjusted before its final use (see lines [10][11][12][13][14][15][16][17][18][19] in Algorithm 3). The last step is important to make sure that the weight of each issue does not differ from its value in IW beyond the threshold value.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Coordinating the Bidding Strategy in Multiissue Multiobject Negotiation With Single and Multiple Providers

2015

IEEE Trans. Cybern.

This paper addresses the problem of flexible procurement of multiple distinct services characterized by multiple nonfunctional characteristics, i.e., quality-of-service attributes. We consider the one-to-many negotiation approach as a flexible method for procuring multiple different services by a buyer agent. We address the problem of coordinating the bidding strategy amongst multiple concurrent negotiations and propose novel dynamic negotiation strategies. The proposed strategies consider the behaviors of the opponents of the current negotiation encounter in managing the local reservation values of the common negotiation issues (attributes) of different services. Most previous works consider the problem of negotiation over a single object characterized by one or more issues. We extend our previous work and investigate a more complex situation where a buyer agent negotiates over multiple distinct services given that each service has multiple negotiation issues and multiple possible providers. The experimental results show evidence for the effectiveness and robustness of our dynamic negotiation strategies under various negotiation environments.

“…Automated QoS negotiation remains an active research area especially in the service oriented computing domain [9] [20] [14] [17]. In this paper, we coordinate the bidding strategy for a buyer agent negotiating concurrently with multiple service providers.…”

Section: Introductionmentioning

confidence: 99%

Preference Based Automated Negotiation for Service Procurement in Multi-agent Systems

2014 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)

2014

This paper addresses the problem of automated agent-based one-to-many negotiation for multi-issue service procurement and presents a robust negotiation mechanism to enhance the procurement process. Software agents represent service sellers and service buyers. Agents are assumed to have goals and constraints when buying and selling services. Automating the service procurement process can provide fast and efficient procurement results. The presented negotiation mechanism uses a concession tactic that facilitates service procurement from the best provider amongst multiple prospective providers. The strategy of the tactic is based on offering more concessions on the negotiation issues that are believed to be more preferred to the opponents. In other words, the tactic considers the preferences of the opponent agents on different negotiation issues (attributes) before selecting the amount of the concession on each issue. The negotiation mechanism is validated experimentally.