Skip to content
DraconiticResearch
Search Sources API
194,220 studies31 sourcesUpdated 54 min ago
PreprintarXiv licencearXiv

A Polynomial-Time Test for Peak-Oriented Rationalizability

  • Taotao He
  • Runfa Hu
Open at sourcePDFDOICite

Abstract

We study the computational complexity of peak-oriented rationalizability, a survey based revealed-preference test introduced by Seror (2026). We provide a polynomial-time algorithm for testing rationalizability and recovering a utility function, establishing that peak-oriented preference elicitation is computationally tractable. In contrast, we show that computing the peak-oriented Houtman-Maks index is NP-hard. These results delineate the precise computational boundaries of peak-oriented revealed-preference analysis.

Related

  1. Polynomial-time isomorphism test for solvable groups with abelian Sylow subgroups
    Saveliy V. Skresanov
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. On the Peak Estimation of Scalar Polynomial Systems via Integrability
    Karolína Sehnalová
    arXivPreprintCC BY 4.0Full textDynamical systemsOptimisation & controlarXiv
  3. Prediction of oxygen uptake at peak exercise in patients with inflammatory bowel disease using submaximal cardiopulmonary exercise testing and the steep ramp test as a practical field test
    Karlijn Demers, Sander M. J. van Kuijk, Marieke J. Pierik +3
    PLOS OnePeer-reviewedCC BY 4.0Full textStatisticsEpidemiology & public healthPLOS
  4. An Index-Graded Virtual Intersection Polynomial for Oriented Virtual Knots
    Liang Liang, Bin Jiang, Fangyu Jin +1
    MathematicsPeer-reviewedCC BY 4.0Geometry & topologyCrossref
  5. Polynomial Compressibility and Forbidden Oriented Forests
    Zhenhua Lyu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{he2026polynomialtime,
  title = {{A Polynomial-Time Test for Peak-Oriented Rationalizability}},
  author = {Taotao He and Runfa Hu},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.30042},
  eprint = {2609.30042},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.30042},
}
RIS
TY  - UNPB
TI  - A Polynomial-Time Test for Peak-Oriented Rationalizability
AU  - Taotao He
AU  - Runfa Hu
PY  - 2026
DA  - 2026/09/24
PB  - arXiv
DO  - 10.48550/arxiv.2609.30042
UR  - https://arxiv.org/abs/2609.30042
AB  - We study the computational complexity of peak-oriented rationalizability, a survey based revealed-preference test introduced by Seror (2026). We provide a polynomial-time algorithm for testing rationalizability and recovering a utility function, establishing that peak-oriented preference elicitation is computationally tractable. In contrast, we show that computing the peak-oriented Houtman-Maks index is NP-hard. These results delineate the precise computational boundaries of peak-oriented revealed-preference analysis.
ER  -