{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EWKNO45CGN5JFJATSTJCWGD363","short_pith_number":"pith:EWKNO45C","schema_version":"1.0","canonical_sha256":"2594d773a2337a92a41394d22b187bf6d63de8b7dd8e0daa7beab0545fa2e9b0","source":{"kind":"arxiv","id":"1202.4302","version":1},"attestation_state":"computed","paper":{"title":"Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Christoph D\\\"urr, Johanne Cohen, Nguyen Kim Thang","submitted_at":"2012-02-20T12:25:32Z","abstract_excerpt":"We study coordination mechanisms for Scheduling Games (with unrelated machines). In these games, each job represents a player, who needs to choose a machine for its execution, and intends to complete earliest possible. Our goal is to design scheduling policies that always admit a pure Nash equilibrium and guarantee a small price of anarchy for the l_k-norm social cost --- the objective balances overall quality of service and fairness. We consider policies with different amount of knowledge about jobs: non-clairvoyant, strongly-local and local. The analysis relies on the smooth argument togethe"},"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":"1202.4302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-02-20T12:25:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"48c4821620ce47b4e9ff1a92b7fa632c59bd01a141beecd969f8efaf64baea71","abstract_canon_sha256":"178cac34ec1b7a71e1dce33c3f01d28e4fb1fb99964f84429d2c7691065c719d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:51.825139Z","signature_b64":"ls8BZq6zpE0sSxDtHh84SAdp3XMvQc/FFk+xi1yAsyhpcRHeXn7yph4jOVl1LxXzOAZjImUHXVzqjlJfcSBBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2594d773a2337a92a41394d22b187bf6d63de8b7dd8e0daa7beab0545fa2e9b0","last_reissued_at":"2026-05-18T04:01:51.824474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:51.824474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Christoph D\\\"urr, Johanne Cohen, Nguyen Kim Thang","submitted_at":"2012-02-20T12:25:32Z","abstract_excerpt":"We study coordination mechanisms for Scheduling Games (with unrelated machines). In these games, each job represents a player, who needs to choose a machine for its execution, and intends to complete earliest possible. Our goal is to design scheduling policies that always admit a pure Nash equilibrium and guarantee a small price of anarchy for the l_k-norm social cost --- the objective balances overall quality of service and fairness. We consider policies with different amount of knowledge about jobs: non-clairvoyant, strongly-local and local. The analysis relies on the smooth argument togethe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4302","kind":"arxiv","version":1},"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":"1202.4302","created_at":"2026-05-18T04:01:51.824579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4302v1","created_at":"2026-05-18T04:01:51.824579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4302","created_at":"2026-05-18T04:01:51.824579+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWKNO45CGN5J","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWKNO45CGN5JFJAT","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWKNO45C","created_at":"2026-05-18T12:27:04.183437+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/EWKNO45CGN5JFJATSTJCWGD363","json":"https://pith.science/pith/EWKNO45CGN5JFJATSTJCWGD363.json","graph_json":"https://pith.science/api/pith-number/EWKNO45CGN5JFJATSTJCWGD363/graph.json","events_json":"https://pith.science/api/pith-number/EWKNO45CGN5JFJATSTJCWGD363/events.json","paper":"https://pith.science/paper/EWKNO45C"},"agent_actions":{"view_html":"https://pith.science/pith/EWKNO45CGN5JFJATSTJCWGD363","download_json":"https://pith.science/pith/EWKNO45CGN5JFJATSTJCWGD363.json","view_paper":"https://pith.science/paper/EWKNO45C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4302&json=true","fetch_graph":"https://pith.science/api/pith-number/EWKNO45CGN5JFJATSTJCWGD363/graph.json","fetch_events":"https://pith.science/api/pith-number/EWKNO45CGN5JFJATSTJCWGD363/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWKNO45CGN5JFJATSTJCWGD363/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWKNO45CGN5JFJATSTJCWGD363/action/storage_attestation","attest_author":"https://pith.science/pith/EWKNO45CGN5JFJATSTJCWGD363/action/author_attestation","sign_citation":"https://pith.science/pith/EWKNO45CGN5JFJATSTJCWGD363/action/citation_signature","submit_replication":"https://pith.science/pith/EWKNO45CGN5JFJATSTJCWGD363/action/replication_record"}},"created_at":"2026-05-18T04:01:51.824579+00:00","updated_at":"2026-05-18T04:01:51.824579+00:00"}