{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DQTVED2JGUQKXT4RWA6JWRQE5V","short_pith_number":"pith:DQTVED2J","schema_version":"1.0","canonical_sha256":"1c27520f493520abcf91b03c9b4604ed4aeba2dcc59424bb80237afc092c279a","source":{"kind":"arxiv","id":"1910.14472","version":1},"attestation_state":"computed","paper":{"title":"Learning Fairness in Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiechuan Jiang, Zongqing Lu","submitted_at":"2019-10-31T13:59:37Z","abstract_excerpt":"Fairness is essential for human society, contributing to stability and productivity. Similarly, fairness is also the key for many multi-agent systems. Taking fairness into multi-agent learning could help multi-agent systems become both efficient and stable. However, learning efficiency and fairness simultaneously is a complex, multi-objective, joint-policy optimization. To tackle these difficulties, we propose FEN, a novel hierarchical reinforcement learning model. We first decompose fairness for each agent and propose fair-efficient reward that each agent learns its own policy to optimize. To"},"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":"1910.14472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-31T13:59:37Z","cross_cats_sorted":["cs.AI","cs.MA","stat.ML"],"title_canon_sha256":"72a630019320f9adb0278096ae6965000139a63b4887cd2d59e1ef8ed63a8345","abstract_canon_sha256":"ae516a9c91c72d9f50bd84bd6e419b90a9232c61253c01c39c63ba7aeefa578d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:10.837775Z","signature_b64":"6J3bZwI2Erf3cqrGrBoHDpSiPgrHeGVleJUR1fREnwQZ4bIREzQv2WyiuVE4snU9apX8PNs1nNu9vvUqPVqrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c27520f493520abcf91b03c9b4604ed4aeba2dcc59424bb80237afc092c279a","last_reissued_at":"2026-07-05T00:16:10.837341Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:10.837341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Fairness in Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiechuan Jiang, Zongqing Lu","submitted_at":"2019-10-31T13:59:37Z","abstract_excerpt":"Fairness is essential for human society, contributing to stability and productivity. Similarly, fairness is also the key for many multi-agent systems. Taking fairness into multi-agent learning could help multi-agent systems become both efficient and stable. However, learning efficiency and fairness simultaneously is a complex, multi-objective, joint-policy optimization. To tackle these difficulties, we propose FEN, a novel hierarchical reinforcement learning model. We first decompose fairness for each agent and propose fair-efficient reward that each agent learns its own policy to optimize. To"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.14472","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/1910.14472/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":"1910.14472","created_at":"2026-07-05T00:16:10.837395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.14472v1","created_at":"2026-07-05T00:16:10.837395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.14472","created_at":"2026-07-05T00:16:10.837395+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQTVED2JGUQK","created_at":"2026-07-05T00:16:10.837395+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQTVED2JGUQKXT4R","created_at":"2026-07-05T00:16:10.837395+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQTVED2J","created_at":"2026-07-05T00:16:10.837395+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.14135","citing_title":"AdaFair-MARL: Enforcing Adaptive Fairness Constraints in Multi-Agent Reinforcement Learning","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V","json":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V.json","graph_json":"https://pith.science/api/pith-number/DQTVED2JGUQKXT4RWA6JWRQE5V/graph.json","events_json":"https://pith.science/api/pith-number/DQTVED2JGUQKXT4RWA6JWRQE5V/events.json","paper":"https://pith.science/paper/DQTVED2J"},"agent_actions":{"view_html":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V","download_json":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V.json","view_paper":"https://pith.science/paper/DQTVED2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.14472&json=true","fetch_graph":"https://pith.science/api/pith-number/DQTVED2JGUQKXT4RWA6JWRQE5V/graph.json","fetch_events":"https://pith.science/api/pith-number/DQTVED2JGUQKXT4RWA6JWRQE5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V/action/storage_attestation","attest_author":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V/action/author_attestation","sign_citation":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V/action/citation_signature","submit_replication":"https://pith.science/pith/DQTVED2JGUQKXT4RWA6JWRQE5V/action/replication_record"}},"created_at":"2026-07-05T00:16:10.837395+00:00","updated_at":"2026-07-05T00:16:10.837395+00:00"}