{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CHYBJT3DAT7ZX736BUUGBRU26J","short_pith_number":"pith:CHYBJT3D","schema_version":"1.0","canonical_sha256":"11f014cf6304ff9bff7e0d2860c69af27f8cfefce8bac5a0f7d41bac9e10fb8f","source":{"kind":"arxiv","id":"1510.07111","version":3},"attestation_state":"computed","paper":{"title":"Dynamic programming approach to principal-agent problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-fin.EC"],"primary_cat":"math.OC","authors_text":"Dylan Possama\\\"i, Jak\\v{s}a Cvitani\\'c, Nizar Touzi","submitted_at":"2015-10-24T06:02:35Z","abstract_excerpt":"We consider a general formulation of the Principal-Agent problem with a lump-sum payment on a finite horizon, providing a systematic method for solving such problems. Our approach is the following: we first find the contract that is optimal among those for which the agent's value process allows a dynamic programming representation, for which the agent's optimal effort is straightforward to find. We then show that the optimization over the restricted family of contracts represents no loss of generality. As a consequence, we have reduced this non-zero sum stochastic differential game to a stocha"},"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":"1510.07111","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-10-24T06:02:35Z","cross_cats_sorted":["math.PR","q-fin.EC"],"title_canon_sha256":"885427ec8768a78126568c3b8f691314e5003b9eb6734d18070287b43071a2d0","abstract_canon_sha256":"e5d262f5218d38b45c368246fdd9fc8cf41ab61a5c0f1be763450aee51759e2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:12.510589Z","signature_b64":"ypEDmQv0P33cGkePfccHPJeaVmkXWw9c8/eJjb+WKE+hqRUcoQVUdMrxAg6XLJXln1zmGVmtzmBqpB5luD/gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11f014cf6304ff9bff7e0d2860c69af27f8cfefce8bac5a0f7d41bac9e10fb8f","last_reissued_at":"2026-05-18T00:53:12.510142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:12.510142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic programming approach to principal-agent problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","q-fin.EC"],"primary_cat":"math.OC","authors_text":"Dylan Possama\\\"i, Jak\\v{s}a Cvitani\\'c, Nizar Touzi","submitted_at":"2015-10-24T06:02:35Z","abstract_excerpt":"We consider a general formulation of the Principal-Agent problem with a lump-sum payment on a finite horizon, providing a systematic method for solving such problems. Our approach is the following: we first find the contract that is optimal among those for which the agent's value process allows a dynamic programming representation, for which the agent's optimal effort is straightforward to find. We then show that the optimization over the restricted family of contracts represents no loss of generality. As a consequence, we have reduced this non-zero sum stochastic differential game to a stocha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07111","kind":"arxiv","version":3},"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":"1510.07111","created_at":"2026-05-18T00:53:12.510222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07111v3","created_at":"2026-05-18T00:53:12.510222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07111","created_at":"2026-05-18T00:53:12.510222+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHYBJT3DAT7Z","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHYBJT3DAT7ZX736","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHYBJT3D","created_at":"2026-05-18T12:29:14.074870+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/CHYBJT3DAT7ZX736BUUGBRU26J","json":"https://pith.science/pith/CHYBJT3DAT7ZX736BUUGBRU26J.json","graph_json":"https://pith.science/api/pith-number/CHYBJT3DAT7ZX736BUUGBRU26J/graph.json","events_json":"https://pith.science/api/pith-number/CHYBJT3DAT7ZX736BUUGBRU26J/events.json","paper":"https://pith.science/paper/CHYBJT3D"},"agent_actions":{"view_html":"https://pith.science/pith/CHYBJT3DAT7ZX736BUUGBRU26J","download_json":"https://pith.science/pith/CHYBJT3DAT7ZX736BUUGBRU26J.json","view_paper":"https://pith.science/paper/CHYBJT3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07111&json=true","fetch_graph":"https://pith.science/api/pith-number/CHYBJT3DAT7ZX736BUUGBRU26J/graph.json","fetch_events":"https://pith.science/api/pith-number/CHYBJT3DAT7ZX736BUUGBRU26J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHYBJT3DAT7ZX736BUUGBRU26J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHYBJT3DAT7ZX736BUUGBRU26J/action/storage_attestation","attest_author":"https://pith.science/pith/CHYBJT3DAT7ZX736BUUGBRU26J/action/author_attestation","sign_citation":"https://pith.science/pith/CHYBJT3DAT7ZX736BUUGBRU26J/action/citation_signature","submit_replication":"https://pith.science/pith/CHYBJT3DAT7ZX736BUUGBRU26J/action/replication_record"}},"created_at":"2026-05-18T00:53:12.510222+00:00","updated_at":"2026-05-18T00:53:12.510222+00:00"}