不完备成对比较矩阵的填充模式设计:具有最小直径的(准)正则图
Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
AI总结:
针对成对比较集合可自主选择的多准则决策问题,研究在正则与准正则图中寻找最小直径的图,为不完备成对比较矩阵的填充模式提供建议,以减少中间比较带来的累积误差。
摘要:
多准则决策问题对个体和群体都十分重要。成对比较在偏好建模与量化的理论和实践中已得到广泛应用。本文聚焦于成对比较集合可自主选择(即并非预先给定)的决策问题。本文的目标是基于不完备成对比较矩阵(PCMs)的图表示,为其填充模式提供建议。正则性指每个项目与其他项目的比较次数相同,从而形成一种对称性。顶点数为奇数的图若满足除一个顶点的度数比其他顶点大1之外,所有顶点的度数均为相同的奇数,则称之为准正则图。若存在一对项目,它们之间的最短连接路径非常长,则这两个项目之间的比较将依赖于大量中间比较,且可能受到所有中间比较误差的影响。此前已发现此类案例:由乒乓球运动员比赛生成的图中,两个顶点(运动员)之间存在很长的最短路径,且计算得出的结果具有误导性。若比较图的直径(在相同边数的图中)尽可能小,我们就能避免,或至少减少此类累积误差。本研究的目标是在正则图和准正则图中找到直径最小的图。理论研究者和从业者均可使用附录中以多种形式给出的结果:图、邻接矩阵、边列表。
英文摘要:
Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the set of pairwise comparisons can be chosen, i.e., it is not given a priori. The objective of this paper is to provide recommendations for filling patterns of incomplete pairwise comparison matrices (PCMs) based on their graph representation. Regularity means that each item is compared to others for the same number of times, resulting in a kind of symmetry. A graph on an odd number of vertices is called quasi-regular, if the degree of every vertex is the same odd number, except for one vertex whose degree is larger by one. If there is a pair of items such that their shortest connecting path is very long, the comparison between these two items relies on many intermediate comparisons, and is possibly biased by all of their errors. Such an example was previously found, where the graph generated from the table tennis players' matches included a long shortest path between two vertices (players), and the calculated result appeared to be misleading. If the diameter of the graph of comparisons is low as possible (among the graphs of the same number of edges), we can avoid, or, at least decrease, such cumulated errors. The aim of our research is to find graphs, among regular and quasi-regular ones, with minimal diameter. Both theorists and practitioners can use the results, given in several formats in the appendix: graph, adjacency matrix, list of edges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。