Detection of decision-making manipulation in the pairwise comparisons method
AGH University of Krakow(克拉科夫AGH大学)
Michał Strada, Sebastian Ernst, Jacek Szybowski, Konrad Kułakowski
备注:
19 pages, 5 figures, 2 tables
发表信息:
Strada, M.; Ernst, S.; Szybowski, J.; Kułakowski, K. Detection of Decision-Making Manipulation in the Pairwise Comparison Method. Appl. Sci. 2024, 14, 8946
Most decision-making models, including the pairwise comparison method, assume the decision-makers honesty. However, it is easy to imagine a situation where a decision-maker tries to manipulate the ranking results. This paper presents three simple manipulation methods in the pairwise comparison method. We then try to detect these methods using appropriately constructed neural networks. Experimental results accompany the proposed solutions on the generated data, showing a considerable manipulation detection level.
Reinforcement Learning with Pairwise Preferences in Long-Term Decision Problems
School of Computer Science, McGill University, Montreal, Quebec, Canada(麦吉尔大学计算机科学学院);Mila - Quebec AI Institute, Montreal, Quebec, Canada(魁北克人工智能研究所);Department of Electrical Engineering, Stanford University, Stanford, California, USA(斯坦福大学电气工程系)
Sequential Manipulation Against Rank Aggregation: Theory and Algorithm
School of Electronic, Electrical and Communication Engineering, University of Chinese Academy of Sciences(中国科学院大学电子电气与通信工程学院);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);School of Computer and Information Engineering, Jiangxi Normal University(江西师范大学计算机与信息工程学院);Tencent Data Platform(腾讯数据平台);School of Cyber Science and Technology, Shenzhen Campus of Sun Yat-sen University(中山大学深圳校区网络空间安全学院);School of Computer Science and Technology, University of Chinese Academy of Sciences(中国科学院大学计算机科学与技术学院)
Characterization of an inconsistency ranking for pairwise comparison matrices
Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)(匈牙利科学院计算机科学与控制研究所(MTA SZTAKI));Corvinus University of Budapest (BCE)(布达佩斯考文纽斯大学(BCE))
A DEMATEL-Based Completion Method for Incomplete Pairwise Comparison Matrix in AHP
Southwest University(西南大学);Jinan University(暨南大学);Vanderbilt University(范德堡大学);The Hong Kong Polytechnic University(香港理工大学);University of Portsmouth(朴茨茅斯大学)
Human Decision-making is Susceptible to AI-driven Manipulation
The CoAI Group, DCST, Institute for Artificial Intelligence, Tsinghua University, Beijing, China(CoAI小组、DCST、人工智能研究所、清华大学、北京中国);State Key Laboratory of Brain and Cognitive Sciences, The University of Hong Kong, Hong Kong SAR, China(脑与认知科学国家重点实验室、香港大学、香港特别行政区中国);The LIT Group, Department of Computer Science and Engineering, University of Michigan, Ann Arbor(LIT小组、计算机科学与工程系、密歇根大学、安阿伯);Paul G. Allen School of Computer Science and Engineering, University of Washington, Seattle, WA, USA(保罗·G·阿伦计算机科学与工程学院、华盛顿大学、西雅图华盛顿州美国);ANT Group(ANT集团)
The Tournament Tree Method for preference elicitation in Multi-criteria decision-making
Department of Mathematics, Universidad de Ja \'e n, 23071 Ja \'e n, Spain;Department of Computer Science, Universidad de Ja \'e n, 23071 Ja \'e n, Spain
Inconsistency thresholds for incomplete pairwise comparison matrices
Corvinus University of Budapest (BCE)(布达佩斯考文纽斯大学);Institute for Computer Science and Control (SZTAKI)(计算机科学与控制研究所);Eötvös Loránd Research Network (ELKH)(厄特沃什·罗兰研究网络)
Ordered Preference Elicitation Strategies for Supporting Multi-Objective Decision Making
Vrije Universiteit Brussel(布鲁塞尔自由大学);University of Oxford(牛津大学);Vrije Universiteit Amsterdam(阿姆斯特丹自由大学);City of Amsterdam, Signal Control Design and Analysis(阿姆斯特丹市信号控制设计与分析部门);Delft University of Technology(代尔夫特理工大学)
An application of incomplete pairwise comparison matrices for ranking top tennis players
Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)(匈牙利科学院计算机科学与控制研究所(MTA SZTAKI));Corvinus University of Budapest(布达佩斯考文纽斯大学)