{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3VHVZCHKE3AHXWHCGYG5TGL7JD","short_pith_number":"pith:3VHVZCHK","schema_version":"1.0","canonical_sha256":"dd4f5c88ea26c07bd8e2360dd9997f48e42301349950fae8d5017d5259ac204c","source":{"kind":"arxiv","id":"2305.11261","version":2},"attestation_state":"computed","paper":{"title":"Game Theory with Simulation of Other Players","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Caspar Oesterheld, Vincent Conitzer, Vojtech Kovarik","submitted_at":"2023-05-18T18:55:54Z","abstract_excerpt":"Game-theoretic interactions with AI agents could differ from traditional human-human interactions in various ways. One such difference is that it may be possible to simulate an AI agent (for example because its source code is known), which allows others to accurately predict the agent's actions. This could lower the bar for trust and cooperation. In this paper, we formalize games in which one player can simulate another at a cost. We first derive some basic properties of such games and then prove a number of results for them, including: (1) introducing simulation into generic-payoff normal-for"},"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":"2305.11261","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-05-18T18:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"1182af72d6bbc79ce88c50e661886a6ec0d0298baa9c91e6269631203477e50e","abstract_canon_sha256":"09a0a0de1bddbb1c2d4146a88711da199a359c56746fcd6820cf4076a978db15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:20.111750Z","signature_b64":"EcKjWyXo5zqUHnulAunHJq9oYxVE+KH07Sq3feLlbCPhqYO2yuGT2WyAFiruSKxZWWHgmvvcZA3rQnytNZ+9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd4f5c88ea26c07bd8e2360dd9997f48e42301349950fae8d5017d5259ac204c","last_reissued_at":"2026-07-05T07:58:20.111343Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:20.111343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game Theory with Simulation of Other Players","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Caspar Oesterheld, Vincent Conitzer, Vojtech Kovarik","submitted_at":"2023-05-18T18:55:54Z","abstract_excerpt":"Game-theoretic interactions with AI agents could differ from traditional human-human interactions in various ways. One such difference is that it may be possible to simulate an AI agent (for example because its source code is known), which allows others to accurately predict the agent's actions. This could lower the bar for trust and cooperation. In this paper, we formalize games in which one player can simulate another at a cost. We first derive some basic properties of such games and then prove a number of results for them, including: (1) introducing simulation into generic-payoff normal-for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.11261","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.11261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.11261","created_at":"2026-07-05T07:58:20.111409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.11261v2","created_at":"2026-07-05T07:58:20.111409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.11261","created_at":"2026-07-05T07:58:20.111409+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VHVZCHKE3AH","created_at":"2026-07-05T07:58:20.111409+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VHVZCHKE3AHXWHC","created_at":"2026-07-05T07:58:20.111409+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VHVZCHK","created_at":"2026-07-05T07:58:20.111409+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03958","citing_title":"A game theory for foundation models shows new paths to rational cooperation through similarity inference","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD","json":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD.json","graph_json":"https://pith.science/api/pith-number/3VHVZCHKE3AHXWHCGYG5TGL7JD/graph.json","events_json":"https://pith.science/api/pith-number/3VHVZCHKE3AHXWHCGYG5TGL7JD/events.json","paper":"https://pith.science/paper/3VHVZCHK"},"agent_actions":{"view_html":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD","download_json":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD.json","view_paper":"https://pith.science/paper/3VHVZCHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.11261&json=true","fetch_graph":"https://pith.science/api/pith-number/3VHVZCHKE3AHXWHCGYG5TGL7JD/graph.json","fetch_events":"https://pith.science/api/pith-number/3VHVZCHKE3AHXWHCGYG5TGL7JD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD/action/storage_attestation","attest_author":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD/action/author_attestation","sign_citation":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD/action/citation_signature","submit_replication":"https://pith.science/pith/3VHVZCHKE3AHXWHCGYG5TGL7JD/action/replication_record"}},"created_at":"2026-07-05T07:58:20.111409+00:00","updated_at":"2026-07-05T07:58:20.111409+00:00"}