Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches?

  • Victor Sanchez-Anguix
  • Reyhan Aydoğan
  • Tim Baarslag
  • Catholijn M. Jonker
Conference paper

DOI: 10.1007/978-3-319-57285-7_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10238)
Cite this paper as:
Sanchez-Anguix V., Aydoğan R., Baarslag T., Jonker C.M. (2017) Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches?. In: Aydoğan R., Baarslag T., Gerding E., Jonker C., Julian V., Sanchez-Anguix V. (eds) Conflict Resolution in Decision Making. COREDEMA 2016. Lecture Notes in Computer Science, vol 10238. Springer, Cham

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.

Keywords

Pareto optimality Agreement technologies Group decision making Multi-agent systems Artificial intelligence 

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Coventry UniversityCoventryUK
  2. 2.Özyeğin UniversityIstanbulTurkey
  3. 3.Centrum Wiskunde and InformaticaAmsterdamNetherlands
  4. 4.Technical University of DelftDelftNetherlands

Personalised recommendations