{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GVDYMDNCKLKAVXJX4GIEEJGZCE","short_pith_number":"pith:GVDYMDNC","schema_version":"1.0","canonical_sha256":"3547860da252d40add37e1904224d9113b68e59b7629d6438edde462be58aaf9","source":{"kind":"arxiv","id":"2404.11967","version":4},"attestation_state":"computed","paper":{"title":"Multi-Agent Relative Investment Games in a Jump Diffusion Market with Deep Reinforcement Learning Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liwei Lu, Ruimeng Hu, Xu Yang, Yi Zhu","submitted_at":"2024-04-18T07:53:27Z","abstract_excerpt":"This paper focuses on multi-agent stochastic differential games for jump-diffusion systems. On one hand, we study the multi-agent game for optimal investment in a jump-diffusion market. We derive constant Nash equilibria and provide sufficient conditions for their existence and uniqueness for exponential, power, and logarithmic utilities, respectively. On the other hand, we introduce a computational framework based on the actor-critic method in deep reinforcement learning to solve the stochastic control problem with jumps. We extend this algorithm to address the multi-agent game with jumps and"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2404.11967","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-04-18T07:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"3fbf8e4bb0ca46f8390b0f89d643086ade9b91c55d8bf6d68ae48fd87d8f1968","abstract_canon_sha256":"e965daccb86e600e3a9036ae4fe23af06dc3e5a929d9a95ac83888a7482b1b33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:45:07.404045Z","signature_b64":"tCm5Gm5JgE3P0akThheSB45N05pU5Tk6quNZJo7nemADXaTWX/pd3oa0x3oouj8u7J+mcvpfhrYW/s5uXo3uAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3547860da252d40add37e1904224d9113b68e59b7629d6438edde462be58aaf9","last_reissued_at":"2026-07-05T10:45:07.403535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:45:07.403535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Relative Investment Games in a Jump Diffusion Market with Deep Reinforcement Learning Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Liwei Lu, Ruimeng Hu, Xu Yang, Yi Zhu","submitted_at":"2024-04-18T07:53:27Z","abstract_excerpt":"This paper focuses on multi-agent stochastic differential games for jump-diffusion systems. On one hand, we study the multi-agent game for optimal investment in a jump-diffusion market. We derive constant Nash equilibria and provide sufficient conditions for their existence and uniqueness for exponential, power, and logarithmic utilities, respectively. On the other hand, we introduce a computational framework based on the actor-critic method in deep reinforcement learning to solve the stochastic control problem with jumps. We extend this algorithm to address the multi-agent game with jumps and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.11967","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.11967/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.11967","created_at":"2026-07-05T10:45:07.403594+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.11967v4","created_at":"2026-07-05T10:45:07.403594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.11967","created_at":"2026-07-05T10:45:07.403594+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVDYMDNCKLKA","created_at":"2026-07-05T10:45:07.403594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVDYMDNCKLKAVXJX","created_at":"2026-07-05T10:45:07.403594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVDYMDNC","created_at":"2026-07-05T10:45:07.403594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.12591","citing_title":"Optimal Rebate Design: Incentives, Competition and Efficiency in Auction Markets","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE","json":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE.json","graph_json":"https://pith.science/api/pith-number/GVDYMDNCKLKAVXJX4GIEEJGZCE/graph.json","events_json":"https://pith.science/api/pith-number/GVDYMDNCKLKAVXJX4GIEEJGZCE/events.json","paper":"https://pith.science/paper/GVDYMDNC"},"agent_actions":{"view_html":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE","download_json":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE.json","view_paper":"https://pith.science/paper/GVDYMDNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.11967&json=true","fetch_graph":"https://pith.science/api/pith-number/GVDYMDNCKLKAVXJX4GIEEJGZCE/graph.json","fetch_events":"https://pith.science/api/pith-number/GVDYMDNCKLKAVXJX4GIEEJGZCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE/action/storage_attestation","attest_author":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE/action/author_attestation","sign_citation":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE/action/citation_signature","submit_replication":"https://pith.science/pith/GVDYMDNCKLKAVXJX4GIEEJGZCE/action/replication_record"}},"created_at":"2026-07-05T10:45:07.403594+00:00","updated_at":"2026-07-05T10:45:07.403594+00:00"}