pith. sign in

arxiv: 1607.00695 · v1 · pith:BZG42IKTnew · submitted 2016-07-03 · 💻 cs.MA · cs.AI· cs.GT

Can we reach Pareto optimal outcomes using bottom-up approaches?

classification 💻 cs.MA cs.AIcs.GT
keywords paretooptimaloutcomesapproachesbottom-updecisionmakingoptimality
0
0 comments X
read the original abstract

Traditionally, researchers in decision making 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 Pareto optimal outcomes in a subgroup are also Pareto optimal in a supergroup of those agents in the case of strict, transitive, and complete preferences. Then, we empirically analyze the prospective usability and practicality of bottom-up approaches in a variety of decision making domains.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.