{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KWQKTEMJTBBMMNLNYZLXCBDBZ4","short_pith_number":"pith:KWQKTEMJ","schema_version":"1.0","canonical_sha256":"55a0a991899842c6356dc657710461cf18646ac9683548b049c4bbf647b82c28","source":{"kind":"arxiv","id":"1512.03253","version":1},"attestation_state":"computed","paper":{"title":"Distributionally Robust Game Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Nicolas Loizou","submitted_at":"2015-12-10T13:46:56Z","abstract_excerpt":"The classical, complete-information two-player games assume that the problem data (in particular the payoff matrix) is known exactly by both players. In a now famous result, Nash has shown that any such game has an equilibrium in mixed strategies. This result was later extended to a class of incomplete-information two-player games by Harsanyi, who assumed that the payoff matrix is not known exactly but rather represents a random variable that is governed by a probability distribution known to both players.\n  In 2006, Bertsimas and Aghassi proposed a new class of distribution-free two-player ga"},"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":"1512.03253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-12-10T13:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"5c9908e8fd152662948e074fb440ad59ebf466d28d546541aaf429320736fce0","abstract_canon_sha256":"81c02bf51532b45132ac47dcc44e4e521c66708a8cc7c78c8e0eee3f354a8974"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:37.545539Z","signature_b64":"CyIPK4WlkexErOwp5BZQIAkHvdw9lbeTygUXKVLaGRtAx7/Lp0NvEzE6BdLhywWSmFPcIh53F9OCrz90LWZFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a0a991899842c6356dc657710461cf18646ac9683548b049c4bbf647b82c28","last_reissued_at":"2026-05-18T01:24:37.545089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:37.545089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributionally Robust Game Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Nicolas Loizou","submitted_at":"2015-12-10T13:46:56Z","abstract_excerpt":"The classical, complete-information two-player games assume that the problem data (in particular the payoff matrix) is known exactly by both players. In a now famous result, Nash has shown that any such game has an equilibrium in mixed strategies. This result was later extended to a class of incomplete-information two-player games by Harsanyi, who assumed that the payoff matrix is not known exactly but rather represents a random variable that is governed by a probability distribution known to both players.\n  In 2006, Bertsimas and Aghassi proposed a new class of distribution-free two-player ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03253","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":"1512.03253","created_at":"2026-05-18T01:24:37.545151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03253v1","created_at":"2026-05-18T01:24:37.545151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03253","created_at":"2026-05-18T01:24:37.545151+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWQKTEMJTBBM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWQKTEMJTBBMMNLN","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWQKTEMJ","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.14141","citing_title":"Chance-Constrained Correlated Equilibria for Robust Noncooperative Coordination","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23669","citing_title":"Strategically Robust Aggregative Games","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4","json":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4.json","graph_json":"https://pith.science/api/pith-number/KWQKTEMJTBBMMNLNYZLXCBDBZ4/graph.json","events_json":"https://pith.science/api/pith-number/KWQKTEMJTBBMMNLNYZLXCBDBZ4/events.json","paper":"https://pith.science/paper/KWQKTEMJ"},"agent_actions":{"view_html":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4","download_json":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4.json","view_paper":"https://pith.science/paper/KWQKTEMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03253&json=true","fetch_graph":"https://pith.science/api/pith-number/KWQKTEMJTBBMMNLNYZLXCBDBZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/KWQKTEMJTBBMMNLNYZLXCBDBZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4/action/storage_attestation","attest_author":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4/action/author_attestation","sign_citation":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4/action/citation_signature","submit_replication":"https://pith.science/pith/KWQKTEMJTBBMMNLNYZLXCBDBZ4/action/replication_record"}},"created_at":"2026-05-18T01:24:37.545151+00:00","updated_at":"2026-05-18T01:24:37.545151+00:00"}