Fair payoff distribution in multiagent systems under Pareto optimality

This research proposes a set of algorithms to compute fair payoff distribution among agents in service composition domain based on their contribution. In our system, intelligent agents, representing service providers, negotiate among themselves and form composite services to satisfy multiple-objective requirements. The quality of service for each objective is measured in term of degree of satisfaction. The overall quality of service is achieved by maximizing requesters satisfaction on all objectives according to Pareto optimality. We then deploy Shapley Value concept for fair payoff distribution among agents based on their contributions to the requesters optimal satisfaction. Since the computational complexity for Shapley Value is exponential, we are interested in investigating how well the algorithms for computing payoff perform. We found that on a typical computer, the algorithm can cope with around 20 agents with reasonable computational time.