Summary of Establishing a Leader in a Pairwise Comparisons Method, by Jacek Szybowski et al.
Establishing a leader in a pairwise comparisons method
by Jacek Szybowski, Konrad Kułakowski, Jiri Mazurek, Sebastian Ernst
First submitted to arxiv on: 21 Mar 2024
Categories
- Main: Artificial Intelligence (cs.AI)
- Secondary: Cryptography and Security (cs.CR); Computers and Society (cs.CY); Discrete Mathematics (cs.DM)
GrooveSquid.com Paper Summaries
GrooveSquid.com’s goal is to make artificial intelligence research accessible by summarizing AI papers in simpler terms. Each summary below covers the same AI paper, written at different levels of difficulty. The medium difficulty and low difficulty versions are original summaries written by GrooveSquid.com, while the high difficulty version is the paper’s original abstract. Feel free to learn from the version that suits you best!
| Summary difficulty | Written by | Summary |
|---|---|---|
| High | Paper authors | High Difficulty Summary Read the original abstract here |
| Medium | GrooveSquid.com (original content) | Medium Difficulty Summary This research presents two algorithms that can be used to manipulate decision-making processes, specifically in pairwise comparison methods. The algorithms allow for equating the weights of selected alternatives, enabling manipulation and the selection of a leader. The study includes theoretical considerations and a Monte Carlo simulation demonstrating the relationship between the size of the PC matrix, inconsistency degree, and ease of manipulation. This work builds upon previous research published in (Szybowski et al., 2023). |
| Low | GrooveSquid.com (original content) | Low Difficulty Summary Decision-making methods are vulnerable to manipulation by decision-makers. Two algorithms can be used to launch a manipulation attack, equaling the weights of selected alternatives and choosing a leader. The study includes theoretical considerations and a simulation showing how matrix size, inconsistency, and ease of manipulation relate. |
