{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HFGEU2MORJEDA65WB7LM3QADRU","short_pith_number":"pith:HFGEU2MO","schema_version":"1.0","canonical_sha256":"394c4a698e8a48307bb60fd6cdc0038d1c133101652c674ff67c519fe381ab3d","source":{"kind":"arxiv","id":"1611.10270","version":1},"attestation_state":"computed","paper":{"title":"Maximum a posteriori learning in demand competition games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Mohsen Rakhshan","submitted_at":"2016-11-28T23:58:17Z","abstract_excerpt":"We consider an inventory competition game between two firms. The question we address is this: If players do not know the opponent's action and opponent's utility function can they learn to play the Nash policy in a repeated game by observing their own sales? In this work it is proven that by means of Maximum A Posteriori (MAP) estimation, players can learn the Nash policy. It is proven that players' actions and beliefs do converge to the Nash equilibrium."},"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":"1611.10270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-11-28T23:58:17Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d94d6b99b141d5edeb4b1238315a99a310aefd93868c28cac7247ff481024c56","abstract_canon_sha256":"d6ce5707f15c1c89d5f75ceb10edcff9d6b2e9f707827cb77a2278bf79fa202b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:10.852905Z","signature_b64":"xP/iyc7sf3F0mCI/OwqiaEnsBE1Hxcs0CTmfSSowMhgsB7fE+EDamoAghIj0/qRrlX1JVHXYdTiGzWboXvCuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"394c4a698e8a48307bb60fd6cdc0038d1c133101652c674ff67c519fe381ab3d","last_reissued_at":"2026-05-18T00:56:10.852391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:10.852391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum a posteriori learning in demand competition games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Mohsen Rakhshan","submitted_at":"2016-11-28T23:58:17Z","abstract_excerpt":"We consider an inventory competition game between two firms. The question we address is this: If players do not know the opponent's action and opponent's utility function can they learn to play the Nash policy in a repeated game by observing their own sales? In this work it is proven that by means of Maximum A Posteriori (MAP) estimation, players can learn the Nash policy. It is proven that players' actions and beliefs do converge to the Nash equilibrium."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10270","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":"1611.10270","created_at":"2026-05-18T00:56:10.852463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.10270v1","created_at":"2026-05-18T00:56:10.852463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10270","created_at":"2026-05-18T00:56:10.852463+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFGEU2MORJED","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFGEU2MORJEDA65W","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFGEU2MO","created_at":"2026-05-18T12:30:19.053100+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/HFGEU2MORJEDA65WB7LM3QADRU","json":"https://pith.science/pith/HFGEU2MORJEDA65WB7LM3QADRU.json","graph_json":"https://pith.science/api/pith-number/HFGEU2MORJEDA65WB7LM3QADRU/graph.json","events_json":"https://pith.science/api/pith-number/HFGEU2MORJEDA65WB7LM3QADRU/events.json","paper":"https://pith.science/paper/HFGEU2MO"},"agent_actions":{"view_html":"https://pith.science/pith/HFGEU2MORJEDA65WB7LM3QADRU","download_json":"https://pith.science/pith/HFGEU2MORJEDA65WB7LM3QADRU.json","view_paper":"https://pith.science/paper/HFGEU2MO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.10270&json=true","fetch_graph":"https://pith.science/api/pith-number/HFGEU2MORJEDA65WB7LM3QADRU/graph.json","fetch_events":"https://pith.science/api/pith-number/HFGEU2MORJEDA65WB7LM3QADRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFGEU2MORJEDA65WB7LM3QADRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFGEU2MORJEDA65WB7LM3QADRU/action/storage_attestation","attest_author":"https://pith.science/pith/HFGEU2MORJEDA65WB7LM3QADRU/action/author_attestation","sign_citation":"https://pith.science/pith/HFGEU2MORJEDA65WB7LM3QADRU/action/citation_signature","submit_replication":"https://pith.science/pith/HFGEU2MORJEDA65WB7LM3QADRU/action/replication_record"}},"created_at":"2026-05-18T00:56:10.852463+00:00","updated_at":"2026-05-18T00:56:10.852463+00:00"}