Scholarlink

<p>Many of the methods proposed so far for solving the problems of the distribution of homogeneous indivisible goods widely described in the literature use allocation rules. In such an approach, appropriate functions are defined which assign exactly one solution to any allocation problem. The allocation of homogeneous indivisible goods is one of the types of problems that can be viewed through the lens of orders generated by permutations. Elements of the classes of such orders, which are identified with the preferences of decision-makers expressed through partial orders, enable other innovative approaches leading to a set of not necessarily single element optimal allocations. To this end, a matrix of distances between decision variants was constructed which in turn is basis for an IMFOS algorithm returning a set of optimal variants. The solutions introduced in the paper are not limited to the allocation problems, and can be used in various types of decision problems. In addition, the constructed matrix can be the basis for selecting optimal variants using the proposed IMFOS algorithm as well as many other well-known MCDM methods.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Distances in Agents' Preferences Graphs in Decision Problems

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年6月23日

查看全文
  • Janusz Łyko,
  • Maciej Szczeciński,
  • Katarzyna Cegiełka,
  • Arkadiusz Maciuk

摘要

Many of the methods proposed so far for solving the problems of the distribution of homogeneous indivisible goods widely described in the literature use allocation rules. In such an approach, appropriate functions are defined which assign exactly one solution to any allocation problem. The allocation of homogeneous indivisible goods is one of the types of problems that can be viewed through the lens of orders generated by permutations. Elements of the classes of such orders, which are identified with the preferences of decision-makers expressed through partial orders, enable other innovative approaches leading to a set of not necessarily single element optimal allocations. To this end, a matrix of distances between decision variants was constructed which in turn is basis for an IMFOS algorithm returning a set of optimal variants. The solutions introduced in the paper are not limited to the allocation problems, and can be used in various types of decision problems. In addition, the constructed matrix can be the basis for selecting optimal variants using the proposed IMFOS algorithm as well as many other well-known MCDM methods.