arXiv (All)
open access
Perturbation Sensitivity of Maximum-Likelihood Pairwise Ranking in Computational Decision Systems
Maximum-likelihood pairwise ranking is a com- mon computational mechanism for prioritization, reputation estimation, and comparison-driven decision support. Despite its broad use, the perturbation sensitivity of this estimator under structured changes in comparison data remains insufficiently charac
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Perturbation Sensitivity of Maximum-Likelihood Pairwise Ranking in Computational Decision Systems#797442
- Unweighted ranking for value-based decision making with uncertainty#180703
- The problem of constrained judgment aggregation#748785
- InterPol: De-anonymizing LM Arena via Interpolated Preference Learning#1063859
- Judgment aggregation: (Im)possibility theorems#720302
Record · ID 798856
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive