{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6AP5TIIVDRRRNBFMF27AH32UEQ","short_pith_number":"pith:6AP5TIIV","schema_version":"1.0","canonical_sha256":"f01fd9a1151c631684ac2ebe03ef542410cfd4960133b7417388a2d2dedd84e1","source":{"kind":"arxiv","id":"1507.07064","version":2},"attestation_state":"computed","paper":{"title":"Strategyproof Quota Mechanisms for Multiple Assignment Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hadi Hosseini, Kate Larson","submitted_at":"2015-07-25T03:41:43Z","abstract_excerpt":"We study the problem of allocating multiple objects to agents without transferable utilities, where each agent may receive more than one object according to a quota. Under lexicographic preferences, we characterize the set of strategyproof, non-bossy, and neutral quota mechanisms and show that under a mild Pareto efficiency condition, serial dictatorship quota mechanisms are the only mechanisms satisfying these properties. Dropping the neutrality requirement, this class of quota mechanisms further expands to sequential dictatorship quota mechanisms. We then extend quota mechanisms to randomize"},"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":"1507.07064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-07-25T03:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"80cacf3c39b42ba2a6ff2d150ba6d3e4aa7512cfb0b7ca26c681a8be065c8cfb","abstract_canon_sha256":"3c207379682556d8cc14c8415fec730b7e74678b42428a19de8dda09b18712e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:48.202787Z","signature_b64":"lfoFlE7fRWFVlOA1OqUEDMKJyoTEporzUB54NmU0SDIE15e/r7HlBiK+PeFnF3oHU7L1cWcRbZNKp81iPtuCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f01fd9a1151c631684ac2ebe03ef542410cfd4960133b7417388a2d2dedd84e1","last_reissued_at":"2026-05-18T00:54:48.202364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:48.202364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strategyproof Quota Mechanisms for Multiple Assignment Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hadi Hosseini, Kate Larson","submitted_at":"2015-07-25T03:41:43Z","abstract_excerpt":"We study the problem of allocating multiple objects to agents without transferable utilities, where each agent may receive more than one object according to a quota. Under lexicographic preferences, we characterize the set of strategyproof, non-bossy, and neutral quota mechanisms and show that under a mild Pareto efficiency condition, serial dictatorship quota mechanisms are the only mechanisms satisfying these properties. Dropping the neutrality requirement, this class of quota mechanisms further expands to sequential dictatorship quota mechanisms. We then extend quota mechanisms to randomize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07064","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":"1507.07064","created_at":"2026-05-18T00:54:48.202424+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07064v2","created_at":"2026-05-18T00:54:48.202424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07064","created_at":"2026-05-18T00:54:48.202424+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AP5TIIVDRRR","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AP5TIIVDRRRNBFM","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AP5TIIV","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11131","citing_title":"On Truthful Mechanisms without Pareto-efficiency: Characterizations and Fairness","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ","json":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ.json","graph_json":"https://pith.science/api/pith-number/6AP5TIIVDRRRNBFMF27AH32UEQ/graph.json","events_json":"https://pith.science/api/pith-number/6AP5TIIVDRRRNBFMF27AH32UEQ/events.json","paper":"https://pith.science/paper/6AP5TIIV"},"agent_actions":{"view_html":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ","download_json":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ.json","view_paper":"https://pith.science/paper/6AP5TIIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07064&json=true","fetch_graph":"https://pith.science/api/pith-number/6AP5TIIVDRRRNBFMF27AH32UEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6AP5TIIVDRRRNBFMF27AH32UEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ/action/storage_attestation","attest_author":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ/action/author_attestation","sign_citation":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ/action/citation_signature","submit_replication":"https://pith.science/pith/6AP5TIIVDRRRNBFMF27AH32UEQ/action/replication_record"}},"created_at":"2026-05-18T00:54:48.202424+00:00","updated_at":"2026-05-18T00:54:48.202424+00:00"}