{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KKW7RLSNMISOYUQN3ME5SE3RSH","short_pith_number":"pith:KKW7RLSN","schema_version":"1.0","canonical_sha256":"52adf8ae4d6224ec520ddb09d9137191ec2f79ea901a954b2e6706a6de9278cb","source":{"kind":"arxiv","id":"2502.04281","version":1},"attestation_state":"computed","paper":{"title":"DECAF: Learning to be Fair in Multi-agent Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","cs.MA"],"primary_cat":"cs.LG","authors_text":"Ashwin Kumar, William Yeoh","submitted_at":"2025-02-06T18:29:11Z","abstract_excerpt":"A wide variety of resource allocation problems operate under resource constraints that are managed by a central arbitrator, with agents who evaluate and communicate preferences over these resources. We formulate this broad class of problems as Distributed Evaluation, Centralized Allocation (DECA) problems and propose methods to learn fair and efficient policies in centralized resource allocation. Our methods are applied to learning long-term fairness in a novel and general framework for fairness in multi-agent systems. We show three different methods based on Double Deep Q-Learning: (1) A join"},"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.04281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T18:29:11Z","cross_cats_sorted":["cs.CY","cs.MA"],"title_canon_sha256":"5ea5bb015c92c253c3c4919d4370cc0c818d2986d2d6847a943f4eb6c8ac67b4","abstract_canon_sha256":"1ebd45944c2cfe5a4588cfcf7158367bdd80e4711fce78ee71babd5f9127bca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:36.082972Z","signature_b64":"2dLvVQBFm3GCgtUX7pRrnDFC1hb1sHDnA/ZMQjM6BxdIVsGyQ/fr6XBavATg8Q7qwVY7eINHxHEJLWdGQUZaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52adf8ae4d6224ec520ddb09d9137191ec2f79ea901a954b2e6706a6de9278cb","last_reissued_at":"2026-07-05T10:10:36.082566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:36.082566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DECAF: Learning to be Fair in Multi-agent Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","cs.MA"],"primary_cat":"cs.LG","authors_text":"Ashwin Kumar, William Yeoh","submitted_at":"2025-02-06T18:29:11Z","abstract_excerpt":"A wide variety of resource allocation problems operate under resource constraints that are managed by a central arbitrator, with agents who evaluate and communicate preferences over these resources. We formulate this broad class of problems as Distributed Evaluation, Centralized Allocation (DECA) problems and propose methods to learn fair and efficient policies in centralized resource allocation. Our methods are applied to learning long-term fairness in a novel and general framework for fairness in multi-agent systems. We show three different methods based on Double Deep Q-Learning: (1) A join"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04281","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/2502.04281/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.04281","created_at":"2026-07-05T10:10:36.082618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.04281v1","created_at":"2026-07-05T10:10:36.082618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04281","created_at":"2026-07-05T10:10:36.082618+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKW7RLSNMISO","created_at":"2026-07-05T10:10:36.082618+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKW7RLSNMISOYUQN","created_at":"2026-07-05T10:10:36.082618+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKW7RLSN","created_at":"2026-07-05T10:10:36.082618+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/KKW7RLSNMISOYUQN3ME5SE3RSH","json":"https://pith.science/pith/KKW7RLSNMISOYUQN3ME5SE3RSH.json","graph_json":"https://pith.science/api/pith-number/KKW7RLSNMISOYUQN3ME5SE3RSH/graph.json","events_json":"https://pith.science/api/pith-number/KKW7RLSNMISOYUQN3ME5SE3RSH/events.json","paper":"https://pith.science/paper/KKW7RLSN"},"agent_actions":{"view_html":"https://pith.science/pith/KKW7RLSNMISOYUQN3ME5SE3RSH","download_json":"https://pith.science/pith/KKW7RLSNMISOYUQN3ME5SE3RSH.json","view_paper":"https://pith.science/paper/KKW7RLSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.04281&json=true","fetch_graph":"https://pith.science/api/pith-number/KKW7RLSNMISOYUQN3ME5SE3RSH/graph.json","fetch_events":"https://pith.science/api/pith-number/KKW7RLSNMISOYUQN3ME5SE3RSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKW7RLSNMISOYUQN3ME5SE3RSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKW7RLSNMISOYUQN3ME5SE3RSH/action/storage_attestation","attest_author":"https://pith.science/pith/KKW7RLSNMISOYUQN3ME5SE3RSH/action/author_attestation","sign_citation":"https://pith.science/pith/KKW7RLSNMISOYUQN3ME5SE3RSH/action/citation_signature","submit_replication":"https://pith.science/pith/KKW7RLSNMISOYUQN3ME5SE3RSH/action/replication_record"}},"created_at":"2026-07-05T10:10:36.082618+00:00","updated_at":"2026-07-05T10:10:36.082618+00:00"}