{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MCLB3IJZ3GWMTTSLB223UNIHT7","short_pith_number":"pith:MCLB3IJZ","schema_version":"1.0","canonical_sha256":"60961da139d9acc9ce4b0eb5ba35079fde383adbc3f6fc1337095728d20fd162","source":{"kind":"arxiv","id":"2310.08881","version":4},"attestation_state":"computed","paper":{"title":"Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"\\'Eva Tardos, Giannis Fikioris, Siddhartha Banerjee","submitted_at":"2023-10-13T06:20:48Z","abstract_excerpt":"We study the allocation of shared resources over multiple rounds among competing agents, via the dynamic max-min fair (DMMF) mechanism: the good in each round is allocated to the requesting agent with the least number of allocations received to date. We show that in large markets when an agent has i.i.d. values across rounds, under mild distributional assumptions (e.g., bounded PDF function), the DMMF mechanism allows each agent to realize a $1 - o(1)$ fraction of her ideal utility -- her highest achievable utility given her nominal share of resources. This guarantee holds under arbitrary beha"},"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":"2310.08881","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-10-13T06:20:48Z","cross_cats_sorted":[],"title_canon_sha256":"2f881eb71c774dfd8d837c54bee2c51735d1877147df3570e7687708de7012dc","abstract_canon_sha256":"f2cf2a600b5b0fb4a97e0a42983e4f56e6d2afdb051ac5e6fd319762ffb75a24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:01.860159Z","signature_b64":"uGrnRMzJeOdW3R9j1LV/a+GraJvbNr0pQY0wK0Nf2Wb0I7sHEIDgz+ZKB3GxB6Q3/227KXNm+ruyGN8zJ5ImDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60961da139d9acc9ce4b0eb5ba35079fde383adbc3f6fc1337095728d20fd162","last_reissued_at":"2026-07-05T11:20:01.859677Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:01.859677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"\\'Eva Tardos, Giannis Fikioris, Siddhartha Banerjee","submitted_at":"2023-10-13T06:20:48Z","abstract_excerpt":"We study the allocation of shared resources over multiple rounds among competing agents, via the dynamic max-min fair (DMMF) mechanism: the good in each round is allocated to the requesting agent with the least number of allocations received to date. We show that in large markets when an agent has i.i.d. values across rounds, under mild distributional assumptions (e.g., bounded PDF function), the DMMF mechanism allows each agent to realize a $1 - o(1)$ fraction of her ideal utility -- her highest achievable utility given her nominal share of resources. This guarantee holds under arbitrary beha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.08881","kind":"arxiv","version":4},"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/2310.08881/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":"2310.08881","created_at":"2026-07-05T11:20:01.859738+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.08881v4","created_at":"2026-07-05T11:20:01.859738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.08881","created_at":"2026-07-05T11:20:01.859738+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCLB3IJZ3GWM","created_at":"2026-07-05T11:20:01.859738+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCLB3IJZ3GWMTTSL","created_at":"2026-07-05T11:20:01.859738+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCLB3IJZ","created_at":"2026-07-05T11:20:01.859738+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30776","citing_title":"Optimal Auction Design for Constrained Buyers","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7","json":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7.json","graph_json":"https://pith.science/api/pith-number/MCLB3IJZ3GWMTTSLB223UNIHT7/graph.json","events_json":"https://pith.science/api/pith-number/MCLB3IJZ3GWMTTSLB223UNIHT7/events.json","paper":"https://pith.science/paper/MCLB3IJZ"},"agent_actions":{"view_html":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7","download_json":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7.json","view_paper":"https://pith.science/paper/MCLB3IJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.08881&json=true","fetch_graph":"https://pith.science/api/pith-number/MCLB3IJZ3GWMTTSLB223UNIHT7/graph.json","fetch_events":"https://pith.science/api/pith-number/MCLB3IJZ3GWMTTSLB223UNIHT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7/action/storage_attestation","attest_author":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7/action/author_attestation","sign_citation":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7/action/citation_signature","submit_replication":"https://pith.science/pith/MCLB3IJZ3GWMTTSLB223UNIHT7/action/replication_record"}},"created_at":"2026-07-05T11:20:01.859738+00:00","updated_at":"2026-07-05T11:20:01.859738+00:00"}