{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PR6RXHH7YUAYPTVVZ7XTRSMLRA","short_pith_number":"pith:PR6RXHH7","schema_version":"1.0","canonical_sha256":"7c7d1b9cffc50187ceb5cfef38c98b880dc52d6fdb5b4860bba165d7a8d1151d","source":{"kind":"arxiv","id":"1501.06627","version":2},"attestation_state":"computed","paper":{"title":"Competitive Equilibrium with Equal Incomes for Allocation of Indivisible Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz","submitted_at":"2015-01-27T00:12:30Z","abstract_excerpt":"In AAMAS 2014, Bouveret and Lemaitre (2014) presented a hierarchy of fairness concepts for allocation of indivisible objects. Among them CEEI (Competitive Equilibrium with Equal Incomes) was the strongest. In this note, we settle the complexity of computing a discrete CEEI assignment by showing it is strongly NP-hard. We then highlight a fairness notion (CEEI-FRAC) that is even stronger than CEEI for discrete assignments, is always Pareto optimal, and can be verified in polynomial time. We also show that computing a CEEI-FRAC discrete assignment is strongly NP-hard in general but polynomial-ti"},"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":"1501.06627","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-01-27T00:12:30Z","cross_cats_sorted":[],"title_canon_sha256":"f11c26b81dc99f2b825381d5aec1cdeec27f497ad0aa76962394a865b98efc68","abstract_canon_sha256":"1a2a4e3bfbca7ae7ca142267d47ede6c517d84db1fda97222425acd1e6ef0c02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:59.893103Z","signature_b64":"fwwLAUUbF6cD7mQRxGwUy8dgtOStG/pmy50YneTWUh8iAh/XXg/NF25VaZz19Zukuh16j4ven3d3aCLtPI0ECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c7d1b9cffc50187ceb5cfef38c98b880dc52d6fdb5b4860bba165d7a8d1151d","last_reissued_at":"2026-05-18T02:03:59.892380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:59.892380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Equilibrium with Equal Incomes for Allocation of Indivisible Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Haris Aziz","submitted_at":"2015-01-27T00:12:30Z","abstract_excerpt":"In AAMAS 2014, Bouveret and Lemaitre (2014) presented a hierarchy of fairness concepts for allocation of indivisible objects. Among them CEEI (Competitive Equilibrium with Equal Incomes) was the strongest. In this note, we settle the complexity of computing a discrete CEEI assignment by showing it is strongly NP-hard. We then highlight a fairness notion (CEEI-FRAC) that is even stronger than CEEI for discrete assignments, is always Pareto optimal, and can be verified in polynomial time. We also show that computing a CEEI-FRAC discrete assignment is strongly NP-hard in general but polynomial-ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06627","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":"1501.06627","created_at":"2026-05-18T02:03:59.892495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06627v2","created_at":"2026-05-18T02:03:59.892495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06627","created_at":"2026-05-18T02:03:59.892495+00:00"},{"alias_kind":"pith_short_12","alias_value":"PR6RXHH7YUAY","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PR6RXHH7YUAYPTVV","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PR6RXHH7","created_at":"2026-05-18T12:29:37.295048+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/PR6RXHH7YUAYPTVVZ7XTRSMLRA","json":"https://pith.science/pith/PR6RXHH7YUAYPTVVZ7XTRSMLRA.json","graph_json":"https://pith.science/api/pith-number/PR6RXHH7YUAYPTVVZ7XTRSMLRA/graph.json","events_json":"https://pith.science/api/pith-number/PR6RXHH7YUAYPTVVZ7XTRSMLRA/events.json","paper":"https://pith.science/paper/PR6RXHH7"},"agent_actions":{"view_html":"https://pith.science/pith/PR6RXHH7YUAYPTVVZ7XTRSMLRA","download_json":"https://pith.science/pith/PR6RXHH7YUAYPTVVZ7XTRSMLRA.json","view_paper":"https://pith.science/paper/PR6RXHH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06627&json=true","fetch_graph":"https://pith.science/api/pith-number/PR6RXHH7YUAYPTVVZ7XTRSMLRA/graph.json","fetch_events":"https://pith.science/api/pith-number/PR6RXHH7YUAYPTVVZ7XTRSMLRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PR6RXHH7YUAYPTVVZ7XTRSMLRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PR6RXHH7YUAYPTVVZ7XTRSMLRA/action/storage_attestation","attest_author":"https://pith.science/pith/PR6RXHH7YUAYPTVVZ7XTRSMLRA/action/author_attestation","sign_citation":"https://pith.science/pith/PR6RXHH7YUAYPTVVZ7XTRSMLRA/action/citation_signature","submit_replication":"https://pith.science/pith/PR6RXHH7YUAYPTVVZ7XTRSMLRA/action/replication_record"}},"created_at":"2026-05-18T02:03:59.892495+00:00","updated_at":"2026-05-18T02:03:59.892495+00:00"}