{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I54V6SKQVLC5JYCRTLEVMPEIKF","short_pith_number":"pith:I54V6SKQ","schema_version":"1.0","canonical_sha256":"47795f4950aac5d4e0519ac9563c885141cc49e3d12ad41116735050b8b378f2","source":{"kind":"arxiv","id":"2402.09246","version":4},"attestation_state":"computed","paper":{"title":"Who Plays First? Optimizing the Order of Play in Stackelberg Games with Many Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Bartolomeo Stellato, Gabriele Dragotto, Haimin Hu, Jaime F. Fisac, Kaiqu Liang, Zixu Zhang","submitted_at":"2024-02-14T15:34:38Z","abstract_excerpt":"We consider the multi-agent spatial navigation problem of computing the socially optimal order of play, i.e., the sequence in which the agents commit to their decisions, and its associated equilibrium in an N-player Stackelberg trajectory game. We model this problem as a mixed-integer optimization problem over the space of all possible Stackelberg games associated with the order of play's permutations. To solve the problem, we introduce Branch and Play (B&P), an efficient and exact algorithm that provably converges to a socially optimal order of play and its Stackelberg equilibrium. As a subro"},"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":"2402.09246","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-02-14T15:34:38Z","cross_cats_sorted":["cs.AI","cs.SY","eess.SY","math.OC"],"title_canon_sha256":"cd16fbcfd4a3e24fc7f990c0b452a99b951608c3ae7aaed038e2d6a7a465ac39","abstract_canon_sha256":"3ae1005a19d4841bc2d0552f8becd167ae2825cfc36600eec2f9ede074d85425"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:22.395610Z","signature_b64":"DVhmL091mlG426ZjtvcZ8XYuEYzCPgAD1ATmJNWYCqB7WSQ8AZi3IwBJxA+xY12GjARvVSMV06PEq34rtwM8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47795f4950aac5d4e0519ac9563c885141cc49e3d12ad41116735050b8b378f2","last_reissued_at":"2026-07-05T08:36:22.395177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:22.395177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Who Plays First? Optimizing the Order of Play in Stackelberg Games with Many Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SY","eess.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Bartolomeo Stellato, Gabriele Dragotto, Haimin Hu, Jaime F. Fisac, Kaiqu Liang, Zixu Zhang","submitted_at":"2024-02-14T15:34:38Z","abstract_excerpt":"We consider the multi-agent spatial navigation problem of computing the socially optimal order of play, i.e., the sequence in which the agents commit to their decisions, and its associated equilibrium in an N-player Stackelberg trajectory game. We model this problem as a mixed-integer optimization problem over the space of all possible Stackelberg games associated with the order of play's permutations. To solve the problem, we introduce Branch and Play (B&P), an efficient and exact algorithm that provably converges to a socially optimal order of play and its Stackelberg equilibrium. As a subro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09246","kind":"arxiv","version":4},"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/2402.09246/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":"2402.09246","created_at":"2026-07-05T08:36:22.395231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09246v4","created_at":"2026-07-05T08:36:22.395231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09246","created_at":"2026-07-05T08:36:22.395231+00:00"},{"alias_kind":"pith_short_12","alias_value":"I54V6SKQVLC5","created_at":"2026-07-05T08:36:22.395231+00:00"},{"alias_kind":"pith_short_16","alias_value":"I54V6SKQVLC5JYCR","created_at":"2026-07-05T08:36:22.395231+00:00"},{"alias_kind":"pith_short_8","alias_value":"I54V6SKQ","created_at":"2026-07-05T08:36:22.395231+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12614","citing_title":"DARRMS -- An Efficient Algorithm for Dynamic Attention Radius in Resource-Constrained Multi-Agent Systems","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF","json":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF.json","graph_json":"https://pith.science/api/pith-number/I54V6SKQVLC5JYCRTLEVMPEIKF/graph.json","events_json":"https://pith.science/api/pith-number/I54V6SKQVLC5JYCRTLEVMPEIKF/events.json","paper":"https://pith.science/paper/I54V6SKQ"},"agent_actions":{"view_html":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF","download_json":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF.json","view_paper":"https://pith.science/paper/I54V6SKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09246&json=true","fetch_graph":"https://pith.science/api/pith-number/I54V6SKQVLC5JYCRTLEVMPEIKF/graph.json","fetch_events":"https://pith.science/api/pith-number/I54V6SKQVLC5JYCRTLEVMPEIKF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF/action/storage_attestation","attest_author":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF/action/author_attestation","sign_citation":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF/action/citation_signature","submit_replication":"https://pith.science/pith/I54V6SKQVLC5JYCRTLEVMPEIKF/action/replication_record"}},"created_at":"2026-07-05T08:36:22.395231+00:00","updated_at":"2026-07-05T08:36:22.395231+00:00"}