{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7XXWUDI3CICW57FC5EIMZ722VK","short_pith_number":"pith:7XXWUDI3","schema_version":"1.0","canonical_sha256":"fdef6a0d1b12056efca2e910ccff5aaa9fe258787961dc47c43b86d102e9071e","source":{"kind":"arxiv","id":"1310.2648","version":3},"attestation_state":"computed","paper":{"title":"A Lyapunov Optimization Approach to Repeated Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Michael J. Neely","submitted_at":"2013-10-09T22:46:37Z","abstract_excerpt":"This paper considers a time-varying game with $N$ players. Every time slot, players observe their own random events and then take a control action. The events and control actions affect the individual utilities earned by each player. The goal is to maximize a concave function of time average utilities subject to equilibrium constraints. Specifically, participating players are provided access to a common source of randomness from which they can optimally correlate their decisions. The equilibrium constraints incentivize participation by ensuring that players cannot earn more utility if they cho"},"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":"1310.2648","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-10-09T22:46:37Z","cross_cats_sorted":[],"title_canon_sha256":"969711c9f637e1e849a0f2399e8d201a09b61f2ff0b52e8a2897500d243981ad","abstract_canon_sha256":"bd5a7b17c7f8e65d4bc37f883a37fe32287d4b04fd33c73e4987da5eff521e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:25.739810Z","signature_b64":"BtKdIHTMpbDMnNXq7xXc5ZSm3z1RQDpxWstua2FhXTBm+QAtGtsOpApnJUthc6nJqR+o57Gh9Tat/gQyQ8cEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdef6a0d1b12056efca2e910ccff5aaa9fe258787961dc47c43b86d102e9071e","last_reissued_at":"2026-05-18T03:00:25.738709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:25.738709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lyapunov Optimization Approach to Repeated Stochastic Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Michael J. Neely","submitted_at":"2013-10-09T22:46:37Z","abstract_excerpt":"This paper considers a time-varying game with $N$ players. Every time slot, players observe their own random events and then take a control action. The events and control actions affect the individual utilities earned by each player. The goal is to maximize a concave function of time average utilities subject to equilibrium constraints. Specifically, participating players are provided access to a common source of randomness from which they can optimally correlate their decisions. The equilibrium constraints incentivize participation by ensuring that players cannot earn more utility if they cho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2648","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":"1310.2648","created_at":"2026-05-18T03:00:25.738855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2648v3","created_at":"2026-05-18T03:00:25.738855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2648","created_at":"2026-05-18T03:00:25.738855+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XXWUDI3CICW","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XXWUDI3CICW57FC","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XXWUDI3","created_at":"2026-05-18T12:27:38.830355+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/7XXWUDI3CICW57FC5EIMZ722VK","json":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK.json","graph_json":"https://pith.science/api/pith-number/7XXWUDI3CICW57FC5EIMZ722VK/graph.json","events_json":"https://pith.science/api/pith-number/7XXWUDI3CICW57FC5EIMZ722VK/events.json","paper":"https://pith.science/paper/7XXWUDI3"},"agent_actions":{"view_html":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK","download_json":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK.json","view_paper":"https://pith.science/paper/7XXWUDI3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2648&json=true","fetch_graph":"https://pith.science/api/pith-number/7XXWUDI3CICW57FC5EIMZ722VK/graph.json","fetch_events":"https://pith.science/api/pith-number/7XXWUDI3CICW57FC5EIMZ722VK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/action/storage_attestation","attest_author":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/action/author_attestation","sign_citation":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/action/citation_signature","submit_replication":"https://pith.science/pith/7XXWUDI3CICW57FC5EIMZ722VK/action/replication_record"}},"created_at":"2026-05-18T03:00:25.738855+00:00","updated_at":"2026-05-18T03:00:25.738855+00:00"}