{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E5TKVPOKZGU3MH6HCW4SY4JJIH","short_pith_number":"pith:E5TKVPOK","schema_version":"1.0","canonical_sha256":"2766aabdcac9a9b61fc715b92c712941fa3a6c7e342a638eb9b9edeaf141adb7","source":{"kind":"arxiv","id":"1211.1703","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Optimal Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alan Deckelbaum, Christos Tzamos, Constantinos Daskalakis","submitted_at":"2012-11-07T21:56:16Z","abstract_excerpt":"Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorly understood. We answer this question by showing that a revenue-optimal auction in multi-item settings cannot be found and implemented computationally efficiently, unless ZPP contains P^#P. This is true even for a single additive bidder whose values for the items are independently distributed on two rational "},"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":"1211.1703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-11-07T21:56:16Z","cross_cats_sorted":[],"title_canon_sha256":"541de9db2b21488dfc0263d4dc809f3bbecdbc2224f576165ffb86d4cf0cc630","abstract_canon_sha256":"74a1bef75d7ef74c77b4c9aaac1798d9146bfa4226eaf833134b3cf3f8db5ab5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:26.992688Z","signature_b64":"RhxozabxEseZNrJdNQrciqabY/rH1dE2UHbgbY95oOWX7OYpYADaJ9anS7PvzMEwY4ZJc8acKHMd7yysGGlzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2766aabdcac9a9b61fc715b92c712941fa3a6c7e342a638eb9b9edeaf141adb7","last_reissued_at":"2026-05-18T03:29:26.991901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:26.991901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Optimal Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Alan Deckelbaum, Christos Tzamos, Constantinos Daskalakis","submitted_at":"2012-11-07T21:56:16Z","abstract_excerpt":"Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorly understood. We answer this question by showing that a revenue-optimal auction in multi-item settings cannot be found and implemented computationally efficiently, unless ZPP contains P^#P. This is true even for a single additive bidder whose values for the items are independently distributed on two rational "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1703","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":""},"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":"1211.1703","created_at":"2026-05-18T03:29:26.992021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1703v2","created_at":"2026-05-18T03:29:26.992021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1703","created_at":"2026-05-18T03:29:26.992021+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5TKVPOKZGU3","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5TKVPOKZGU3MH6H","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5TKVPOK","created_at":"2026-05-18T12:27:04.183437+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/E5TKVPOKZGU3MH6HCW4SY4JJIH","json":"https://pith.science/pith/E5TKVPOKZGU3MH6HCW4SY4JJIH.json","graph_json":"https://pith.science/api/pith-number/E5TKVPOKZGU3MH6HCW4SY4JJIH/graph.json","events_json":"https://pith.science/api/pith-number/E5TKVPOKZGU3MH6HCW4SY4JJIH/events.json","paper":"https://pith.science/paper/E5TKVPOK"},"agent_actions":{"view_html":"https://pith.science/pith/E5TKVPOKZGU3MH6HCW4SY4JJIH","download_json":"https://pith.science/pith/E5TKVPOKZGU3MH6HCW4SY4JJIH.json","view_paper":"https://pith.science/paper/E5TKVPOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1703&json=true","fetch_graph":"https://pith.science/api/pith-number/E5TKVPOKZGU3MH6HCW4SY4JJIH/graph.json","fetch_events":"https://pith.science/api/pith-number/E5TKVPOKZGU3MH6HCW4SY4JJIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5TKVPOKZGU3MH6HCW4SY4JJIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5TKVPOKZGU3MH6HCW4SY4JJIH/action/storage_attestation","attest_author":"https://pith.science/pith/E5TKVPOKZGU3MH6HCW4SY4JJIH/action/author_attestation","sign_citation":"https://pith.science/pith/E5TKVPOKZGU3MH6HCW4SY4JJIH/action/citation_signature","submit_replication":"https://pith.science/pith/E5TKVPOKZGU3MH6HCW4SY4JJIH/action/replication_record"}},"created_at":"2026-05-18T03:29:26.992021+00:00","updated_at":"2026-05-18T03:29:26.992021+00:00"}