{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:LTQJHHDGLSXO663ESLWT5GOI53","short_pith_number":"pith:LTQJHHDG","schema_version":"1.0","canonical_sha256":"5ce0939c665caeef7b6492ed3e99c8eef33fc0b48478ef7b384d82be9d74263b","source":{"kind":"arxiv","id":"0811.3247","version":1},"attestation_state":"computed","paper":{"title":"An experimental analysis of Lemke-Howson algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Bruno Codenotti, Marino Pagan, Stefano De Rossi","submitted_at":"2008-11-20T00:32:16Z","abstract_excerpt":"We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bimatrix games. Lemke-Howson algorithm is based upon a simple pivoting strategy, which corresponds to following a path whose endpoint is a Nash equilibrium. We analyze both the basic Lemke-Howson algorithm and a heuristic modification of it, which we designed to cope with the effects of a 'bad' initial choice of the pivot. Our experimental findings show that, on uniformly random games, the heuristics achieves a linear r"},"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":"0811.3247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-11-20T00:32:16Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"1eaf792e7286d3e02c6207c49d5671efbc9b81c6f950bd86cab07437a311d339","abstract_canon_sha256":"320edebe975cde479ed12d7f80c37c888b9f03f8a252bfab7cc28ca849468e5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:09.346142Z","signature_b64":"RPpTvK0QRKrAXoXs3FHpt2D8PR0TEmk/PSS5Owi1KGDxCB0FXGwPLaBMxAwJhPfkdQDuhtIk2J/iENB3Bls7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ce0939c665caeef7b6492ed3e99c8eef33fc0b48478ef7b384d82be9d74263b","last_reissued_at":"2026-06-03T23:06:09.345675Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:09.345675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An experimental analysis of Lemke-Howson algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Bruno Codenotti, Marino Pagan, Stefano De Rossi","submitted_at":"2008-11-20T00:32:16Z","abstract_excerpt":"We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bimatrix games. Lemke-Howson algorithm is based upon a simple pivoting strategy, which corresponds to following a path whose endpoint is a Nash equilibrium. We analyze both the basic Lemke-Howson algorithm and a heuristic modification of it, which we designed to cope with the effects of a 'bad' initial choice of the pivot. Our experimental findings show that, on uniformly random games, the heuristics achieves a linear r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.3247","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0811.3247/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":"0811.3247","created_at":"2026-06-03T23:06:09.345737+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.3247v1","created_at":"2026-06-03T23:06:09.345737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.3247","created_at":"2026-06-03T23:06:09.345737+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTQJHHDGLSXO","created_at":"2026-06-03T23:06:09.345737+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTQJHHDGLSXO663E","created_at":"2026-06-03T23:06:09.345737+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTQJHHDG","created_at":"2026-06-03T23:06:09.345737+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.13762","citing_title":"Cultivating Archipelago of Forests: Evolving Robust Decision Trees through Island Coevolution","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53","json":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53.json","graph_json":"https://pith.science/api/pith-number/LTQJHHDGLSXO663ESLWT5GOI53/graph.json","events_json":"https://pith.science/api/pith-number/LTQJHHDGLSXO663ESLWT5GOI53/events.json","paper":"https://pith.science/paper/LTQJHHDG"},"agent_actions":{"view_html":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53","download_json":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53.json","view_paper":"https://pith.science/paper/LTQJHHDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.3247&json=true","fetch_graph":"https://pith.science/api/pith-number/LTQJHHDGLSXO663ESLWT5GOI53/graph.json","fetch_events":"https://pith.science/api/pith-number/LTQJHHDGLSXO663ESLWT5GOI53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53/action/storage_attestation","attest_author":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53/action/author_attestation","sign_citation":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53/action/citation_signature","submit_replication":"https://pith.science/pith/LTQJHHDGLSXO663ESLWT5GOI53/action/replication_record"}},"created_at":"2026-06-03T23:06:09.345737+00:00","updated_at":"2026-06-03T23:06:09.345737+00:00"}