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

Victor Sanchez-Anguix; Reyhan Aydogan; Tim Baarslag; Catholijn M Jonker

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

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

Victor Sanchez-Anguix, Reyhan Aydogan, Tim Baarslag, Catholijn M Jonker

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

5 Citations (Scopus)

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.

Original language	English
Title of host publication	Conflict Resolution in Decision Making
Subtitle of host publication	Second International Workshop, COREDEMA 2016, The Hague, The Netherlands, August 29-30, 2016, Revised Selected Papers
Editors	Reyhan Aydoğan, Tim Baarslag, Enrico Gerding, Catholijn M. Jonker, Vicente Julian, Victor Sanchez-Anguix
Publisher	Springer Verlag
Pages	19-35
Number of pages	7
Volume	10238
Edition	1
ISBN (Electronic)	978-3-319-57285-7
ISBN (Print)	978-3-319-57284-0
DOIs	https://doi.org/10.1007/978-3-319-57285-7_2
Publication status	E-pub ahead of print - 21 Apr 2017
Event	Workshop on Conflict Resolution in Decision Making - Den Haag, Netherlands Duration: 29 Aug 2016 → 29 Aug 2016 Conference number: 2 http://ii.tudelft.nl/coredema2016/

Publication series

Name	Lecture Notes in Computer Science
Volume	10238
ISSN (Print)	0302-9743

Workshop

Workshop	Workshop on Conflict Resolution in Decision Making
Abbreviated title	COREDEMA 2016
Country/Territory	Netherlands
City	Den Haag
Period	29/08/16 → 29/08/16
Internet address	http://ii.tudelft.nl/coredema2016/

Access to Document

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

Cite this

Sanchez-Anguix, V., Aydogan, R., Baarslag, T., & Jonker, C. M. (2017). Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches? In R. Aydoğan, T. Baarslag, E. Gerding, C. M. Jonker, V. Julian, & V. Sanchez-Anguix (Eds.), Conflict Resolution in Decision Making: Second International Workshop, COREDEMA 2016, The Hague, The Netherlands, August 29-30, 2016, Revised Selected Papers (1 ed., Vol. 10238, pp. 19-35). (Lecture Notes in Computer Science; Vol. 10238). Springer Verlag. Advance online publication. https://doi.org/10.1007/978-3-319-57285-7_2

Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches? / Sanchez-Anguix, Victor; Aydogan, Reyhan; Baarslag, Tim et al.
Conflict Resolution in Decision Making: Second International Workshop, COREDEMA 2016, The Hague, The Netherlands, August 29-30, 2016, Revised Selected Papers. ed. / Reyhan Aydoğan; Tim Baarslag; Enrico Gerding; Catholijn M. Jonker; Vicente Julian; Victor Sanchez-Anguix. Vol. 10238 1. ed. Springer Verlag, 2017. p. 19-35 (Lecture Notes in Computer Science; Vol. 10238).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Sanchez-Anguix, V, Aydogan, R, Baarslag, T & Jonker, CM 2017, Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches? in R Aydoğan, T Baarslag, E Gerding, CM Jonker, V Julian & V Sanchez-Anguix (eds), Conflict Resolution in Decision Making: Second International Workshop, COREDEMA 2016, The Hague, The Netherlands, August 29-30, 2016, Revised Selected Papers. 1 edn, vol. 10238, Lecture Notes in Computer Science, vol. 10238, Springer Verlag, pp. 19-35, Workshop on Conflict Resolution in Decision Making, Den Haag, Netherlands, 29/08/16. https://doi.org/10.1007/978-3-319-57285-7_2

Sanchez-Anguix V, Aydogan R, Baarslag T, Jonker CM. Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches? In Aydoğan R, Baarslag T, Gerding E, Jonker CM, Julian V, Sanchez-Anguix V, editors, Conflict Resolution in Decision Making: Second International Workshop, COREDEMA 2016, The Hague, The Netherlands, August 29-30, 2016, Revised Selected Papers. 1 ed. Vol. 10238. Springer Verlag. 2017. p. 19-35. (Lecture Notes in Computer Science). Epub 2017 Apr 21. doi: 10.1007/978-3-319-57285-7_2

Sanchez-Anguix, Victor ; Aydogan, Reyhan ; Baarslag, Tim et al. / Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches?. Conflict Resolution in Decision Making: Second International Workshop, COREDEMA 2016, The Hague, The Netherlands, August 29-30, 2016, Revised Selected Papers. editor / Reyhan Aydoğan ; Tim Baarslag ; Enrico Gerding ; Catholijn M. Jonker ; Vicente Julian ; Victor Sanchez-Anguix. Vol. 10238 1. ed. Springer Verlag, 2017. pp. 19-35 (Lecture Notes in Computer Science).

@inbook{3f4ffdd3447c4def9d7ffd53014a9f55,

title = "Can We Reach Pareto Optimal Outcomes Using Bottom-Up Approaches?",

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.",

author = "Victor Sanchez-Anguix and Reyhan Aydogan and Tim Baarslag and Jonker, {Catholijn M}",

year = "2017",

month = apr,

day = "21",

doi = "10.1007/978-3-319-57285-7_2",

language = "English",

isbn = "978-3-319-57284-0",

volume = "10238",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "19--35",

editor = "Reyhan Aydoğan and Tim Baarslag and Enrico Gerding and Jonker, {Catholijn M.} and Vicente Julian and Victor Sanchez-Anguix",

booktitle = "Conflict Resolution in Decision Making",

address = "Austria",

edition = "1",

note = "Workshop on Conflict Resolution in Decision Making, COREDEMA 2016 ; Conference date: 29-08-2016 Through 29-08-2016",