{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6Z72PFPYIFISO4CUQUZSW5G6G7","short_pith_number":"pith:6Z72PFPY","schema_version":"1.0","canonical_sha256":"f67fa795f8415127705485332b74de37d4d43f40bb27df323c3314698e8f7983","source":{"kind":"arxiv","id":"1810.06443","version":1},"attestation_state":"computed","paper":{"title":"Hedging Algorithms and Repeated Matrix Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bruno Bouzy, Damien Pellier, Marc M\\'etivier","submitted_at":"2018-10-15T15:05:21Z","abstract_excerpt":"Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that $UCB$, $M3$, $S$ or $Exp3$ algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on prediction problems. An hedging algorithm is made up with a top-level algorithm and a set of basic algorithms. To make its decision, an hedging algorithm uses its top-level algorithm to choose a basic algorithm, and the chosen algorithm makes the decision. This paper experimentally sh"},"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":"1810.06443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-15T15:05:21Z","cross_cats_sorted":["cs.GT","cs.MA","stat.ML"],"title_canon_sha256":"77b439e616079ceaf385b1a173230488cc3965464b5d8a606d8509e45b0af6d8","abstract_canon_sha256":"161bc1668862aa5bbf05da30b3cefa0d2f91fd2e6693695d05e1fa9e0bfe9ed4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:48.623595Z","signature_b64":"jjW4HGK+1ILLhrBVKvi5nbwRVOBmiv6sWmQUb+4rUBDY0ehsGIl8Vsp9eJRRRe21oJfgblc4Rq8JJsmeQLXVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f67fa795f8415127705485332b74de37d4d43f40bb27df323c3314698e8f7983","last_reissued_at":"2026-05-18T00:01:48.623132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:48.623132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hedging Algorithms and Repeated Matrix Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bruno Bouzy, Damien Pellier, Marc M\\'etivier","submitted_at":"2018-10-15T15:05:21Z","abstract_excerpt":"Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that $UCB$, $M3$, $S$ or $Exp3$ algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on prediction problems. An hedging algorithm is made up with a top-level algorithm and a set of basic algorithms. To make its decision, an hedging algorithm uses its top-level algorithm to choose a basic algorithm, and the chosen algorithm makes the decision. This paper experimentally sh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06443","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":"1810.06443","created_at":"2026-05-18T00:01:48.623199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06443v1","created_at":"2026-05-18T00:01:48.623199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06443","created_at":"2026-05-18T00:01:48.623199+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Z72PFPYIFIS","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Z72PFPYIFISO4CU","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Z72PFPY","created_at":"2026-05-18T12:32:11.075285+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/6Z72PFPYIFISO4CUQUZSW5G6G7","json":"https://pith.science/pith/6Z72PFPYIFISO4CUQUZSW5G6G7.json","graph_json":"https://pith.science/api/pith-number/6Z72PFPYIFISO4CUQUZSW5G6G7/graph.json","events_json":"https://pith.science/api/pith-number/6Z72PFPYIFISO4CUQUZSW5G6G7/events.json","paper":"https://pith.science/paper/6Z72PFPY"},"agent_actions":{"view_html":"https://pith.science/pith/6Z72PFPYIFISO4CUQUZSW5G6G7","download_json":"https://pith.science/pith/6Z72PFPYIFISO4CUQUZSW5G6G7.json","view_paper":"https://pith.science/paper/6Z72PFPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06443&json=true","fetch_graph":"https://pith.science/api/pith-number/6Z72PFPYIFISO4CUQUZSW5G6G7/graph.json","fetch_events":"https://pith.science/api/pith-number/6Z72PFPYIFISO4CUQUZSW5G6G7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Z72PFPYIFISO4CUQUZSW5G6G7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Z72PFPYIFISO4CUQUZSW5G6G7/action/storage_attestation","attest_author":"https://pith.science/pith/6Z72PFPYIFISO4CUQUZSW5G6G7/action/author_attestation","sign_citation":"https://pith.science/pith/6Z72PFPYIFISO4CUQUZSW5G6G7/action/citation_signature","submit_replication":"https://pith.science/pith/6Z72PFPYIFISO4CUQUZSW5G6G7/action/replication_record"}},"created_at":"2026-05-18T00:01:48.623199+00:00","updated_at":"2026-05-18T00:01:48.623199+00:00"}