{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QY3HTOSJCBFWCMVPUP6QCXII4P","short_pith_number":"pith:QY3HTOSJ","schema_version":"1.0","canonical_sha256":"863679ba49104b6132afa3fd015d08e3e7528214336e5ef4084976f8dabcfc98","source":{"kind":"arxiv","id":"2406.00147","version":3},"attestation_state":"computed","paper":{"title":"Fair Allocation in Dynamic Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Alireza Fallah, Annie Ulichney, Michael I. Jordan","submitted_at":"2024-05-31T19:26:05Z","abstract_excerpt":"We consider a dynamic mechanism design problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group. We begin by studying the static case ($T=1$) and establish that the optimal mechanism involves two types of subsidization: one that increases the overall probability of allocation to all buyers, and another that favors the groups which otherwise have a lower probability of winn"},"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":"2406.00147","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-05-31T19:26:05Z","cross_cats_sorted":["cs.LG","econ.TH"],"title_canon_sha256":"28ec20d1ffc077736cab37fb8a33d4fe93007b9ec5da5c9d015d81cf190c8944","abstract_canon_sha256":"cfe1046eb9376591044604ceca8e75095ce18e8917c4c516f80612aa68b7c79d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:10.902606Z","signature_b64":"sVaE33qnjtX6Wjd4Fi1LXZpGPYnktbRUA7dY0/O0zCjYONjrlF0rfgLmM1/gsVHI3FRMIqRVpBnwUkcs/jsrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"863679ba49104b6132afa3fd015d08e3e7528214336e5ef4084976f8dabcfc98","last_reissued_at":"2026-07-05T09:15:10.902122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:10.902122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Allocation in Dynamic Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Alireza Fallah, Annie Ulichney, Michael I. Jordan","submitted_at":"2024-05-31T19:26:05Z","abstract_excerpt":"We consider a dynamic mechanism design problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group. We begin by studying the static case ($T=1$) and establish that the optimal mechanism involves two types of subsidization: one that increases the overall probability of allocation to all buyers, and another that favors the groups which otherwise have a lower probability of winn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.00147","kind":"arxiv","version":3},"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/2406.00147/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":"2406.00147","created_at":"2026-07-05T09:15:10.902182+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.00147v3","created_at":"2026-07-05T09:15:10.902182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.00147","created_at":"2026-07-05T09:15:10.902182+00:00"},{"alias_kind":"pith_short_12","alias_value":"QY3HTOSJCBFW","created_at":"2026-07-05T09:15:10.902182+00:00"},{"alias_kind":"pith_short_16","alias_value":"QY3HTOSJCBFWCMVP","created_at":"2026-07-05T09:15:10.902182+00:00"},{"alias_kind":"pith_short_8","alias_value":"QY3HTOSJ","created_at":"2026-07-05T09:15:10.902182+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/QY3HTOSJCBFWCMVPUP6QCXII4P","json":"https://pith.science/pith/QY3HTOSJCBFWCMVPUP6QCXII4P.json","graph_json":"https://pith.science/api/pith-number/QY3HTOSJCBFWCMVPUP6QCXII4P/graph.json","events_json":"https://pith.science/api/pith-number/QY3HTOSJCBFWCMVPUP6QCXII4P/events.json","paper":"https://pith.science/paper/QY3HTOSJ"},"agent_actions":{"view_html":"https://pith.science/pith/QY3HTOSJCBFWCMVPUP6QCXII4P","download_json":"https://pith.science/pith/QY3HTOSJCBFWCMVPUP6QCXII4P.json","view_paper":"https://pith.science/paper/QY3HTOSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.00147&json=true","fetch_graph":"https://pith.science/api/pith-number/QY3HTOSJCBFWCMVPUP6QCXII4P/graph.json","fetch_events":"https://pith.science/api/pith-number/QY3HTOSJCBFWCMVPUP6QCXII4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QY3HTOSJCBFWCMVPUP6QCXII4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QY3HTOSJCBFWCMVPUP6QCXII4P/action/storage_attestation","attest_author":"https://pith.science/pith/QY3HTOSJCBFWCMVPUP6QCXII4P/action/author_attestation","sign_citation":"https://pith.science/pith/QY3HTOSJCBFWCMVPUP6QCXII4P/action/citation_signature","submit_replication":"https://pith.science/pith/QY3HTOSJCBFWCMVPUP6QCXII4P/action/replication_record"}},"created_at":"2026-07-05T09:15:10.902182+00:00","updated_at":"2026-07-05T09:15:10.902182+00:00"}