arXiv (All)
open access
A Polynomial-Time Test for Peak-Oriented Rationalizability
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
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
- Fair Stable Matching: A Nash Social Welfare Approach#632893
- When Maximum Nash Welfare Becomes Strongly Fair: Bi-valued Goods#1154745
- Does rationality demand higher-order certainty?#768535
- Reductiones ad Absurdum of the “P versus NP Problem” and P = NP/AP/CH#693435
- Levelable graphs#662357
Record · ID 1078113
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