{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SGP3R2YYDW7B54UXXPHSUHPV5K","short_pith_number":"pith:SGP3R2YY","schema_version":"1.0","canonical_sha256":"919fb8eb181dbe1ef297bbcf2a1df5eaa8c9b2fb914aef5ab719f5a47a6f63c8","source":{"kind":"arxiv","id":"1602.00771","version":3},"attestation_state":"computed","paper":{"title":"Distributed Nash Equilibrium Seeking by A Consensus Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guoqiang Hu, Maojiao Ye","submitted_at":"2016-02-02T02:52:25Z","abstract_excerpt":"In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the players considered in this paper cannot directly observe the actions of the players who are not their neighbors. Instead, the players are supposed to be capable of communicating with each other via an undirected and connected communication graph. By a synthesis of a leader-following consensus protocol and the gradient play, a distributed Nash equilibrium seeking strategy is proposed for the non-cooperative games. Analytic"},"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":"1602.00771","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-02T02:52:25Z","cross_cats_sorted":[],"title_canon_sha256":"3abbf505fcf470af75c9f1d62ed8a2c9c169ac22a4ddb11cfa45a676f1c476dd","abstract_canon_sha256":"f287426ea10eb7be49964874507f7044ab5a022a4f7acc53d8dfe81e222e9183"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:59.188035Z","signature_b64":"znMCeHPhUNxFew6q2FoBnRnA7Yj7ieO1EU/QnnlC5pdGLXLpfkwuiIfCUBAWb/bdqGkCzuX3f5rEbn4rA9BTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919fb8eb181dbe1ef297bbcf2a1df5eaa8c9b2fb914aef5ab719f5a47a6f63c8","last_reissued_at":"2026-05-18T00:47:59.187590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:59.187590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Nash Equilibrium Seeking by A Consensus Based Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guoqiang Hu, Maojiao Ye","submitted_at":"2016-02-02T02:52:25Z","abstract_excerpt":"In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the players considered in this paper cannot directly observe the actions of the players who are not their neighbors. Instead, the players are supposed to be capable of communicating with each other via an undirected and connected communication graph. By a synthesis of a leader-following consensus protocol and the gradient play, a distributed Nash equilibrium seeking strategy is proposed for the non-cooperative games. Analytic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00771","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":"1602.00771","created_at":"2026-05-18T00:47:59.187660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00771v3","created_at":"2026-05-18T00:47:59.187660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00771","created_at":"2026-05-18T00:47:59.187660+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGP3R2YYDW7B","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGP3R2YYDW7B54UX","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGP3R2YY","created_at":"2026-05-18T12:30:44.179134+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/SGP3R2YYDW7B54UXXPHSUHPV5K","json":"https://pith.science/pith/SGP3R2YYDW7B54UXXPHSUHPV5K.json","graph_json":"https://pith.science/api/pith-number/SGP3R2YYDW7B54UXXPHSUHPV5K/graph.json","events_json":"https://pith.science/api/pith-number/SGP3R2YYDW7B54UXXPHSUHPV5K/events.json","paper":"https://pith.science/paper/SGP3R2YY"},"agent_actions":{"view_html":"https://pith.science/pith/SGP3R2YYDW7B54UXXPHSUHPV5K","download_json":"https://pith.science/pith/SGP3R2YYDW7B54UXXPHSUHPV5K.json","view_paper":"https://pith.science/paper/SGP3R2YY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00771&json=true","fetch_graph":"https://pith.science/api/pith-number/SGP3R2YYDW7B54UXXPHSUHPV5K/graph.json","fetch_events":"https://pith.science/api/pith-number/SGP3R2YYDW7B54UXXPHSUHPV5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGP3R2YYDW7B54UXXPHSUHPV5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGP3R2YYDW7B54UXXPHSUHPV5K/action/storage_attestation","attest_author":"https://pith.science/pith/SGP3R2YYDW7B54UXXPHSUHPV5K/action/author_attestation","sign_citation":"https://pith.science/pith/SGP3R2YYDW7B54UXXPHSUHPV5K/action/citation_signature","submit_replication":"https://pith.science/pith/SGP3R2YYDW7B54UXXPHSUHPV5K/action/replication_record"}},"created_at":"2026-05-18T00:47:59.187660+00:00","updated_at":"2026-05-18T00:47:59.187660+00:00"}