{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y3SXPADJPMX7ED34RGFYQGFO4P","short_pith_number":"pith:Y3SXPADJ","schema_version":"1.0","canonical_sha256":"c6e57780697b2ff20f7c898b8818aee3f3f7cb1b279051aff97ea19164c4e2a1","source":{"kind":"arxiv","id":"2502.08412","version":3},"attestation_state":"computed","paper":{"title":"Non-Monetary Mechanism Design without Priors: Achieving Efficiency via Adaptive Costly Audits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Moise Blanchard, Patrick Jaillet, Yan Dai","submitted_at":"2025-02-12T13:53:21Z","abstract_excerpt":"We study repeated resource allocation with strategic agents, where monetary transfers are disallowed and the planner has no prior information on agents' utility distributions. Inspired by the costly state verification literature, we assume the planner can request costly audits on the winning agent after allocation, revealing their true utility but without the ability to revoke the allocation. We design a mechanism achieving $T$-independent $\\mathcal O(K^2)$ regret in social welfare while requesting $\\mathcal O(K^3 \\log T)$ audits in expectation, where $K$ is the number of agents and $T$ is the"},"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":"2502.08412","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-02-12T13:53:21Z","cross_cats_sorted":["econ.TH"],"title_canon_sha256":"8e15967a36584f8cafc85743acfa582c838c0c421a9ebe8a0bc052b32238c326","abstract_canon_sha256":"3598de2e8cc256689bc6339a34aa6e02b94e7816828702231b332f593d217f48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:06.705213Z","signature_b64":"emUo4XM5j+upSpRpJlklfMNf6oUEGGg1wSc7uqnNvoSwZEeTUuDMuq8BZ2NdYFHUoKkLRqxSfLRWHKo9a8JoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6e57780697b2ff20f7c898b8818aee3f3f7cb1b279051aff97ea19164c4e2a1","last_reissued_at":"2026-05-28T01:04:06.704633Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:06.704633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Monetary Mechanism Design without Priors: Achieving Efficiency via Adaptive Costly Audits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"Moise Blanchard, Patrick Jaillet, Yan Dai","submitted_at":"2025-02-12T13:53:21Z","abstract_excerpt":"We study repeated resource allocation with strategic agents, where monetary transfers are disallowed and the planner has no prior information on agents' utility distributions. Inspired by the costly state verification literature, we assume the planner can request costly audits on the winning agent after allocation, revealing their true utility but without the ability to revoke the allocation. We design a mechanism achieving $T$-independent $\\mathcal O(K^2)$ regret in social welfare while requesting $\\mathcal O(K^3 \\log T)$ audits in expectation, where $K$ is the number of agents and $T$ is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08412","kind":"arxiv","version":3},"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/2502.08412/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":"2502.08412","created_at":"2026-05-28T01:04:06.704718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08412v3","created_at":"2026-05-28T01:04:06.704718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08412","created_at":"2026-05-28T01:04:06.704718+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3SXPADJPMX7","created_at":"2026-05-28T01:04:06.704718+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3SXPADJPMX7ED34","created_at":"2026-05-28T01:04:06.704718+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3SXPADJ","created_at":"2026-05-28T01:04:06.704718+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":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P","json":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P.json","graph_json":"https://pith.science/api/pith-number/Y3SXPADJPMX7ED34RGFYQGFO4P/graph.json","events_json":"https://pith.science/api/pith-number/Y3SXPADJPMX7ED34RGFYQGFO4P/events.json","paper":"https://pith.science/paper/Y3SXPADJ"},"agent_actions":{"view_html":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P","download_json":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P.json","view_paper":"https://pith.science/paper/Y3SXPADJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08412&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3SXPADJPMX7ED34RGFYQGFO4P/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3SXPADJPMX7ED34RGFYQGFO4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P/action/storage_attestation","attest_author":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P/action/author_attestation","sign_citation":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P/action/citation_signature","submit_replication":"https://pith.science/pith/Y3SXPADJPMX7ED34RGFYQGFO4P/action/replication_record"}},"created_at":"2026-05-28T01:04:06.704718+00:00","updated_at":"2026-05-28T01:04:06.704718+00:00"}