Admissible Portfolio Optimization: Information Eligibility Before Portfolio Choice

Portfolio optimization normally treats the conditioning information as fixed and optimizes only the allocation. This paper studies the prior problem of which information representations are eligible to define the portfolio problem. A decision contract induces an eligible information domain, an admissibility order selects within that domain without using portfolio performance, and conditional portfolio optimization is performed only afterwards. The first main result shows that decision value and information eligibility are distinct: a finer representation can improve optimal decision value while violating the contract, so performance alone cannot certify eligibility. The second shows that joint optimization over information and portfolios can generate a pointwise efficient envelope that is not the frontier of any single information representation; representation consistency holds exactly when one representation minimizes the envelope throughout the target range. Conditional Markowitz choice is recovered when the eligible information domain collapses to one equivalence class, and classical Markowitz when that representation is trivial. Controlled experiments exhibit strict performance preference for ineligible look-ahead information. In a frozen market experiment with 127 candidate drivers, the performance-selected representation fails the independently predeclared statistical eligibility gate in all 81 rolling windows. The gate is deliberately stringent: APO finds an eligible representation in only 6 windows, and no tolerance is changed after observing the results. APO does not imply that eligible representations maximize portfolio performance; it separates the legitimacy of the information domain from optimization within it.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-15
DOI
https://doi.org/10.5281/zenodo.22777923
Primary Topic
Advanced Bandit Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Admissible Portfolio Optimization: Information Eligibility Before Portfolio Choice

Alejandro Rodríguez Domínguez
Zenodo (CERN European Organization for Nuclear Research)
Advanced Bandit Algorithms Research
preprint

Admissible Portfolio Optimization: Information Eligibility Before Portfolio Choice

Alejandro Rodríguez Domínguez
preprint en

Abstract

Portfolio optimization normally treats the conditioning information as fixed and optimizes only the allocation. This paper studies the prior problem of which information representations are eligible to define the portfolio problem. A decision contract induces an eligible information domain, an admissibility order selects within that domain without using portfolio performance, and conditional portfolio optimization is performed only afterwards. The first main result shows that decision value and information eligibility are distinct: a finer representation can improve optimal decision value while violating the contract, so performance alone cannot certify eligibility. The second shows that joint optimization over information and portfolios can generate a pointwise efficient envelope that is not the frontier of any single information representation; representation consistency holds exactly when one representation minimizes the envelope throughout the target range. Conditional Markowitz choice is recovered when the eligible information domain collapses to one equivalence class, and classical Markowitz when that representation is trivial. Controlled experiments exhibit strict performance preference for ineligible look-ahead information. In a frozen market experiment with 127 candidate drivers, the performance-selected representation fails the independently predeclared statistical eligibility gate in all 81 rolling windows. The gate is deliberately stringent: APO finds an eligible representation in only 6 windows, and no tolerance is changed after observing the results. APO does not imply that eligible representations maximize portfolio performance; it separates the legitimacy of the information domain from optimization within it.

Zenodo (CERN European Organization for Nuclear Research)
University Bank (US)
Peace, Justice and strong institutions
Advanced Bandit Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Admissible Portfolio Optimization: Information Eligibility Before Portfolio Choice — Alejandro Rodríguez Domínguez · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS