{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H7OVJYCVRBKBU5ZN5GQQGFSZGK","short_pith_number":"pith:H7OVJYCV","schema_version":"1.0","canonical_sha256":"3fdd54e05588541a772de9a103165932b1d13dbe3d00a0596c2d95f85666cdb4","source":{"kind":"arxiv","id":"1207.4147","version":1},"attestation_state":"computed","paper":{"title":"Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Craig Boutilier, Nathanael Hyafil","submitted_at":"2012-07-11T14:55:55Z","abstract_excerpt":"Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is not known by other agents, nor is it known by the mechanism designer. When this uncertainty is quantified probabilistically, a mechanism induces a game of incomplete information among the agents. However, in many settings, uncertainty over utility functions cannot easily be quantified. We consider the problem of incomplete information games in which type uncertainty is strict or unquantified. We propose the use of mini"},"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":"1207.4147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-07-11T14:55:55Z","cross_cats_sorted":[],"title_canon_sha256":"a6beb98828e7a29cab7bcbfe6351e24586a36e4142bb46f4ebe34fde55d4183e","abstract_canon_sha256":"290ef41f31b6a6a6cf659e4fe872fae925ae0a4eebee18585462f6d2859273a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:47.666817Z","signature_b64":"0ta33qdnHBfYcBG4cvRR6mLLbJg77aDClIcWY2QWkITvY5SJ1zgcolE8CCvMTVaPBmFoS2BTTYWpX7nMJy+ZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fdd54e05588541a772de9a103165932b1d13dbe3d00a0596c2d95f85666cdb4","last_reissued_at":"2026-05-18T03:50:47.666042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:47.666042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret Minimizing Equilibria and Mechanisms for Games with Strict Type Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Craig Boutilier, Nathanael Hyafil","submitted_at":"2012-07-11T14:55:55Z","abstract_excerpt":"Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is not known by other agents, nor is it known by the mechanism designer. When this uncertainty is quantified probabilistically, a mechanism induces a game of incomplete information among the agents. However, in many settings, uncertainty over utility functions cannot easily be quantified. We consider the problem of incomplete information games in which type uncertainty is strict or unquantified. We propose the use of mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.4147","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":"1207.4147","created_at":"2026-05-18T03:50:47.666162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.4147v1","created_at":"2026-05-18T03:50:47.666162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.4147","created_at":"2026-05-18T03:50:47.666162+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7OVJYCVRBKB","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7OVJYCVRBKBU5ZN","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7OVJYCV","created_at":"2026-05-18T12:27:06.952714+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/H7OVJYCVRBKBU5ZN5GQQGFSZGK","json":"https://pith.science/pith/H7OVJYCVRBKBU5ZN5GQQGFSZGK.json","graph_json":"https://pith.science/api/pith-number/H7OVJYCVRBKBU5ZN5GQQGFSZGK/graph.json","events_json":"https://pith.science/api/pith-number/H7OVJYCVRBKBU5ZN5GQQGFSZGK/events.json","paper":"https://pith.science/paper/H7OVJYCV"},"agent_actions":{"view_html":"https://pith.science/pith/H7OVJYCVRBKBU5ZN5GQQGFSZGK","download_json":"https://pith.science/pith/H7OVJYCVRBKBU5ZN5GQQGFSZGK.json","view_paper":"https://pith.science/paper/H7OVJYCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.4147&json=true","fetch_graph":"https://pith.science/api/pith-number/H7OVJYCVRBKBU5ZN5GQQGFSZGK/graph.json","fetch_events":"https://pith.science/api/pith-number/H7OVJYCVRBKBU5ZN5GQQGFSZGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7OVJYCVRBKBU5ZN5GQQGFSZGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7OVJYCVRBKBU5ZN5GQQGFSZGK/action/storage_attestation","attest_author":"https://pith.science/pith/H7OVJYCVRBKBU5ZN5GQQGFSZGK/action/author_attestation","sign_citation":"https://pith.science/pith/H7OVJYCVRBKBU5ZN5GQQGFSZGK/action/citation_signature","submit_replication":"https://pith.science/pith/H7OVJYCVRBKBU5ZN5GQQGFSZGK/action/replication_record"}},"created_at":"2026-05-18T03:50:47.666162+00:00","updated_at":"2026-05-18T03:50:47.666162+00:00"}