{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IILNK4K4SILLMYPHO22NLVHWRR","short_pith_number":"pith:IILNK4K4","schema_version":"1.0","canonical_sha256":"4216d5715c9216b661e776b4d5d4f68c73c2a3b6503a8ffff6d910a4fb15629c","source":{"kind":"arxiv","id":"1109.3569","version":1},"attestation_state":"computed","paper":{"title":"Numerical approximation of Nash equilibria for a class of non-cooperative differential games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.AP","math.OC"],"primary_cat":"math.NA","authors_text":"Emiliano Cristiani, Maurizio Falcone, Simone Cacace","submitted_at":"2011-09-16T10:02:02Z","abstract_excerpt":"In this paper we propose a numerical method to obtain an approximation of Nash equilibria for multi-player non-cooperative games with a special structure. We consider the infinite horizon problem in a case which leads to a system of Hamilton-Jacobi equations. The numerical method is based on the Dynamic Programming Principle for every equation and on a global fixed point iteration. We present the numerical solutions of some two-player games in one and two dimensions. The paper has an experimental nature, but some features and properties of the approximation scheme are discussed."},"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":"1109.3569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2011-09-16T10:02:02Z","cross_cats_sorted":["cs.SY","math.AP","math.OC"],"title_canon_sha256":"a9a8348aef2c314832cf75e800bd74229906bc2001f14fd4d09e4b10219f4be1","abstract_canon_sha256":"f9f52de80d4ced13d4b2ed74eb8d5b732a0d1f1bb601f4abfeffc2499a608bcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:26.721499Z","signature_b64":"cy3e+cKnmu5vIb7VngFADgTLhAaFn0NbTjXEg9M/6v/+xSfShDHChKFdHeSUP8TT9s+BGLb0aCW0INOilGBDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4216d5715c9216b661e776b4d5d4f68c73c2a3b6503a8ffff6d910a4fb15629c","last_reissued_at":"2026-05-18T01:20:26.720826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:26.720826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical approximation of Nash equilibria for a class of non-cooperative differential games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.AP","math.OC"],"primary_cat":"math.NA","authors_text":"Emiliano Cristiani, Maurizio Falcone, Simone Cacace","submitted_at":"2011-09-16T10:02:02Z","abstract_excerpt":"In this paper we propose a numerical method to obtain an approximation of Nash equilibria for multi-player non-cooperative games with a special structure. We consider the infinite horizon problem in a case which leads to a system of Hamilton-Jacobi equations. The numerical method is based on the Dynamic Programming Principle for every equation and on a global fixed point iteration. We present the numerical solutions of some two-player games in one and two dimensions. The paper has an experimental nature, but some features and properties of the approximation scheme are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3569","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1109.3569","created_at":"2026-05-18T01:20:26.720911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3569v1","created_at":"2026-05-18T01:20:26.720911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3569","created_at":"2026-05-18T01:20:26.720911+00:00"},{"alias_kind":"pith_short_12","alias_value":"IILNK4K4SILL","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"IILNK4K4SILLMYPH","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"IILNK4K4","created_at":"2026-05-18T12:26:30.835961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR","json":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR.json","graph_json":"https://pith.science/api/pith-number/IILNK4K4SILLMYPHO22NLVHWRR/graph.json","events_json":"https://pith.science/api/pith-number/IILNK4K4SILLMYPHO22NLVHWRR/events.json","paper":"https://pith.science/paper/IILNK4K4"},"agent_actions":{"view_html":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR","download_json":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR.json","view_paper":"https://pith.science/paper/IILNK4K4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3569&json=true","fetch_graph":"https://pith.science/api/pith-number/IILNK4K4SILLMYPHO22NLVHWRR/graph.json","fetch_events":"https://pith.science/api/pith-number/IILNK4K4SILLMYPHO22NLVHWRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR/action/storage_attestation","attest_author":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR/action/author_attestation","sign_citation":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR/action/citation_signature","submit_replication":"https://pith.science/pith/IILNK4K4SILLMYPHO22NLVHWRR/action/replication_record"}},"created_at":"2026-05-18T01:20:26.720911+00:00","updated_at":"2026-05-18T01:20:26.720911+00:00"}