{"paper_id":"2311.16204","title":"Planning for the Efficient Updating of Mutual Fund Portfolios","authors":["Tomás de la Rosa"],"paper_date":"2023-11-27","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2311.16204v1","page_url":"https://thequant.space/flowcharts/planning-for-the-efficient-updating-of-mutual-fund-portfolio/","scores":{"empirical_rigor":4,"math_complexity":6.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes linear programming and heuristic search approaches to generate execution plans for updating mutual fund portfolios.","quote":"In this work we present linear programming and heuristic search approaches that produce plans for executing the update. The main contributions of this work are twofold: (1) formaliz-ing the portfolio update as a combinatorial problem, and (2) proposing the use of heuristic search to find the optimal up-date plan.","summary":"Once there is a decision of rebalancing or updating a portfolio of funds, the process of changing the current portfolio to the target one, involves a set of transactions that are susceptible of being optimized. This is particularly relevant when managers have to handle the implications of different…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"All portfolio holdings are mutual funds and all update operations are transfers from one fund to another (single transaction type).","type":"model","stated":"explicit","quote":"Mutual Fund Switches In the base case, we assume all portfolio holdings are mutual funds (i.e., they belong to the same type of instruments) and all update operations are transfers from one fund to another (i.e., single type of transaction).","support":"full"},{"assumption":"Additivity of linear programming programs allows pre‑selecting the cheapest option between direct switches and sell‑plus‑buy transactions.","type":"model","stated":"explicit","quote":"Under the additivity assumption of LP programs, this pro-posal is also equivalent (assuming non-equal costs) to pre-select the cheapest option between cij and c′ ij for each i and j and compute the solution in a single set of decision variables.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Random portfolio update problems","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":"Portfolios with 4 to 13 holdings, each scaled to 10k value","quote":"To simulate diverse update tasks, we generated groups of random problems of incremental portfolio size, ranging from 4 up to 13 holdings. All portfolios were scaled to have 10k of money value.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"available","modeled":"yes","headline_net_of_costs":null,"detail":"Variable fee of 1–10 basis points for all funds; ETFs have a fixed fee selected from 0.5, 1.0, or 2.5 (simulating exchange commissions). Mutual funds have no fixed fee.","quote":"Here we wanted the simulation to also include rebalance splits (e.g., 2% overweight in fund X is allocated 1% to fund Y and 1% to fund Z.) • ETFs have a fixed fee selected from the alternatives (0.5 1.0, 2.5) with the idea of simulating different exchange commissions. Mutual funds have no fixed fee for the sub-scription or redemption of shares. • All funds have a variable fee in basic points (bps) ranging from 1 to","source":"front_matter","rule":"R3","candidates":{"front_matter":"yes","evidence_card":"yes","evidence_card_quoted":true},"card_detail":"Variable fee of 1–10 basis points for all funds; ETFs have a fixed fee selected from 0.5, 1.0, or 2.5 (simulating exchange commissions). Mutual funds have no fixed fee.","card_quote":"Here we wanted the simulation to also include rebalance splits (e.g., 2% overweight in fund X is allocated 1% to fund Y and 1% to fund Z.) • ETFs have a fixed fee selected from the alternatives (0.5 1.0, 2.5) with the idea of simulating different exchange commissions. Mutual funds have no fixed fee for the sub-scription or redemption of shares. • All funds have a variable fee in basic points (bps) ranging from 1 to","meaning":"costs are part of the reported headline results"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"Both LP+ and A*‑fee achieved the optimal solution in all 180 random problems.","kind":"performance","quote":"In 180 problems (20×9) both LP+ and Astar-fee achieved the optimal solution.","support":"full"},{"finding":"The naive approach produced plans with higher cost across all portfolio sizes.","kind":"performance","quote":"Naive approach is clearly pro-ducing plans of worse cost across the whole range of port-folios.","support":"full"},{"finding":"DFBnB matched the optimal solution in 145 tasks, exploring the full search tree in only 74 of them.","kind":"performance","quote":"The DFBnB best solution matched the optimal solution in 145 tasks, of which in only 74, the complete search tree was explored.","support":"full"},{"finding":"LP+ matched the number of transactions of A*‑fee in only 148 plans, indicating limited awareness of plan length.","kind":"performance","quote":"Regarding the plan length, LP+ only matched the num-ber of transactions with Astar-fee in 148 plans, confirming our initial conjecture that LP+ lacks awareness of the plan length.","support":"full"},{"finding":"DFBnB produced three fee‑sub‑optimal plans that had fewer transactions than the optimal cost plans.","kind":"performance","quote":"DFBnB produced 3 fee sub-optimal plans that have fewer number of transactions.","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":20,"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:08Z"},"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/"}