{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MG6DXZ5OJZQT222BDZCTNXT4GW","short_pith_number":"pith:MG6DXZ5O","schema_version":"1.0","canonical_sha256":"61bc3be7ae4e613d6b411e4536de7c3598515f80e21f8f5eb5f0d377b36283b9","source":{"kind":"arxiv","id":"1509.07455","version":3},"attestation_state":"computed","paper":{"title":"The VCG Mechanism for Bayesian Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Maria Kyropoulou, Yiannis Giannakopoulos","submitted_at":"2015-09-24T18:01:56Z","abstract_excerpt":"We study the problem of scheduling $m$ tasks to $n$ selfish, unrelated machines in order to minimize the makespan, where the execution times are independent random variables, identical across machines. We show that the VCG mechanism, which myopically allocates each task to its best machine, achieves an approximation ratio of $O\\left(\\frac{\\ln n}{\\ln \\ln n}\\right)$. This improves significantly on the previously best known bound of $O\\left(\\frac{m}{n}\\right)$ for prior-independent mechanisms, given by Chawla et al. [STOC'13] under the additional assumption of Monotone Hazard Rate (MHR) distribut"},"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":"1509.07455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-09-24T18:01:56Z","cross_cats_sorted":[],"title_canon_sha256":"bf899f52b323beafea571438215725e6af047c8384310881d4572274edc3011d","abstract_canon_sha256":"929f0562cdc16c513bfb2fc21f05d64daf0e7a0f09e0771a34ae7dd8763f0a44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:43.261162Z","signature_b64":"pA6G94SiQnrwUnFdRSJPpDO50TGkWYuUFscchph+D610VaInZVA8zr3yU34lj6xvZkpRga3pJCjSeYYCKvEEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61bc3be7ae4e613d6b411e4536de7c3598515f80e21f8f5eb5f0d377b36283b9","last_reissued_at":"2026-05-18T00:47:43.260591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:43.260591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The VCG Mechanism for Bayesian Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Maria Kyropoulou, Yiannis Giannakopoulos","submitted_at":"2015-09-24T18:01:56Z","abstract_excerpt":"We study the problem of scheduling $m$ tasks to $n$ selfish, unrelated machines in order to minimize the makespan, where the execution times are independent random variables, identical across machines. We show that the VCG mechanism, which myopically allocates each task to its best machine, achieves an approximation ratio of $O\\left(\\frac{\\ln n}{\\ln \\ln n}\\right)$. This improves significantly on the previously best known bound of $O\\left(\\frac{m}{n}\\right)$ for prior-independent mechanisms, given by Chawla et al. [STOC'13] under the additional assumption of Monotone Hazard Rate (MHR) distribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07455","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":""},"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":"1509.07455","created_at":"2026-05-18T00:47:43.260678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07455v3","created_at":"2026-05-18T00:47:43.260678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07455","created_at":"2026-05-18T00:47:43.260678+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG6DXZ5OJZQT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG6DXZ5OJZQT222B","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG6DXZ5O","created_at":"2026-05-18T12:29:32.376354+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/MG6DXZ5OJZQT222BDZCTNXT4GW","json":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW.json","graph_json":"https://pith.science/api/pith-number/MG6DXZ5OJZQT222BDZCTNXT4GW/graph.json","events_json":"https://pith.science/api/pith-number/MG6DXZ5OJZQT222BDZCTNXT4GW/events.json","paper":"https://pith.science/paper/MG6DXZ5O"},"agent_actions":{"view_html":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW","download_json":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW.json","view_paper":"https://pith.science/paper/MG6DXZ5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07455&json=true","fetch_graph":"https://pith.science/api/pith-number/MG6DXZ5OJZQT222BDZCTNXT4GW/graph.json","fetch_events":"https://pith.science/api/pith-number/MG6DXZ5OJZQT222BDZCTNXT4GW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/action/storage_attestation","attest_author":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/action/author_attestation","sign_citation":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/action/citation_signature","submit_replication":"https://pith.science/pith/MG6DXZ5OJZQT222BDZCTNXT4GW/action/replication_record"}},"created_at":"2026-05-18T00:47:43.260678+00:00","updated_at":"2026-05-18T00:47:43.260678+00:00"}