{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5GUWN4AVG4JA3IP7KUC6HF26BY","short_pith_number":"pith:5GUWN4AV","schema_version":"1.0","canonical_sha256":"e9a966f01537120da1ff5505e3975e0e267e0906cfff396fbdbeff4b00375ca7","source":{"kind":"arxiv","id":"1302.4138","version":2},"attestation_state":"computed","paper":{"title":"Multi-parameter Mechanisms with Implicit Payment Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aleksandrs Slivkins, Moshe Babaioff, Robert Kleinberg","submitted_at":"2013-02-18T00:25:29Z","abstract_excerpt":"In this paper we show that payment computation essentially does not present any obstacle in designing truthful mechanisms, even for multi-parameter domains, and even when we can only call the allocation rule once. We present a general reduction that takes any allocation rule which satisfies \"cyclic monotonicity\" (a known necessary and sufficient condition for truthfulness) and converts it to a truthful mechanism using a single call to the allocation rule, with arbitrarily small loss to the expected social welfare.\n  A prominent example for a multi-parameter setting in which an allocation rule "},"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":"1302.4138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-02-18T00:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"401f8d0db7679b8884076b0ef4ec9c774fc0a1c93c0cd0157c35aa82e952e190","abstract_canon_sha256":"63f3707154e0cb8f9641b36adf6f8de2429e120561d004449667426728f2b367"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:58.538554Z","signature_b64":"jsAENIdriuTWIlXfLypyaCk69RWsn+aea44PmUtqRboyrTaYnOyFECjbR0UPt36SRIkgJn6e5UjnupwBgqxcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9a966f01537120da1ff5505e3975e0e267e0906cfff396fbdbeff4b00375ca7","last_reissued_at":"2026-05-18T03:25:58.537817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:58.537817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-parameter Mechanisms with Implicit Payment Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aleksandrs Slivkins, Moshe Babaioff, Robert Kleinberg","submitted_at":"2013-02-18T00:25:29Z","abstract_excerpt":"In this paper we show that payment computation essentially does not present any obstacle in designing truthful mechanisms, even for multi-parameter domains, and even when we can only call the allocation rule once. We present a general reduction that takes any allocation rule which satisfies \"cyclic monotonicity\" (a known necessary and sufficient condition for truthfulness) and converts it to a truthful mechanism using a single call to the allocation rule, with arbitrarily small loss to the expected social welfare.\n  A prominent example for a multi-parameter setting in which an allocation rule "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4138","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":"1302.4138","created_at":"2026-05-18T03:25:58.537947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4138v2","created_at":"2026-05-18T03:25:58.537947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4138","created_at":"2026-05-18T03:25:58.537947+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GUWN4AVG4JA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GUWN4AVG4JA3IP7","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GUWN4AV","created_at":"2026-05-18T12:27:34.582898+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/5GUWN4AVG4JA3IP7KUC6HF26BY","json":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY.json","graph_json":"https://pith.science/api/pith-number/5GUWN4AVG4JA3IP7KUC6HF26BY/graph.json","events_json":"https://pith.science/api/pith-number/5GUWN4AVG4JA3IP7KUC6HF26BY/events.json","paper":"https://pith.science/paper/5GUWN4AV"},"agent_actions":{"view_html":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY","download_json":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY.json","view_paper":"https://pith.science/paper/5GUWN4AV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4138&json=true","fetch_graph":"https://pith.science/api/pith-number/5GUWN4AVG4JA3IP7KUC6HF26BY/graph.json","fetch_events":"https://pith.science/api/pith-number/5GUWN4AVG4JA3IP7KUC6HF26BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/action/storage_attestation","attest_author":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/action/author_attestation","sign_citation":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/action/citation_signature","submit_replication":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/action/replication_record"}},"created_at":"2026-05-18T03:25:58.537947+00:00","updated_at":"2026-05-18T03:25:58.537947+00:00"}