{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SRNR436H6MFVSVHXU5LDEPFNIM","short_pith_number":"pith:SRNR436H","schema_version":"1.0","canonical_sha256":"945b1e6fc7f30b5954f7a756323cad432ef462309eac6eebb7deb8eaf3f69e6e","source":{"kind":"arxiv","id":"2608.07336","version":1},"attestation_state":"computed","paper":{"title":"Solving Monotone Linear-Quadratic Generalized Nash Equilibrium Problems via Quadratic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberto Bemporad, Tatiana Tatarenko","submitted_at":"2026-08-07T15:31:49Z","abstract_excerpt":"We consider generalized Nash equilibrium problems among $N$ players with convex quadratic costs and shared affine constraints, assuming only that the game's pseudogradient is merely monotone. We show that computing a variational generalized Nash equilibrium (v-GNE) is equivalent to solving a single convex quadratic program (QP) derived from the players' joint Karush--Kuhn--Tucker conditions. Building on this, we show that the regularization of such a QP yields an $\\varepsilon$-approximated v-GNE with suboptimality vanishing linearly in the regularization parameter. Next, we propose an accelera"},"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":"2608.07336","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-08-07T15:31:49Z","cross_cats_sorted":[],"title_canon_sha256":"9cb9a2bf67422fdeebcca2812341ca31bc02f0e748e288194cd1a3bd94ee7c14","abstract_canon_sha256":"c5bdb313aec4b36c1e388fc6eab062062f7d6c2575d68c52801a5c095750d124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:15:03.695097Z","signature_b64":"VnEIJ4mhOwNZ1JEbXzkMvgI9lgk1/hPpCcSS6BvvwIGPV40wH3vRmzjgd8F/e0CP6r2runjFt4LzLyN2UD9WAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"945b1e6fc7f30b5954f7a756323cad432ef462309eac6eebb7deb8eaf3f69e6e","last_reissued_at":"2026-08-10T01:15:03.692700Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:15:03.692700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Monotone Linear-Quadratic Generalized Nash Equilibrium Problems via Quadratic Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alberto Bemporad, Tatiana Tatarenko","submitted_at":"2026-08-07T15:31:49Z","abstract_excerpt":"We consider generalized Nash equilibrium problems among $N$ players with convex quadratic costs and shared affine constraints, assuming only that the game's pseudogradient is merely monotone. We show that computing a variational generalized Nash equilibrium (v-GNE) is equivalent to solving a single convex quadratic program (QP) derived from the players' joint Karush--Kuhn--Tucker conditions. Building on this, we show that the regularization of such a QP yields an $\\varepsilon$-approximated v-GNE with suboptimality vanishing linearly in the regularization parameter. Next, we propose an accelera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07336","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/2608.07336/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":"2608.07336","created_at":"2026-08-10T01:15:03.693679+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07336v1","created_at":"2026-08-10T01:15:03.693679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07336","created_at":"2026-08-10T01:15:03.693679+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRNR436H6MFV","created_at":"2026-08-10T01:15:03.693679+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRNR436H6MFVSVHX","created_at":"2026-08-10T01:15:03.693679+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRNR436H","created_at":"2026-08-10T01:15:03.693679+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/SRNR436H6MFVSVHXU5LDEPFNIM","json":"https://pith.science/pith/SRNR436H6MFVSVHXU5LDEPFNIM.json","graph_json":"https://pith.science/api/pith-number/SRNR436H6MFVSVHXU5LDEPFNIM/graph.json","events_json":"https://pith.science/api/pith-number/SRNR436H6MFVSVHXU5LDEPFNIM/events.json","paper":"https://pith.science/paper/SRNR436H"},"agent_actions":{"view_html":"https://pith.science/pith/SRNR436H6MFVSVHXU5LDEPFNIM","download_json":"https://pith.science/pith/SRNR436H6MFVSVHXU5LDEPFNIM.json","view_paper":"https://pith.science/paper/SRNR436H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07336&json=true","fetch_graph":"https://pith.science/api/pith-number/SRNR436H6MFVSVHXU5LDEPFNIM/graph.json","fetch_events":"https://pith.science/api/pith-number/SRNR436H6MFVSVHXU5LDEPFNIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRNR436H6MFVSVHXU5LDEPFNIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRNR436H6MFVSVHXU5LDEPFNIM/action/storage_attestation","attest_author":"https://pith.science/pith/SRNR436H6MFVSVHXU5LDEPFNIM/action/author_attestation","sign_citation":"https://pith.science/pith/SRNR436H6MFVSVHXU5LDEPFNIM/action/citation_signature","submit_replication":"https://pith.science/pith/SRNR436H6MFVSVHXU5LDEPFNIM/action/replication_record"}},"created_at":"2026-08-10T01:15:03.693679+00:00","updated_at":"2026-08-10T01:15:03.693679+00:00"}