{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VLDB7WCEOBN33OTLLTF36QHC62","short_pith_number":"pith:VLDB7WCE","schema_version":"1.0","canonical_sha256":"aac61fd844705bbdba6b5ccbbf40e2f6b32ebc1f6f8a7213ac7756b7d9870732","source":{"kind":"arxiv","id":"1802.05294","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Fair Division Problem with General Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bo Li, Wenyang Li, Yingkai Li","submitted_at":"2018-02-14T19:25:24Z","abstract_excerpt":"In this paper, we focus on how to dynamically allocate a divisible resource fairly among n players who arrive and depart over time. The players may have general heterogeneous valuations over the resource. It is known that the exact envy-free and proportional allocations may not exist in the dynamic setting [Walsh, 2011]. Thus, we will study to what extent we can guarantee the fairness in the dynamic setting. We first design two algorithms which are O(log n)-proportional and O(n)-envy-free for the setting with general valuations, and by constructing the adversary instances such that all dynamic"},"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":"1802.05294","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-02-14T19:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"feb10092d71ffdf17900db0cca8ed0fef35e9edeefa6057e4a46a167a77d07e7","abstract_canon_sha256":"fa1f8c99da3cc90426b384f2a30ec0b9ad9188788f306795d9dab5d54156b46a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:09.099400Z","signature_b64":"3puQLpBfIdL4Uo3Upe9lrx8MWeaOUM1Kb/LxAQMy0jm/fWN7dQPzuOb2yWehzCkJT7/KRhydVGvbYBdPVQRIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac61fd844705bbdba6b5ccbbf40e2f6b32ebc1f6f8a7213ac7756b7d9870732","last_reissued_at":"2026-05-18T00:18:09.098848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:09.098848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Fair Division Problem with General Valuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bo Li, Wenyang Li, Yingkai Li","submitted_at":"2018-02-14T19:25:24Z","abstract_excerpt":"In this paper, we focus on how to dynamically allocate a divisible resource fairly among n players who arrive and depart over time. The players may have general heterogeneous valuations over the resource. It is known that the exact envy-free and proportional allocations may not exist in the dynamic setting [Walsh, 2011]. Thus, we will study to what extent we can guarantee the fairness in the dynamic setting. We first design two algorithms which are O(log n)-proportional and O(n)-envy-free for the setting with general valuations, and by constructing the adversary instances such that all dynamic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05294","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":"1802.05294","created_at":"2026-05-18T00:18:09.098961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05294v2","created_at":"2026-05-18T00:18:09.098961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05294","created_at":"2026-05-18T00:18:09.098961+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLDB7WCEOBN3","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLDB7WCEOBN33OTL","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLDB7WCE","created_at":"2026-05-18T12:32:59.047623+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/VLDB7WCEOBN33OTLLTF36QHC62","json":"https://pith.science/pith/VLDB7WCEOBN33OTLLTF36QHC62.json","graph_json":"https://pith.science/api/pith-number/VLDB7WCEOBN33OTLLTF36QHC62/graph.json","events_json":"https://pith.science/api/pith-number/VLDB7WCEOBN33OTLLTF36QHC62/events.json","paper":"https://pith.science/paper/VLDB7WCE"},"agent_actions":{"view_html":"https://pith.science/pith/VLDB7WCEOBN33OTLLTF36QHC62","download_json":"https://pith.science/pith/VLDB7WCEOBN33OTLLTF36QHC62.json","view_paper":"https://pith.science/paper/VLDB7WCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05294&json=true","fetch_graph":"https://pith.science/api/pith-number/VLDB7WCEOBN33OTLLTF36QHC62/graph.json","fetch_events":"https://pith.science/api/pith-number/VLDB7WCEOBN33OTLLTF36QHC62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLDB7WCEOBN33OTLLTF36QHC62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLDB7WCEOBN33OTLLTF36QHC62/action/storage_attestation","attest_author":"https://pith.science/pith/VLDB7WCEOBN33OTLLTF36QHC62/action/author_attestation","sign_citation":"https://pith.science/pith/VLDB7WCEOBN33OTLLTF36QHC62/action/citation_signature","submit_replication":"https://pith.science/pith/VLDB7WCEOBN33OTLLTF36QHC62/action/replication_record"}},"created_at":"2026-05-18T00:18:09.098961+00:00","updated_at":"2026-05-18T00:18:09.098961+00:00"}