{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FIUXSPFNG5CMDZRT2TKNJQ75FX","short_pith_number":"pith:FIUXSPFN","schema_version":"1.0","canonical_sha256":"2a29793cad3744c1e633d4d4d4c3fd2dcd00814a19b5c2bc3936c8954cbcd7a8","source":{"kind":"arxiv","id":"1711.00363","version":1},"attestation_state":"computed","paper":{"title":"Servant of Many Masters: Shifting priorities in Pareto-optimal sequential decision-making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrew Critch, Stuart Russell","submitted_at":"2017-10-31T05:09:13Z","abstract_excerpt":"It is often argued that an agent making decisions on behalf of two or more principals who have different utility functions should adopt a {\\em Pareto-optimal} policy, i.e., a policy that cannot be improved upon for one agent without making sacrifices for another. A famous theorem of Harsanyi shows that, when the principals have a common prior on the outcome distributions of all policies, a Pareto-optimal policy for the agent is one that maximizes a fixed, weighted linear combination of the principals' utilities.\n  In this paper, we show that Harsanyi's theorem does not hold for principals with"},"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":"1711.00363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-31T05:09:13Z","cross_cats_sorted":[],"title_canon_sha256":"7cacd2220e1da866c5497c3f3a994c0964a8f74ca4bd52c4d443e4ea9e021bb7","abstract_canon_sha256":"b05525bd401a7fde731e0c2ef5b2eea882bd9539b2c85092aeb8d2272fdcd681"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:32.291737Z","signature_b64":"znCZ2TuQgg9sHk9BMwAFbhTiPxiq7oPyS/WCYPkYCDgPgKqz/ed2EhuDVt54WQaxx4E9Ru7kPFB5eB//QwgBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a29793cad3744c1e633d4d4d4c3fd2dcd00814a19b5c2bc3936c8954cbcd7a8","last_reissued_at":"2026-05-18T00:31:32.291083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:32.291083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Servant of Many Masters: Shifting priorities in Pareto-optimal sequential decision-making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrew Critch, Stuart Russell","submitted_at":"2017-10-31T05:09:13Z","abstract_excerpt":"It is often argued that an agent making decisions on behalf of two or more principals who have different utility functions should adopt a {\\em Pareto-optimal} policy, i.e., a policy that cannot be improved upon for one agent without making sacrifices for another. A famous theorem of Harsanyi shows that, when the principals have a common prior on the outcome distributions of all policies, a Pareto-optimal policy for the agent is one that maximizes a fixed, weighted linear combination of the principals' utilities.\n  In this paper, we show that Harsanyi's theorem does not hold for principals with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00363","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":"1711.00363","created_at":"2026-05-18T00:31:32.291189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00363v1","created_at":"2026-05-18T00:31:32.291189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00363","created_at":"2026-05-18T00:31:32.291189+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIUXSPFNG5CM","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIUXSPFNG5CMDZRT","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIUXSPFN","created_at":"2026-05-18T12:31:15.632608+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/FIUXSPFNG5CMDZRT2TKNJQ75FX","json":"https://pith.science/pith/FIUXSPFNG5CMDZRT2TKNJQ75FX.json","graph_json":"https://pith.science/api/pith-number/FIUXSPFNG5CMDZRT2TKNJQ75FX/graph.json","events_json":"https://pith.science/api/pith-number/FIUXSPFNG5CMDZRT2TKNJQ75FX/events.json","paper":"https://pith.science/paper/FIUXSPFN"},"agent_actions":{"view_html":"https://pith.science/pith/FIUXSPFNG5CMDZRT2TKNJQ75FX","download_json":"https://pith.science/pith/FIUXSPFNG5CMDZRT2TKNJQ75FX.json","view_paper":"https://pith.science/paper/FIUXSPFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00363&json=true","fetch_graph":"https://pith.science/api/pith-number/FIUXSPFNG5CMDZRT2TKNJQ75FX/graph.json","fetch_events":"https://pith.science/api/pith-number/FIUXSPFNG5CMDZRT2TKNJQ75FX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIUXSPFNG5CMDZRT2TKNJQ75FX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIUXSPFNG5CMDZRT2TKNJQ75FX/action/storage_attestation","attest_author":"https://pith.science/pith/FIUXSPFNG5CMDZRT2TKNJQ75FX/action/author_attestation","sign_citation":"https://pith.science/pith/FIUXSPFNG5CMDZRT2TKNJQ75FX/action/citation_signature","submit_replication":"https://pith.science/pith/FIUXSPFNG5CMDZRT2TKNJQ75FX/action/replication_record"}},"created_at":"2026-05-18T00:31:32.291189+00:00","updated_at":"2026-05-18T00:31:32.291189+00:00"}