{"paper_id":"2208.07533","title":"Anonymized risk sharing","authors":["Zhanyi Jiao","Steven Kou","Yang Liu","Ruodu Wang"],"paper_date":"2022-08-16","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2208.07533","page_url":"https://thequant.space/flowcharts/anonymized-risk-sharing/","scores":{"empirical_rigor":2,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper develops an axiomatic theory of anonymized risk sharing and shows that the four fairness and anonymity axioms uniquely identify the CMRS rule.","quote":"We develop such a theory in the context of anonymized risk sharing.","summary":"Anonymized risk sharing requires no information about agents' preferences, identities, private operations, or realized losses. It is especially relevant in the digital economy, with applications such as P2P health-care insurance, revenue sharing for digital music and videos, and blockchain mining…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"There are n economic agents with n ≥ 3 who share a total risk.","type":"model","stated":"explicit","quote":"In our framework, n economic agents share a total risk, where n ⩾3 is an integer, and we write [n] = {1, . . . , n}.4 Each agent i ∈[n] faces an initial risk Xi, which is the risk contribution of agent i to the risk sharing pool.","support":"full"},{"assumption":"Random variables are treated as identical when they are almost surely equal and X is closed under addition with 0 ∈ X.","type":"model","stated":"explicit","quote":"3 X is closed under addition and 0 ∈X. Positive values of random variables represent losses and negative values represent gains; ﬂipping this convention makes no diﬀerence in all mathematical results. We always treat almost surely (a.s.) equal random variables as identical, and we use sup X for the essential supremum of X, that is, sup X = inf{x ∈R : P(X > x) = 0}.","support":"full"},{"assumption":"The risk contributions X belong to L1 or L1+ spaces.","type":"statistical","stated":"explicit","quote":"Assume X = L1 or L1 +.","support":"full"},{"assumption":"Subscription events across different users are independent.","type":"data","stated":"explicit","quote":"Assume that the subscription events across diﬀerent users are independent; i.e., Dij is independent of {Dkℓ: k ∈[n], ℓ∈[m] \\ {j}} for each i ∈[n] and j ∈[m].","support":"full"},{"assumption":"The allocation to each agent depends only on the sum of risks (RA axiom).","type":"model","stated":"explicit","quote":"There are at most countably many such s. Let A be a risk sharing rule satisfying the four axioms.","support":"full"},{"assumption":"Anonymity guarantees that agents are not distinguished by preferences, identity, private operations, or realized losses.","type":"other","stated":"explicit","quote":"As one of the most important features of decentralization, anonymity guarantees that agents are not distinguished by their preference, identity, private operations, and realized losses.","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":"The four axioms (AF, RF, RA, OA) uniquely identify CMRS as the only risk sharing rule satisfying them (Theorem 1).","kind":"theoretical","quote":"As the main result of the paper (Theorem 1), the four axioms uniquely identify CMRS, making CMRS a unique desirable rule to use in many applications of anonymized risk sharing.","support":"full"},{"finding":"CMRS satisfies universal improvement (UI), which implies both AF and RF.","kind":"theoretical","quote":"CMRS satisﬁes UI as a direct result of conditional Jensen’s inequality. To illustrate the important role of UI for CMRS, we note that UI implies both AF and RF, since X ⩽cx Y implies X ⩽sup X ⩽sup Y and E[X] = E[Y ] for any random variables X, Y ∈L1.","support":"full"},{"finding":"BT (a certain undesirable property) is unavoidable given the four natural axioms.","kind":"theoretical","quote":"Theorem 1 provides the additional insight that BT is unavoidable, given the four natural axioms of fairness and anonymity.","support":"full"},{"finding":"CMRS is the unique rule satisfying universal improvement, risk anonymity, and operational anonymity.","kind":"theoretical","quote":"In particular, we show that CMRS is the unique risk sharing rule satisfying universal improvement, risk anonymity, and opera-tional anonymity, complementing the characterization in Theorem 1.","support":"full"},{"finding":"Applications in cryptocurrency mining and revenue sharing illustrate the suitability of the four axioms and the unique choice of the reward sharing mechanism.","kind":"theoretical","quote":"In Section 7, we discuss some applications in cryptocurrency mining and revenue sharing, highlighting the suitability of the four axioms and their implications on the unique choice of the reward sharing mechanism.","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":3,"by_independent_authors":3,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":2,"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-14T20:05:26Z"},"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/"}