{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OUOWZJ4MWND3B3MEP2B5D2BFYU","short_pith_number":"pith:OUOWZJ4M","schema_version":"1.0","canonical_sha256":"751d6ca78cb347b0ed847e83d1e825c533f12fe7a8aa322292dfc887c88ac387","source":{"kind":"arxiv","id":"1401.3834","version":1},"attestation_state":"computed","paper":{"title":"Mechanisms for Multi-Unit Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Shahar Dobzinski","submitted_at":"2014-01-16T04:50:35Z","abstract_excerpt":"We present an incentive-compatible polynomial-time approximation scheme for multi-unit auctions with general k-minded player valuations. The mechanism fully optimizes over an appropriately chosen sub-range of possible allocations and then uses VCG payments over this sub-range. We show that obtaining a fully polynomial-time incentive-compatible approximation scheme, at least using VCG payments, is NP-hard. For the case of valuations given by black boxes, we give a polynomial-time incentive-compatible 2-approximation mechanism and show that no better is possible, at least using VCG payments."},"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":"1401.3834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-16T04:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"2edd810bf52d0649fe8d50e3793cb056f8e3905fffcb144d760827e9c1d79fa0","abstract_canon_sha256":"a1f50fe4f3e33fecb202b2f55e1ce90796ab6403b73559db111bc49b96ed10bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.783092Z","signature_b64":"L/fb3tAHygRgTOHHNpb1Or2VjVRM8rybI06kIuH6YyeqNMjGURf5UOwWBES0/ePFO4/m288Py5Ba/dL1IyUlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"751d6ca78cb347b0ed847e83d1e825c533f12fe7a8aa322292dfc887c88ac387","last_reissued_at":"2026-05-18T03:02:06.782568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.782568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mechanisms for Multi-Unit Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Shahar Dobzinski","submitted_at":"2014-01-16T04:50:35Z","abstract_excerpt":"We present an incentive-compatible polynomial-time approximation scheme for multi-unit auctions with general k-minded player valuations. The mechanism fully optimizes over an appropriately chosen sub-range of possible allocations and then uses VCG payments over this sub-range. We show that obtaining a fully polynomial-time incentive-compatible approximation scheme, at least using VCG payments, is NP-hard. For the case of valuations given by black boxes, we give a polynomial-time incentive-compatible 2-approximation mechanism and show that no better is possible, at least using VCG payments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3834","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":"1401.3834","created_at":"2026-05-18T03:02:06.782648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3834v1","created_at":"2026-05-18T03:02:06.782648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3834","created_at":"2026-05-18T03:02:06.782648+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUOWZJ4MWND3","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUOWZJ4MWND3B3ME","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUOWZJ4M","created_at":"2026-05-18T12:28:43.426989+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/OUOWZJ4MWND3B3MEP2B5D2BFYU","json":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU.json","graph_json":"https://pith.science/api/pith-number/OUOWZJ4MWND3B3MEP2B5D2BFYU/graph.json","events_json":"https://pith.science/api/pith-number/OUOWZJ4MWND3B3MEP2B5D2BFYU/events.json","paper":"https://pith.science/paper/OUOWZJ4M"},"agent_actions":{"view_html":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU","download_json":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU.json","view_paper":"https://pith.science/paper/OUOWZJ4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3834&json=true","fetch_graph":"https://pith.science/api/pith-number/OUOWZJ4MWND3B3MEP2B5D2BFYU/graph.json","fetch_events":"https://pith.science/api/pith-number/OUOWZJ4MWND3B3MEP2B5D2BFYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/action/storage_attestation","attest_author":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/action/author_attestation","sign_citation":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/action/citation_signature","submit_replication":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/action/replication_record"}},"created_at":"2026-05-18T03:02:06.782648+00:00","updated_at":"2026-05-18T03:02:06.782648+00:00"}