Decision Making, Agent-based Negotiation
Classically, disciplines like negotiation and decision making have focused on reaching Pareto optimal solutions due to its stability and efficiency properties. Despite the fact that many practical and theoretical algorithms have successfully attempted to provide Pareto optimal solutions, they have focused on attempting to reach Pareto Optimality using horizontal approaches, where optimality is calculated taking into account every participant at the same time. Sometimes, this may prove to be a difficult task (e.g., conflict, mistrust, no information sharing, etc.). In this paper, we explore the possibility of achieving Pareto Optimal outcomes in a group by using a bottom-up approach: discovering Pareto optimal outcomes by interacting in subgroups. We analytically show that the set of Pareto optimal outcomes in a group covers the Pareto optimal outcomes within its subgroups. This theoretical finding can be applied in a variety of scenarios such as negotiation teams, multi-party negotiation, and team formation to social recommendation. Additionally, we empirically test the validity and practicality of this proof in a variety of decision making domains and analyze the usability of this proof in practical situations.
Bibtex info
@inproceedings{sanchez-anguix_can_2017,
address = {Cham},
title = {Can {We} {Reach} {Pareto} {Optimal} {Outcomes} {Using} {Bottom}-{Up} {Approaches}?},
isbn = {978-3-319-57285-7},
abstract = {Classically, disciplines like negotiation and decision making have focused on reaching Pareto optimal solutions due to its stability and efficiency properties. Despite the fact that many practical and theoretical algorithms have successfully attempted to provide Pareto optimal solutions, they have focused on attempting to reach Pareto Optimality using horizontal approaches, where optimality is calculated taking into account every participant at the same time. Sometimes, this may prove to be a difficult task (e.g., conflict, mistrust, no information sharing, etc.). In this paper, we explore the possibility of achieving Pareto Optimal outcomes in a group by using a bottom-up approach: discovering Pareto optimal outcomes by interacting in subgroups. We analytically show that the set of Pareto optimal outcomes in a group covers the Pareto optimal outcomes within its subgroups. This theoretical finding can be applied in a variety of scenarios such as negotiation teams, multi-party negotiation, and team formation to social recommendation. Additionally, we empirically test the validity and practicality of this proof in a variety of decision making domains and analyze the usability of this proof in practical situations.},
booktitle = {Conflict {Resolution} in {Decision} {Making}},
publisher = {Springer International Publishing},
author = {Sanchez-Anguix, Victor and Aydoğan, Reyhan and Baarslag, Tim and Jonker, Catholijn M.},
editor = {Aydoğan, Reyhan and Baarslag, Tim and Gerding, Enrico and Jonker, Catholijn M. and Julian, Vicente and Sanchez-Anguix, Victor},
year = {2017},
pages = {19--35},
}