{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EPRLA6O7WP5TGVVZCPCGA7PSRH","short_pith_number":"pith:EPRLA6O7","schema_version":"1.0","canonical_sha256":"23e2b079dfb3fb3356b913c4607df289df738f747e1415a403e848badca70dab","source":{"kind":"arxiv","id":"1804.07107","version":1},"attestation_state":"computed","paper":{"title":"The Curse of Ties in Congestion Games with Limited Lookahead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Carla Groenland, Guido Sch\\\"afer","submitted_at":"2018-04-19T12:20:52Z","abstract_excerpt":"We introduce a novel framework to model limited lookahead in congestion games. Intuitively, the players enter the game sequentially and choose an optimal action under the assumption that the $k-1$ subsequent players play subgame-perfectly. Our model naturally interpolates between outcomes of greedy best-response ($k=1$) and subgame-perfect outcomes ($k=n$, the number of players). We study the impact of limited lookahead (parameterized by $k$) on the stability and inefficiency of the resulting outcomes. As our results reveal, increased lookahead does not necessarily lead to better outcomes; in "},"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":"1804.07107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-04-19T12:20:52Z","cross_cats_sorted":[],"title_canon_sha256":"7d327a4c0e997f6809e26dc8ceb2aefd96d1c1f7e9dc91975183ae72201bd169","abstract_canon_sha256":"2ca01fc4a33b2f6c4399a2c8cab5bf85b86a961d4f8eda2cf715735243f029da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:01.466596Z","signature_b64":"MyoQpzGR3kXAf+nC37hc4RlNDz4+KLE0xR9ZgLr37Qhaw6eV0FlqqnTqedej8F4/BbK++Ikk5x5au6JHk4oVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23e2b079dfb3fb3356b913c4607df289df738f747e1415a403e848badca70dab","last_reissued_at":"2026-05-18T00:18:01.465799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:01.465799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Curse of Ties in Congestion Games with Limited Lookahead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Carla Groenland, Guido Sch\\\"afer","submitted_at":"2018-04-19T12:20:52Z","abstract_excerpt":"We introduce a novel framework to model limited lookahead in congestion games. Intuitively, the players enter the game sequentially and choose an optimal action under the assumption that the $k-1$ subsequent players play subgame-perfectly. Our model naturally interpolates between outcomes of greedy best-response ($k=1$) and subgame-perfect outcomes ($k=n$, the number of players). We study the impact of limited lookahead (parameterized by $k$) on the stability and inefficiency of the resulting outcomes. As our results reveal, increased lookahead does not necessarily lead to better outcomes; in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07107","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":"1804.07107","created_at":"2026-05-18T00:18:01.465940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07107v1","created_at":"2026-05-18T00:18:01.465940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07107","created_at":"2026-05-18T00:18:01.465940+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPRLA6O7WP5T","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPRLA6O7WP5TGVVZ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPRLA6O7","created_at":"2026-05-18T12:32:22.470017+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/EPRLA6O7WP5TGVVZCPCGA7PSRH","json":"https://pith.science/pith/EPRLA6O7WP5TGVVZCPCGA7PSRH.json","graph_json":"https://pith.science/api/pith-number/EPRLA6O7WP5TGVVZCPCGA7PSRH/graph.json","events_json":"https://pith.science/api/pith-number/EPRLA6O7WP5TGVVZCPCGA7PSRH/events.json","paper":"https://pith.science/paper/EPRLA6O7"},"agent_actions":{"view_html":"https://pith.science/pith/EPRLA6O7WP5TGVVZCPCGA7PSRH","download_json":"https://pith.science/pith/EPRLA6O7WP5TGVVZCPCGA7PSRH.json","view_paper":"https://pith.science/paper/EPRLA6O7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07107&json=true","fetch_graph":"https://pith.science/api/pith-number/EPRLA6O7WP5TGVVZCPCGA7PSRH/graph.json","fetch_events":"https://pith.science/api/pith-number/EPRLA6O7WP5TGVVZCPCGA7PSRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPRLA6O7WP5TGVVZCPCGA7PSRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPRLA6O7WP5TGVVZCPCGA7PSRH/action/storage_attestation","attest_author":"https://pith.science/pith/EPRLA6O7WP5TGVVZCPCGA7PSRH/action/author_attestation","sign_citation":"https://pith.science/pith/EPRLA6O7WP5TGVVZCPCGA7PSRH/action/citation_signature","submit_replication":"https://pith.science/pith/EPRLA6O7WP5TGVVZCPCGA7PSRH/action/replication_record"}},"created_at":"2026-05-18T00:18:01.465940+00:00","updated_at":"2026-05-18T00:18:01.465940+00:00"}