{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BOML4JNACRRZWLS2ENEUAY5ZCL","short_pith_number":"pith:BOML4JNA","schema_version":"1.0","canonical_sha256":"0b98be25a014639b2e5a23494063b912d051e48828e96382f1cb48db2fa3773e","source":{"kind":"arxiv","id":"1507.08339","version":1},"attestation_state":"computed","paper":{"title":"Inspection games in a mean field setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Vassili Kolokoltsov, Wei Yang","submitted_at":"2015-07-29T22:52:41Z","abstract_excerpt":"In this paper, we present a new development of inspection games in a mean field setting. In our dynamic version of an inspection game, there is one inspector and a large number N interacting inspectees with a finite state space. By applying the mean field game methodology, we present a solution as an epsilon-equilibrium to this type of inspection games, where epsilon goes to 0 as N tends to infinity. In order to facilitate numerical analysis of this new type inspection game, we conduct an approximation analysis, that is we approximate the optimal Lipschitz continuous switching strategies by sm"},"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":"1507.08339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-29T22:52:41Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"5400be827a40849a86215bbbb4430fe910fd132918194ea4bbff06006dec852a","abstract_canon_sha256":"466621aff32d61cc170ce0692a8152bdec2fee2e6b8c70c9575cc5a67bfeefc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:07.689872Z","signature_b64":"C5uv05E5MaKh+uieQ8c++j4u9IzOlrsirOBEEbgnomuipDqNiR0iApYHeKMxN/9rrENupHv1WN8Ch0mobn9LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b98be25a014639b2e5a23494063b912d051e48828e96382f1cb48db2fa3773e","last_reissued_at":"2026-05-18T01:36:07.689419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:07.689419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inspection games in a mean field setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Vassili Kolokoltsov, Wei Yang","submitted_at":"2015-07-29T22:52:41Z","abstract_excerpt":"In this paper, we present a new development of inspection games in a mean field setting. In our dynamic version of an inspection game, there is one inspector and a large number N interacting inspectees with a finite state space. By applying the mean field game methodology, we present a solution as an epsilon-equilibrium to this type of inspection games, where epsilon goes to 0 as N tends to infinity. In order to facilitate numerical analysis of this new type inspection game, we conduct an approximation analysis, that is we approximate the optimal Lipschitz continuous switching strategies by sm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08339","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":"1507.08339","created_at":"2026-05-18T01:36:07.689480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08339v1","created_at":"2026-05-18T01:36:07.689480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08339","created_at":"2026-05-18T01:36:07.689480+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOML4JNACRRZ","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOML4JNACRRZWLS2","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOML4JNA","created_at":"2026-05-18T12:29:14.074870+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/BOML4JNACRRZWLS2ENEUAY5ZCL","json":"https://pith.science/pith/BOML4JNACRRZWLS2ENEUAY5ZCL.json","graph_json":"https://pith.science/api/pith-number/BOML4JNACRRZWLS2ENEUAY5ZCL/graph.json","events_json":"https://pith.science/api/pith-number/BOML4JNACRRZWLS2ENEUAY5ZCL/events.json","paper":"https://pith.science/paper/BOML4JNA"},"agent_actions":{"view_html":"https://pith.science/pith/BOML4JNACRRZWLS2ENEUAY5ZCL","download_json":"https://pith.science/pith/BOML4JNACRRZWLS2ENEUAY5ZCL.json","view_paper":"https://pith.science/paper/BOML4JNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08339&json=true","fetch_graph":"https://pith.science/api/pith-number/BOML4JNACRRZWLS2ENEUAY5ZCL/graph.json","fetch_events":"https://pith.science/api/pith-number/BOML4JNACRRZWLS2ENEUAY5ZCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOML4JNACRRZWLS2ENEUAY5ZCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOML4JNACRRZWLS2ENEUAY5ZCL/action/storage_attestation","attest_author":"https://pith.science/pith/BOML4JNACRRZWLS2ENEUAY5ZCL/action/author_attestation","sign_citation":"https://pith.science/pith/BOML4JNACRRZWLS2ENEUAY5ZCL/action/citation_signature","submit_replication":"https://pith.science/pith/BOML4JNACRRZWLS2ENEUAY5ZCL/action/replication_record"}},"created_at":"2026-05-18T01:36:07.689480+00:00","updated_at":"2026-05-18T01:36:07.689480+00:00"}