{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LRCR33FY5YWJ3WYYHNLXC366U5","short_pith_number":"pith:LRCR33FY","schema_version":"1.0","canonical_sha256":"5c451decb8ee2c9ddb183b57716fdea74ebdcf4b65594f80376480f7080f69b0","source":{"kind":"arxiv","id":"1607.08863","version":1},"attestation_state":"computed","paper":{"title":"Exponentially fast convergence to (strict) equilibrium via hedging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.GT","authors_text":"Am\\'elie H\\'eliou, Johanne Cohen, Panayotis Mertikopoulos","submitted_at":"2016-07-29T16:16:49Z","abstract_excerpt":"Motivated by applications to data networks where fast convergence is essential, we analyze the problem of learning in generic N-person games that admit a Nash equilibrium in pure strategies. Specifically, we consider a scenario where players interact repeatedly and try to learn from past experience by small adjustments based on local - and possibly imperfect - payoff information. For concreteness, we focus on the so-called \"hedge\" variant of the exponential weights algorithm where players select an action with probability proportional to the exponential of the action's cumulative payoff over t"},"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":"1607.08863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-07-29T16:16:49Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"467cfd3d7f7928a12fa2897c4f3ba69ee63ca1783b1e0181db4ba9497898d4a8","abstract_canon_sha256":"0a3bdde5e74111d431dbf1ab3190993074421d23f167ecea0f3ffafa9d78ce6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:15.717731Z","signature_b64":"TAskdxlYsLHi33vQ+fgYeDsyRC0nio+hSd0Osk5zAV/Md3qXJbkUBWxJDKsAXkX5euH3ex9SqBXXyeDswIMhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c451decb8ee2c9ddb183b57716fdea74ebdcf4b65594f80376480f7080f69b0","last_reissued_at":"2026-05-18T01:10:15.717114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:15.717114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponentially fast convergence to (strict) equilibrium via hedging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.GT","authors_text":"Am\\'elie H\\'eliou, Johanne Cohen, Panayotis Mertikopoulos","submitted_at":"2016-07-29T16:16:49Z","abstract_excerpt":"Motivated by applications to data networks where fast convergence is essential, we analyze the problem of learning in generic N-person games that admit a Nash equilibrium in pure strategies. Specifically, we consider a scenario where players interact repeatedly and try to learn from past experience by small adjustments based on local - and possibly imperfect - payoff information. For concreteness, we focus on the so-called \"hedge\" variant of the exponential weights algorithm where players select an action with probability proportional to the exponential of the action's cumulative payoff over t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08863","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":"1607.08863","created_at":"2026-05-18T01:10:15.717201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08863v1","created_at":"2026-05-18T01:10:15.717201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08863","created_at":"2026-05-18T01:10:15.717201+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRCR33FY5YWJ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRCR33FY5YWJ3WYY","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRCR33FY","created_at":"2026-05-18T12:30:29.479603+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/LRCR33FY5YWJ3WYYHNLXC366U5","json":"https://pith.science/pith/LRCR33FY5YWJ3WYYHNLXC366U5.json","graph_json":"https://pith.science/api/pith-number/LRCR33FY5YWJ3WYYHNLXC366U5/graph.json","events_json":"https://pith.science/api/pith-number/LRCR33FY5YWJ3WYYHNLXC366U5/events.json","paper":"https://pith.science/paper/LRCR33FY"},"agent_actions":{"view_html":"https://pith.science/pith/LRCR33FY5YWJ3WYYHNLXC366U5","download_json":"https://pith.science/pith/LRCR33FY5YWJ3WYYHNLXC366U5.json","view_paper":"https://pith.science/paper/LRCR33FY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08863&json=true","fetch_graph":"https://pith.science/api/pith-number/LRCR33FY5YWJ3WYYHNLXC366U5/graph.json","fetch_events":"https://pith.science/api/pith-number/LRCR33FY5YWJ3WYYHNLXC366U5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRCR33FY5YWJ3WYYHNLXC366U5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRCR33FY5YWJ3WYYHNLXC366U5/action/storage_attestation","attest_author":"https://pith.science/pith/LRCR33FY5YWJ3WYYHNLXC366U5/action/author_attestation","sign_citation":"https://pith.science/pith/LRCR33FY5YWJ3WYYHNLXC366U5/action/citation_signature","submit_replication":"https://pith.science/pith/LRCR33FY5YWJ3WYYHNLXC366U5/action/replication_record"}},"created_at":"2026-05-18T01:10:15.717201+00:00","updated_at":"2026-05-18T01:10:15.717201+00:00"}