{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EGK4RYFBQVOGFA4DM2YPWNAXDO","short_pith_number":"pith:EGK4RYFB","schema_version":"1.0","canonical_sha256":"2195c8e0a1855c62838366b0fb34171ba66c406080c5046841a8054f1662bb25","source":{"kind":"arxiv","id":"1202.3749","version":1},"attestation_state":"computed","paper":{"title":"Compact Mathematical Programs For DEC-MDPs With Structured Agent Interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hala Mostafa, Victor Lesser","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"To deal with the prohibitive complexity of calculating policies in Decentralized MDPs, researchers have proposed models that exploit structured agent interactions. Settings where most agent actions are independent except for few actions that affect the transitions and/or rewards of other agents can be modeled using Event-Driven Interactions with Complex Rewards (EDI-CR). Finding the optimal joint policy can be formulated as an optimization problem. However, existing formulations are too verbose and/or lack optimality guarantees. We propose a compact Mixed Integer Linear Program formulation of "},"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":"1202.3749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"5675444f6748a1d18f18c27952f69a9935d0d5804a64fec27b01cdab7389abfb","abstract_canon_sha256":"27e54a499a8a4f7b5a33b0f64ae07558337cd8604cf5431d36532a7092cd6db4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.098087Z","signature_b64":"xiJ9cQ74BGeo/+f8JQWc65k09bhZWD73R6Jpm/jGBTYxeEs+8aAgXw4HnMiLjQkZ15PLCxpzRALw8lm0upZGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2195c8e0a1855c62838366b0fb34171ba66c406080c5046841a8054f1662bb25","last_reissued_at":"2026-05-18T04:02:03.097555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.097555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compact Mathematical Programs For DEC-MDPs With Structured Agent Interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hala Mostafa, Victor Lesser","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"To deal with the prohibitive complexity of calculating policies in Decentralized MDPs, researchers have proposed models that exploit structured agent interactions. Settings where most agent actions are independent except for few actions that affect the transitions and/or rewards of other agents can be modeled using Event-Driven Interactions with Complex Rewards (EDI-CR). Finding the optimal joint policy can be formulated as an optimization problem. However, existing formulations are too verbose and/or lack optimality guarantees. We propose a compact Mixed Integer Linear Program formulation of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3749","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":"1202.3749","created_at":"2026-05-18T04:02:03.097629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3749v1","created_at":"2026-05-18T04:02:03.097629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3749","created_at":"2026-05-18T04:02:03.097629+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGK4RYFBQVOG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGK4RYFBQVOGFA4D","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGK4RYFB","created_at":"2026-05-18T12:27:04.183437+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/EGK4RYFBQVOGFA4DM2YPWNAXDO","json":"https://pith.science/pith/EGK4RYFBQVOGFA4DM2YPWNAXDO.json","graph_json":"https://pith.science/api/pith-number/EGK4RYFBQVOGFA4DM2YPWNAXDO/graph.json","events_json":"https://pith.science/api/pith-number/EGK4RYFBQVOGFA4DM2YPWNAXDO/events.json","paper":"https://pith.science/paper/EGK4RYFB"},"agent_actions":{"view_html":"https://pith.science/pith/EGK4RYFBQVOGFA4DM2YPWNAXDO","download_json":"https://pith.science/pith/EGK4RYFBQVOGFA4DM2YPWNAXDO.json","view_paper":"https://pith.science/paper/EGK4RYFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3749&json=true","fetch_graph":"https://pith.science/api/pith-number/EGK4RYFBQVOGFA4DM2YPWNAXDO/graph.json","fetch_events":"https://pith.science/api/pith-number/EGK4RYFBQVOGFA4DM2YPWNAXDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGK4RYFBQVOGFA4DM2YPWNAXDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGK4RYFBQVOGFA4DM2YPWNAXDO/action/storage_attestation","attest_author":"https://pith.science/pith/EGK4RYFBQVOGFA4DM2YPWNAXDO/action/author_attestation","sign_citation":"https://pith.science/pith/EGK4RYFBQVOGFA4DM2YPWNAXDO/action/citation_signature","submit_replication":"https://pith.science/pith/EGK4RYFBQVOGFA4DM2YPWNAXDO/action/replication_record"}},"created_at":"2026-05-18T04:02:03.097629+00:00","updated_at":"2026-05-18T04:02:03.097629+00:00"}