{"paper_id":"2311.01692","title":"Benchmark Beating with the Increasing Convex Order","authors":["Jianming Xia"],"paper_date":"2023-11-03","paper_type":"dataset-benchmark","paper_url":"https://arxiv.org/pdf/2311.01692v1","page_url":"https://thequant.space/flowcharts/benchmark-beating-with-the-increasing-convex-order/","scores":{"empirical_rigor":2,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a model of benchmark beating using the increasing convex order (ICX) and derives closed‑form optimal and efficient portfolios for complete markets.","quote":"In this paper we model benchmark beating with the increasing convex order (ICX order). We then investigate the problem of minimizing the variance of a portfolio with ICX order constraints, based on which we also study the problem of beating-performance-variance efficient portfolios.","summary":"In this paper we model benchmark beating with the increasing convex order (ICX order). The mean constraint in the mean-variance theory of portfolio selection can be regarded as beating a constant. We then investigate the problem of minimizing the variance of a portfolio with ICX order constraints…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The market is complete, allowing closed‑form solutions for optimal portfolios.","type":"market","stated":"explicit","quote":"The optimal and efficient portfolios are all worked out in closed form for complete markets.","support":"full"},{"assumption":"The benchmark payoff X₀ belongs to L^∞ (bounded).","type":"model","stated":"explicit","quote":"4 Duality The following theorem implies that Qicx(x, Q0)̸ = ∅for any x ∈R. Theorem 4.1. Assume that X0 ∈L∞. Then by Xu (2014, Theorem 5), ξ ∈Ξ if and only if (ξ, ρ) is comonotonic. 7 Proposition 4.2. Assume that X0 ∈L∞.","support":"full"},{"assumption":"The pricing kernel ρ is integrable and E[ρ] is finite.","type":"model","stated":"implied","quote":"The problem of the investor is thus minimize X∈L2 Var[X] subject to E[ρX] ≤x, X ⪰icx X0. (2.2) Remark 2.1. Then for X0 = z a.s., problem (2.2) reduces to minimize X∈L2 Var[X] subject to E[ρX] ≤x, E[X] ≥z, which arises from the classical problem of mean-variance portfolio selection.","support":"full"},{"assumption":"The budget level x satisfies Q₀(1)·E[ρ] > x (non‑trivial case).","type":"model","stated":"explicit","quote":"X0 ∈L∞and Q0(1)E[ρ] > x. If Q0(1)E[ρ] > x, then λ◦> 0.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"Optimal and efficient portfolios under ICX constraints are obtained in closed form for complete markets.","kind":"theoretical","quote":"The optimal and efficient portfolios are all worked out in closed form for complete markets.","support":"full"},{"finding":"Beating‑performance‑variance (BPV) efficient portfolios are derived in closed form.","kind":"theoretical","quote":"We then also investigate the problem of BPV efficient portfolio and the BPV efficient portfolios are worked out in closed form.","support":"full"},{"finding":"Under Assumption 4.3 (Q₀(1)E[ρ] > x), a unique variance‑minimal quantile function exists and the variance‑minimal value v°(x) is strictly positive.","kind":"theoretical","quote":"Under Assumption 4.3, v◦(x) > 0 and there exists a unique variance-minimal quantile function in Qicx(x, Q0). Proof.","support":"full"},{"finding":"When the benchmark is a constant (X₀ = z), the ICX constraint reduces to the classical mean‑variance problem of minimizing variance while beating a constant.","kind":"theoretical","quote":"Obviously, for every z ∈R, X ⪰icx z if and only if E[X] ≥z. There-fore, the classical mean-variance portfolio selection is to minimize variance while beating a constant z.","support":"full"},{"finding":"If X₀ = 0, BPV efficiency coincides with mean‑variance efficiency.","kind":"theoretical","quote":"In the special case X0 = 0, Ψ(X) = E[X] and hence BPV efficiency reduces to mean-variance efficiency. In this case, the BPV efficiency reduces to the mean-variance efficiency. Proposition 8.3. Assume X0 ∈L∞.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":18,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T20:00:29Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}