{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BYRUMKPBNXT6YHESBA5XO7EORE","short_pith_number":"pith:BYRUMKPB","schema_version":"1.0","canonical_sha256":"0e234629e16de7ec1c92083b777c8e89208721649134911bf5d3b7d1ba659aa7","source":{"kind":"arxiv","id":"1609.08830","version":1},"attestation_state":"computed","paper":{"title":"Robustness Properties in Fictitious-Play-Type Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Brian Swenson, David S. Leslie, Jo\\~ao Xavier, Soummya Kar","submitted_at":"2016-09-28T09:02:05Z","abstract_excerpt":"Fictitious play (FP) is a canonical game-theoretic learning algorithm which has been deployed extensively in decentralized control scenarios. However standard treatments of FP, and of many other game-theoretic models, assume rather idealistic conditions which rarely hold in realistic control scenarios. This paper considers a broad class of best response learning algorithms, that we refer to as FP-type algorithms. In such an algorithm, given some (possibly limited) information about the history of actions, each individual forecasts the future play and chooses a (myopic) best action given their "},"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":"1609.08830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-28T09:02:05Z","cross_cats_sorted":[],"title_canon_sha256":"1d4dcd6312f37e8281e7175aaca43241682612c9443b736ae5499618e8d7d9cf","abstract_canon_sha256":"d086877567b81d5ca9487fab1f6a81694e27aaa0f5b489e7fc427e68e69b493f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:41.776023Z","signature_b64":"V8KTlCnwnj/rXtlg3TpGXDZo9URG5jyJkI2zJfQbNuNaMRsUTOShLnrxPdM/CjwGEy9P5rocsUwtFqWhDr0eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e234629e16de7ec1c92083b777c8e89208721649134911bf5d3b7d1ba659aa7","last_reissued_at":"2026-05-18T01:03:41.775625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:41.775625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustness Properties in Fictitious-Play-Type Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Brian Swenson, David S. Leslie, Jo\\~ao Xavier, Soummya Kar","submitted_at":"2016-09-28T09:02:05Z","abstract_excerpt":"Fictitious play (FP) is a canonical game-theoretic learning algorithm which has been deployed extensively in decentralized control scenarios. However standard treatments of FP, and of many other game-theoretic models, assume rather idealistic conditions which rarely hold in realistic control scenarios. This paper considers a broad class of best response learning algorithms, that we refer to as FP-type algorithms. In such an algorithm, given some (possibly limited) information about the history of actions, each individual forecasts the future play and chooses a (myopic) best action given their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08830","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":"1609.08830","created_at":"2026-05-18T01:03:41.775683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08830v1","created_at":"2026-05-18T01:03:41.775683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08830","created_at":"2026-05-18T01:03:41.775683+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYRUMKPBNXT6","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYRUMKPBNXT6YHES","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYRUMKPB","created_at":"2026-05-18T12:30:09.641336+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/BYRUMKPBNXT6YHESBA5XO7EORE","json":"https://pith.science/pith/BYRUMKPBNXT6YHESBA5XO7EORE.json","graph_json":"https://pith.science/api/pith-number/BYRUMKPBNXT6YHESBA5XO7EORE/graph.json","events_json":"https://pith.science/api/pith-number/BYRUMKPBNXT6YHESBA5XO7EORE/events.json","paper":"https://pith.science/paper/BYRUMKPB"},"agent_actions":{"view_html":"https://pith.science/pith/BYRUMKPBNXT6YHESBA5XO7EORE","download_json":"https://pith.science/pith/BYRUMKPBNXT6YHESBA5XO7EORE.json","view_paper":"https://pith.science/paper/BYRUMKPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08830&json=true","fetch_graph":"https://pith.science/api/pith-number/BYRUMKPBNXT6YHESBA5XO7EORE/graph.json","fetch_events":"https://pith.science/api/pith-number/BYRUMKPBNXT6YHESBA5XO7EORE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYRUMKPBNXT6YHESBA5XO7EORE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYRUMKPBNXT6YHESBA5XO7EORE/action/storage_attestation","attest_author":"https://pith.science/pith/BYRUMKPBNXT6YHESBA5XO7EORE/action/author_attestation","sign_citation":"https://pith.science/pith/BYRUMKPBNXT6YHESBA5XO7EORE/action/citation_signature","submit_replication":"https://pith.science/pith/BYRUMKPBNXT6YHESBA5XO7EORE/action/replication_record"}},"created_at":"2026-05-18T01:03:41.775683+00:00","updated_at":"2026-05-18T01:03:41.775683+00:00"}