Publication: Fair payoff distribution in multi-agent systems under Pareto optimality
Submitted Date
Received Date
Accepted Date
Issued Date
2017
Copyright Date
Announcement No.
Application No.
Patent No.
Valid Date
Resource Type
Edition
Resource Version
Language
en
File Type
No. of Pages/File Size
ISBN
ISSN
eISSN
Scopus ID
WOS ID
Pubmed ID
arXiv ID
item.page.harrt.identifier.callno
Other identifier(s)
Journal Title
2017 2nd International Conference on Information Technology (INCIT)
Volume
Issue
Edition
Start Page
End Page
Access Rights
Access Status
Rights
Rights Holder(s)
Physical Location
Bibliographic Citation
Research Projects
Organizational Units
Authors
Journal Issue
Title
Fair payoff distribution in multi-agent systems under Pareto optimality
Alternative Title(s)
Author(s)
Author’s Affiliation
Author's E-mail
Editor(s)
Editor’s Affiliation
Corresponding person(s)
Creator(s)
Compiler
Advisor(s)
Illustrator(s)
Applicant(s)
Inventor(s)
Issuer
Assignee
Other Contributor(s)
Series
Has Part
Abstract
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.