{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:66GNTGJJA5YL4WVPKXOWRXC2V2","short_pith_number":"pith:66GNTGJJ","schema_version":"1.0","canonical_sha256":"f78cd999290770be5aaf55dd68dc5aae99cce100a6ecadd3c6b132af144d2354","source":{"kind":"arxiv","id":"1401.6523","version":1},"attestation_state":"computed","paper":{"title":"Strategic aspects of the probabilistic serial rule for the allocation of goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Nick Mattei, Nina Narodytska, Serge Gaspers, Toby Walsh","submitted_at":"2014-01-25T12:11:09Z","abstract_excerpt":"The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its superior fairness and welfare properties. However, PS is not immune to manipulative behaviour by the agents. We examine computational and non-computational aspects of strategising under the PS rule. Firstly, we study the computational complexity of an agent manipulating the PS rule. We present polynomial-time algorithms for optimal manipulation. Secondly, we show that expected utility best responses can cycle. Thirdly, we examine the existence and computation of"},"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.6523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-25T12:11:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8102f95d35f1c520a7ec2c674d48784596b22ecfe9a82871b2ad3b953654d3d3","abstract_canon_sha256":"785a64b598b033aadba601f818bf3416edf541ff319e2d9ca4adf5cab7a1e517"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:01.480544Z","signature_b64":"01sQg07FRFraayhfpOiwaEPUHhg1ahxZFssDNYoMCjcQtx+2bRj7bm9TpUMJFySPOLW6ajyHgQGU2QeWWkuwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f78cd999290770be5aaf55dd68dc5aae99cce100a6ecadd3c6b132af144d2354","last_reissued_at":"2026-05-18T03:01:01.479792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:01.479792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strategic aspects of the probabilistic serial rule for the allocation of goods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Nick Mattei, Nina Narodytska, Serge Gaspers, Toby Walsh","submitted_at":"2014-01-25T12:11:09Z","abstract_excerpt":"The probabilistic serial (PS) rule is one of the most prominent randomized rules for the assignment problem. It is well-known for its superior fairness and welfare properties. However, PS is not immune to manipulative behaviour by the agents. We examine computational and non-computational aspects of strategising under the PS rule. Firstly, we study the computational complexity of an agent manipulating the PS rule. We present polynomial-time algorithms for optimal manipulation. Secondly, we show that expected utility best responses can cycle. Thirdly, we examine the existence and computation of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6523","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.6523","created_at":"2026-05-18T03:01:01.479907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6523v1","created_at":"2026-05-18T03:01:01.479907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6523","created_at":"2026-05-18T03:01:01.479907+00:00"},{"alias_kind":"pith_short_12","alias_value":"66GNTGJJA5YL","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"66GNTGJJA5YL4WVP","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"66GNTGJJ","created_at":"2026-05-18T12:28:16.859392+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/66GNTGJJA5YL4WVPKXOWRXC2V2","json":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2.json","graph_json":"https://pith.science/api/pith-number/66GNTGJJA5YL4WVPKXOWRXC2V2/graph.json","events_json":"https://pith.science/api/pith-number/66GNTGJJA5YL4WVPKXOWRXC2V2/events.json","paper":"https://pith.science/paper/66GNTGJJ"},"agent_actions":{"view_html":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2","download_json":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2.json","view_paper":"https://pith.science/paper/66GNTGJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6523&json=true","fetch_graph":"https://pith.science/api/pith-number/66GNTGJJA5YL4WVPKXOWRXC2V2/graph.json","fetch_events":"https://pith.science/api/pith-number/66GNTGJJA5YL4WVPKXOWRXC2V2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/action/storage_attestation","attest_author":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/action/author_attestation","sign_citation":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/action/citation_signature","submit_replication":"https://pith.science/pith/66GNTGJJA5YL4WVPKXOWRXC2V2/action/replication_record"}},"created_at":"2026-05-18T03:01:01.479907+00:00","updated_at":"2026-05-18T03:01:01.479907+00:00"}