用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
直接命令不会经过审查 Prompt;运行前请先检查来源。
npx skills add https://github.com/benjam3n/reasoningtool --skill pwc-pairwise-comparison-matrix命令会保持在同一行。复制前请横向滚动并检查完整内容。
想先保存到本地?可下载 SkillsMP 当前能够提供的文件。
基于 SOC 职业分类
正在显示 SKILL.md
| name | pwc - Pairwise Comparison Matrix |
| description | Instead of rating each option absolutely (hard), compare pairs |
| output | {"format":"prose"} |
Instead of rating each option absolutely (hard), compare pairs directly (easier). "Is A better than B?" is easier than "How good is A?" Aggregate comparisons to produce ranking.
Rank options by comparing all pairs and counting wins. Each individual comparison is simple; aggregation is mechanical. Avoids the difficulty of absolute rating.
Enumerate all options to be compared. Label them for easy reference (A, B, C... or 1, 2, 3...).
Output: Labeled option list
Clearly state what you're comparing on. Can be single criterion or composite.
Single: "Which is more important?" Composite: "Considering cost, quality, and time, which is better?"
Output: Criterion statement
Create N×N matrix with options on both axes. Diagonal is empty (don't compare to self). Only need to fill upper triangle (lower is symmetric).
Output: Empty matrix
For each pair (i, j) where i < j: Ask: "Is [Option i] better than [Option j] on [criterion]?"
Record:
Be consistent. If A > B and B > C, then A > C (transitivity).
Output: Filled comparison matrix
Look for intransitive cycles: A > B > C > A If found, reconsider those comparisons. Some intransitivity may be acceptable (different criteria).
Output: Consistency check result
For each option, sum its wins. Win = 1 point, Tie = 0.5 points, Loss = 0 points Total possible points = N - 1
Output: Score for each option
Sort options by score (descending). Handle ties by re-comparing or accepting tie.
Output: Final ranking