{"paper_id":"2501.14259","title":"Optimal Investment under Mutual Strategy Influence among Agents","authors":["Huisheng Wang","H. Vicky Zhao"],"paper_date":"2025-01-24","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2501.14259v1","page_url":"https://thequant.space/flowcharts/optimal-investment-under-mutual-strategy-influence-among-age/","scores":{"empirical_rigor":2.5,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper derives analytical solutions for agents' optimal investment strategies in a differential game and proposes a fast algorithm to compute approximate solutions with low computational complexity.","quote":"We derive the analytical solutions for agents' optimal strategies and propose a fast algorithm to find approximate solutions with low computational complexity. Our contributions can be summarized as follows: • We formulate an optimal investment differential game problem to model the mutual influence among agents. • We derive the analytical solutions for agents’ optimal strategies and propose a fast algorithm to find","summary":"In financial markets, agents often mutually influence each other’s investment strategies and adjust their strategies to align with others. However, there is limited quantitative study of agents’ investment strategies in such scenarios. In this work, we formulate the optimal investment differential…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Agents make rational strategies and are aware that others also make rational strategies.","type":"model","stated":"explicit","quote":"In this problem, we assume that agents make rational strategies, and they are aware that others also make rational strategies.","support":"full"},{"assumption":"Agents have recursive awareness of each other's rationality.","type":"model","stated":"explicit","quote":"Furthermore, they are aware that others are aware of their rationality when making strategies, and so on, creating a recursive awareness of rationality [11].","support":"full"},{"assumption":"Risk aversion coefficients αj are drawn from the interval [0.1, 0.5].","type":"model","stated":"explicit","quote":"Following the works in [10], [18], we assume that αj ∈[0.1, 0.5], θj ∈[10−5, 10−4], and xj ∈[1, 5] for all j ∈N. We observe the same trend for other values of the parameters.","support":"full"},{"assumption":"Influence coefficients θj are drawn from the interval [10⁻⁵, 10⁻⁴].","type":"model","stated":"explicit","quote":"Following the works in [10], [18], we assume that αj ∈[0.1, 0.5], θj ∈[10−5, 10−4], and xj ∈[1, 5] for all j ∈N. We observe the same trend for other values of the parameters.","support":"full"},{"assumption":"Initial wealth xj is drawn from the interval [1, 5] for all agents.","type":"model","stated":"explicit","quote":"Following the works in [10], [18], we assume that αj ∈[0.1, 0.5], θj ∈[10−5, 10−4], and xj ∈[1, 5] for all j ∈N. We observe the same trend for other values of the parameters.","support":"full"},{"assumption":"Adjacency matrix W is randomly generated for each scenario.","type":"model","stated":"explicit","quote":"For each scenario, we randomly generate the adjacency matrix W , and set the risk aversion coefficients {αj}j∈N , influence coefficients {θj}j∈N , and initial wealth {xj}j∈N .","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Daily closing prices of 5 stocks","provider":null,"kind":"market-prices","access":"unknown","period":"2019-2023","universe":"5 stocks","quote":"We collect daily closing prices of m = 5 stocks from 2019 to 2023 to determine the excess return rates ν and covariance matrix Σ for the risky assets.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"daily"},"transaction_costs":{"status":"available","modeled":"unclear","headline_net_of_costs":null,"detail":null,"quote":null,"source":"conflict","rule":"R4b","candidates":{"front_matter":"no","evidence_card":"n/a","evidence_card_quoted":false},"conflict_kind":"applicability","meaning":"the platform classifier and the paper-text extraction disagree, so no value is asserted"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"The fast algorithm reduces computation time by 98% compared to the base exact method while achieving a relative error below 10⁻³¹.","kind":"performance","quote":"The experimental results are in Table I. From Table I, the Relative Error is less than 10−31, and Fast reduces the computation times by 98% compared to Base, which validate the accuracy and efficiency of our proposed fast algorithm.","support":"full"},{"finding":"When influence coefficients approach infinity, all agents' optimal strategies converge to the asymptotic strategy.","kind":"theoretical","quote":"Theorem 3: As the influence coefficients {θj}j∈N ap-proach infinity, all n agents’ optimal strategies converge to ˜P (t) = ˜α−1er(t−T )Σ−1ν, (18) where ˜α is the asymptotic risk aversion coefficient with ˜α := P j∈N ηjαj P j∈N ηj .","support":"full"},{"finding":"Risk‑taking agents become more risk‑averse under mutual influence, and risk‑averse agents seek higher returns and risk.","kind":"theoretical","quote":"It validates Theorem 3 that under mutual influence, risk-taking agents become more risk-averse, and vice versa.","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":26,"citations":{"cited_by_in_corpus":1,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":1},"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-14T19:52:59Z"},"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/"}