{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FH4CKUP7QXMQLHKZBFSUXR4GTD","short_pith_number":"pith:FH4CKUP7","schema_version":"1.0","canonical_sha256":"29f82551ff85d9059d5909654bc78698f7baedc53c36f4d90d83d46bc4f2e858","source":{"kind":"arxiv","id":"2408.10066","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH","math.OC"],"primary_cat":"cs.GT","authors_text":"Moise Blanchard, Patrick Jaillet","submitted_at":"2024-08-19T15:04:20Z","abstract_excerpt":"We study the problem in which a central planner sequentially allocates a single resource to multiple strategic agents using their utility reports at each round, but without using any monetary transfers. We consider general agent utility distributions and two standard settings: a finite horizon $T$ and an infinite horizon with $\\gamma$ discounts. We provide general tools to characterize the convergence rate between the optimal mechanism for the central planner and the first-best allocation if true agent utilities were available. This heavily depends on the utility distributions, yielding rates "},"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":"2408.10066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-08-19T15:04:20Z","cross_cats_sorted":["econ.TH","math.OC"],"title_canon_sha256":"e84f90ad3b32972ef19744e57ef3f313f83b5a55802a8a5e1194dadb2219748b","abstract_canon_sha256":"f50e652f8cdddae8e4ee95612fa904a78d3be4bfc277c23e63f2a57668e74824"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:50.843461Z","signature_b64":"QT1+Wpk2G4LlHFLs8aLhYxkpj4cjRc4vfSLTpbxt173OPosCMewHbPTHQV/8lZ155RUCdYxllEhSj8gSfmUOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29f82551ff85d9059d5909654bc78698f7baedc53c36f4d90d83d46bc4f2e858","last_reissued_at":"2026-07-05T08:56:50.843067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:50.843067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Mechanisms for Resource Allocation Without Monetary Transfers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH","math.OC"],"primary_cat":"cs.GT","authors_text":"Moise Blanchard, Patrick Jaillet","submitted_at":"2024-08-19T15:04:20Z","abstract_excerpt":"We study the problem in which a central planner sequentially allocates a single resource to multiple strategic agents using their utility reports at each round, but without using any monetary transfers. We consider general agent utility distributions and two standard settings: a finite horizon $T$ and an infinite horizon with $\\gamma$ discounts. We provide general tools to characterize the convergence rate between the optimal mechanism for the central planner and the first-best allocation if true agent utilities were available. This heavily depends on the utility distributions, yielding rates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10066","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.10066/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.10066","created_at":"2026-07-05T08:56:50.843123+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.10066v1","created_at":"2026-07-05T08:56:50.843123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10066","created_at":"2026-07-05T08:56:50.843123+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH4CKUP7QXMQ","created_at":"2026-07-05T08:56:50.843123+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH4CKUP7QXMQLHKZ","created_at":"2026-07-05T08:56:50.843123+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH4CKUP7","created_at":"2026-07-05T08:56:50.843123+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.09473","citing_title":"Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD","json":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD.json","graph_json":"https://pith.science/api/pith-number/FH4CKUP7QXMQLHKZBFSUXR4GTD/graph.json","events_json":"https://pith.science/api/pith-number/FH4CKUP7QXMQLHKZBFSUXR4GTD/events.json","paper":"https://pith.science/paper/FH4CKUP7"},"agent_actions":{"view_html":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD","download_json":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD.json","view_paper":"https://pith.science/paper/FH4CKUP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.10066&json=true","fetch_graph":"https://pith.science/api/pith-number/FH4CKUP7QXMQLHKZBFSUXR4GTD/graph.json","fetch_events":"https://pith.science/api/pith-number/FH4CKUP7QXMQLHKZBFSUXR4GTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD/action/storage_attestation","attest_author":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD/action/author_attestation","sign_citation":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD/action/citation_signature","submit_replication":"https://pith.science/pith/FH4CKUP7QXMQLHKZBFSUXR4GTD/action/replication_record"}},"created_at":"2026-07-05T08:56:50.843123+00:00","updated_at":"2026-07-05T08:56:50.843123+00:00"}