{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:33GGJQ56DGZI4JZTH6WXDFHGD7","short_pith_number":"pith:33GGJQ56","schema_version":"1.0","canonical_sha256":"decc64c3be19b28e27333fad7194e61febf583e9c8398dd0a7d468792cd98d6b","source":{"kind":"arxiv","id":"2305.12553","version":7},"attestation_state":"computed","paper":{"title":"Markov $\\alpha$-Potential Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","cs.SY","eess.SY","math.DS"],"primary_cat":"cs.GT","authors_text":"Chinmay Maheshwari, Manxi Wu, Shankar Sastry, Xin Guo, Xinyu Li","submitted_at":"2023-05-21T19:27:31Z","abstract_excerpt":"We propose a new framework of Markov $\\alpha$-potential games to study Markov games. We show that any Markov game with finite-state and finite-action is a Markov $\\alpha$-potential game, and establish the existence of an associated $\\alpha$-potential function. Any optimizer of an $\\alpha$-potential function is shown to be an $\\alpha$-stationary Nash equilibrium. We study two important classes of practically significant Markov games, Markov congestion games and the perturbed Markov team games, via the framework of Markov $\\alpha$-potential games, with explicit characterization of an upper bound"},"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":"2305.12553","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-05-21T19:27:31Z","cross_cats_sorted":["cs.AI","cs.MA","cs.SY","eess.SY","math.DS"],"title_canon_sha256":"c765b3f21ee54a57298da559ea80221908ae8544756d7ac6eeedb99e4e0379f8","abstract_canon_sha256":"a7f9f0b883bc00561216097cad43326563a012318560f2e969a9ee255afd3327"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:42:10.485042Z","signature_b64":"4D19eRsqHHbnpDghevc7JCEuu6wnfVcCbg17RbH0zOdJJGb2ikYuCkB/qmA+Wm1dgo7nPmSnzCC8DNWwFQLFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"decc64c3be19b28e27333fad7194e61febf583e9c8398dd0a7d468792cd98d6b","last_reissued_at":"2026-07-05T10:42:10.484647Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:42:10.484647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov $\\alpha$-Potential Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","cs.SY","eess.SY","math.DS"],"primary_cat":"cs.GT","authors_text":"Chinmay Maheshwari, Manxi Wu, Shankar Sastry, Xin Guo, Xinyu Li","submitted_at":"2023-05-21T19:27:31Z","abstract_excerpt":"We propose a new framework of Markov $\\alpha$-potential games to study Markov games. We show that any Markov game with finite-state and finite-action is a Markov $\\alpha$-potential game, and establish the existence of an associated $\\alpha$-potential function. Any optimizer of an $\\alpha$-potential function is shown to be an $\\alpha$-stationary Nash equilibrium. We study two important classes of practically significant Markov games, Markov congestion games and the perturbed Markov team games, via the framework of Markov $\\alpha$-potential games, with explicit characterization of an upper bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12553","kind":"arxiv","version":7},"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/2305.12553/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":"2305.12553","created_at":"2026-07-05T10:42:10.484705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.12553v7","created_at":"2026-07-05T10:42:10.484705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12553","created_at":"2026-07-05T10:42:10.484705+00:00"},{"alias_kind":"pith_short_12","alias_value":"33GGJQ56DGZI","created_at":"2026-07-05T10:42:10.484705+00:00"},{"alias_kind":"pith_short_16","alias_value":"33GGJQ56DGZI4JZT","created_at":"2026-07-05T10:42:10.484705+00:00"},{"alias_kind":"pith_short_8","alias_value":"33GGJQ56","created_at":"2026-07-05T10:42:10.484705+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00268","citing_title":"Fast Rates in $\\alpha$-Potential Games via Regularized Mirror Descent","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2508.01929","citing_title":"Distributed games with jumps: An $\\alpha$-potential game approach","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05573","citing_title":"AstroAlertBench: Evaluating the Accuracy, Reasoning, and Honesty of Multimodal LLMs in Astronomical Classification","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00268","citing_title":"Fast Rates in $\\alpha$-Potential Games via Regularized Mirror Descent","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7","json":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7.json","graph_json":"https://pith.science/api/pith-number/33GGJQ56DGZI4JZTH6WXDFHGD7/graph.json","events_json":"https://pith.science/api/pith-number/33GGJQ56DGZI4JZTH6WXDFHGD7/events.json","paper":"https://pith.science/paper/33GGJQ56"},"agent_actions":{"view_html":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7","download_json":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7.json","view_paper":"https://pith.science/paper/33GGJQ56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.12553&json=true","fetch_graph":"https://pith.science/api/pith-number/33GGJQ56DGZI4JZTH6WXDFHGD7/graph.json","fetch_events":"https://pith.science/api/pith-number/33GGJQ56DGZI4JZTH6WXDFHGD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7/action/storage_attestation","attest_author":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7/action/author_attestation","sign_citation":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7/action/citation_signature","submit_replication":"https://pith.science/pith/33GGJQ56DGZI4JZTH6WXDFHGD7/action/replication_record"}},"created_at":"2026-07-05T10:42:10.484705+00:00","updated_at":"2026-07-05T10:42:10.484705+00:00"}