{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2A3NDTC2GYTO3HCUVECNWMUVD4","short_pith_number":"pith:2A3NDTC2","schema_version":"1.0","canonical_sha256":"d036d1cc5a3626ed9c54a904db32951f3a6be7dd0999398cb779dfc7e0cceeae","source":{"kind":"arxiv","id":"1003.4307","version":1},"attestation_state":"computed","paper":{"title":"Bottleneck Routing Games with Low Price of Anarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Costas Busch, Rajgopal Kannan","submitted_at":"2010-03-22T23:31:55Z","abstract_excerpt":"We study {\\em bottleneck routing games} where the social cost is determined by the worst congestion on any edge in the network. In the literature, bottleneck games assume player utility costs determined by the worst congested edge in their paths. However, the Nash equilibria of such games are inefficient since the price of anarchy can be very high and proportional to the size of the network. In order to obtain smaller price of anarchy we introduce {\\em exponential bottleneck games} where the utility costs of the players are exponential functions of their congestions. We find that exponential b"},"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":"1003.4307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2010-03-22T23:31:55Z","cross_cats_sorted":[],"title_canon_sha256":"fd89420912b7638cc7e44db3f299666122c9c252cd734b7d1c67cceb2dbf50ca","abstract_canon_sha256":"c0172110853e8845d01d8f8b39d639fb5d81885245748965df273b9aa5cffa44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:08:24.352127Z","signature_b64":"rxrD3+VMIp96gMZQHO0ewXdI34jnaJPnOQad4QjBHgr7/LGYVKZLzEiXgAg37HY3EG1I89Qn1s/iYj6Rf5ANCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d036d1cc5a3626ed9c54a904db32951f3a6be7dd0999398cb779dfc7e0cceeae","last_reissued_at":"2026-05-18T02:08:24.351329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:08:24.351329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bottleneck Routing Games with Low Price of Anarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Costas Busch, Rajgopal Kannan","submitted_at":"2010-03-22T23:31:55Z","abstract_excerpt":"We study {\\em bottleneck routing games} where the social cost is determined by the worst congestion on any edge in the network. In the literature, bottleneck games assume player utility costs determined by the worst congested edge in their paths. However, the Nash equilibria of such games are inefficient since the price of anarchy can be very high and proportional to the size of the network. In order to obtain smaller price of anarchy we introduce {\\em exponential bottleneck games} where the utility costs of the players are exponential functions of their congestions. We find that exponential b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.4307","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":"1003.4307","created_at":"2026-05-18T02:08:24.351465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.4307v1","created_at":"2026-05-18T02:08:24.351465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4307","created_at":"2026-05-18T02:08:24.351465+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A3NDTC2GYTO","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A3NDTC2GYTO3HCU","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A3NDTC2","created_at":"2026-05-18T12:26:03.138858+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/2A3NDTC2GYTO3HCUVECNWMUVD4","json":"https://pith.science/pith/2A3NDTC2GYTO3HCUVECNWMUVD4.json","graph_json":"https://pith.science/api/pith-number/2A3NDTC2GYTO3HCUVECNWMUVD4/graph.json","events_json":"https://pith.science/api/pith-number/2A3NDTC2GYTO3HCUVECNWMUVD4/events.json","paper":"https://pith.science/paper/2A3NDTC2"},"agent_actions":{"view_html":"https://pith.science/pith/2A3NDTC2GYTO3HCUVECNWMUVD4","download_json":"https://pith.science/pith/2A3NDTC2GYTO3HCUVECNWMUVD4.json","view_paper":"https://pith.science/paper/2A3NDTC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.4307&json=true","fetch_graph":"https://pith.science/api/pith-number/2A3NDTC2GYTO3HCUVECNWMUVD4/graph.json","fetch_events":"https://pith.science/api/pith-number/2A3NDTC2GYTO3HCUVECNWMUVD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A3NDTC2GYTO3HCUVECNWMUVD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A3NDTC2GYTO3HCUVECNWMUVD4/action/storage_attestation","attest_author":"https://pith.science/pith/2A3NDTC2GYTO3HCUVECNWMUVD4/action/author_attestation","sign_citation":"https://pith.science/pith/2A3NDTC2GYTO3HCUVECNWMUVD4/action/citation_signature","submit_replication":"https://pith.science/pith/2A3NDTC2GYTO3HCUVECNWMUVD4/action/replication_record"}},"created_at":"2026-05-18T02:08:24.351465+00:00","updated_at":"2026-05-18T02:08:24.351465+00:00"}