{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:K2BYQEMDEDDZ5NIPMSOIF4CVTK","short_pith_number":"pith:K2BYQEMD","schema_version":"1.0","canonical_sha256":"568388118320c79eb50f649c82f0559a9954e813644919d15793ec767525a99f","source":{"kind":"arxiv","id":"2302.01421","version":3},"attestation_state":"computed","paper":{"title":"Follower Agnostic Methods for Stackelberg Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT","math.DS"],"primary_cat":"math.OC","authors_text":"Chinmay Maheshwari, Eric Mazumdar, James Cheng, Lillian Ratliff, S. Shankar Sasty","submitted_at":"2023-02-02T21:21:14Z","abstract_excerpt":"In this paper, we present an efficient algorithm to solve online Stackelberg games, featuring multiple followers, in a follower-agnostic manner. Unlike previous works, our approach works even when leader has no knowledge about the followers' utility functions or strategy space. Our algorithm introduces a unique gradient estimator, leveraging specially designed strategies to probe followers. In a departure from traditional assumptions of optimal play, we model followers' responses using a convergent adaptation rule, allowing for realistic and dynamic interactions. The leader constructs the grad"},"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":"2302.01421","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-02T21:21:14Z","cross_cats_sorted":["cs.AI","cs.GT","math.DS"],"title_canon_sha256":"6457a4d9270fd4381ba635c820b7f7adbdb58159ed40538f5df344d82a7d8402","abstract_canon_sha256":"73fef989ac9ddff7e400501812d1b52c26c247be4852356e1d1a127c54a2a859"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:58.852503Z","signature_b64":"Qq+EH79Vkpc8ydCFzTOfxTRY4GnYTNtpkq0+8oE7DQyy99eJ9iWGvDOuRS8nkXf0RxrmgFgfo385FGVZ+ntEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"568388118320c79eb50f649c82f0559a9954e813644919d15793ec767525a99f","last_reissued_at":"2026-07-05T08:00:58.852052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:58.852052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Follower Agnostic Methods for Stackelberg Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT","math.DS"],"primary_cat":"math.OC","authors_text":"Chinmay Maheshwari, Eric Mazumdar, James Cheng, Lillian Ratliff, S. Shankar Sasty","submitted_at":"2023-02-02T21:21:14Z","abstract_excerpt":"In this paper, we present an efficient algorithm to solve online Stackelberg games, featuring multiple followers, in a follower-agnostic manner. Unlike previous works, our approach works even when leader has no knowledge about the followers' utility functions or strategy space. Our algorithm introduces a unique gradient estimator, leveraging specially designed strategies to probe followers. In a departure from traditional assumptions of optimal play, we model followers' responses using a convergent adaptation rule, allowing for realistic and dynamic interactions. The leader constructs the grad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.01421","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.01421/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":"2302.01421","created_at":"2026-07-05T08:00:58.852116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.01421v3","created_at":"2026-07-05T08:00:58.852116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.01421","created_at":"2026-07-05T08:00:58.852116+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2BYQEMDEDDZ","created_at":"2026-07-05T08:00:58.852116+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2BYQEMDEDDZ5NIP","created_at":"2026-07-05T08:00:58.852116+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2BYQEMD","created_at":"2026-07-05T08:00:58.852116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30531","citing_title":"Benchmarking Bilevel Derivative-Free Optimization Algorithms","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK","json":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK.json","graph_json":"https://pith.science/api/pith-number/K2BYQEMDEDDZ5NIPMSOIF4CVTK/graph.json","events_json":"https://pith.science/api/pith-number/K2BYQEMDEDDZ5NIPMSOIF4CVTK/events.json","paper":"https://pith.science/paper/K2BYQEMD"},"agent_actions":{"view_html":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK","download_json":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK.json","view_paper":"https://pith.science/paper/K2BYQEMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.01421&json=true","fetch_graph":"https://pith.science/api/pith-number/K2BYQEMDEDDZ5NIPMSOIF4CVTK/graph.json","fetch_events":"https://pith.science/api/pith-number/K2BYQEMDEDDZ5NIPMSOIF4CVTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK/action/storage_attestation","attest_author":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK/action/author_attestation","sign_citation":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK/action/citation_signature","submit_replication":"https://pith.science/pith/K2BYQEMDEDDZ5NIPMSOIF4CVTK/action/replication_record"}},"created_at":"2026-07-05T08:00:58.852116+00:00","updated_at":"2026-07-05T08:00:58.852116+00:00"}