{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2C6NKJ3I7EMKSK2YFULG7G5JND","short_pith_number":"pith:2C6NKJ3I","schema_version":"1.0","canonical_sha256":"d0bcd52768f918a92b582d166f9ba968fe5921d34bea18f27985e02a8e91f936","source":{"kind":"arxiv","id":"1311.7683","version":7},"attestation_state":"computed","paper":{"title":"Robust Equilibria in Concurrent Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Romain Brenguier","submitted_at":"2013-11-29T20:15:41Z","abstract_excerpt":"We study the problem of finding robust equilibria in multiplayer concurrent games with mean payoff objectives. A $(k,t)$-robust equilibrium is a strategy profile such that no coalition of size $k$ can improve the payoff of one its member by deviating, and no coalition of size $t$ can decrease the payoff of other players. We are interested in pure equilibria, that is, solutions that can be implemented using non-randomized strategies. We suggest a general transformation from multiplayer games to two-player games such that pure equilibria in the first game correspond to winning strategies in the "},"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":"1311.7683","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-11-29T20:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"0bfff9a587b1a1731a3c55acf0ae6ec65ed0b91804b8a47a8d0a9919b5d3888b","abstract_canon_sha256":"8103245d81469a2380b0895f8eec90cbf4adaed6f8eec96c5d76d0686d01c52e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:38.207115Z","signature_b64":"v6yI7Qlesn3TDYoacyC/SJ1Tw9F4SepoRy0LLpGqTb3WX0cFYzvK7f5vNquNW4FbbgrpzF/o2L06gHI5T84eAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0bcd52768f918a92b582d166f9ba968fe5921d34bea18f27985e02a8e91f936","last_reissued_at":"2026-05-18T01:21:38.206485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:38.206485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Equilibria in Concurrent Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Romain Brenguier","submitted_at":"2013-11-29T20:15:41Z","abstract_excerpt":"We study the problem of finding robust equilibria in multiplayer concurrent games with mean payoff objectives. A $(k,t)$-robust equilibrium is a strategy profile such that no coalition of size $k$ can improve the payoff of one its member by deviating, and no coalition of size $t$ can decrease the payoff of other players. We are interested in pure equilibria, that is, solutions that can be implemented using non-randomized strategies. We suggest a general transformation from multiplayer games to two-player games such that pure equilibria in the first game correspond to winning strategies in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7683","kind":"arxiv","version":7},"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":"1311.7683","created_at":"2026-05-18T01:21:38.206610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7683v7","created_at":"2026-05-18T01:21:38.206610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7683","created_at":"2026-05-18T01:21:38.206610+00:00"},{"alias_kind":"pith_short_12","alias_value":"2C6NKJ3I7EMK","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2C6NKJ3I7EMKSK2Y","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2C6NKJ3I","created_at":"2026-05-18T12:27:30.460161+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/2C6NKJ3I7EMKSK2YFULG7G5JND","json":"https://pith.science/pith/2C6NKJ3I7EMKSK2YFULG7G5JND.json","graph_json":"https://pith.science/api/pith-number/2C6NKJ3I7EMKSK2YFULG7G5JND/graph.json","events_json":"https://pith.science/api/pith-number/2C6NKJ3I7EMKSK2YFULG7G5JND/events.json","paper":"https://pith.science/paper/2C6NKJ3I"},"agent_actions":{"view_html":"https://pith.science/pith/2C6NKJ3I7EMKSK2YFULG7G5JND","download_json":"https://pith.science/pith/2C6NKJ3I7EMKSK2YFULG7G5JND.json","view_paper":"https://pith.science/paper/2C6NKJ3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7683&json=true","fetch_graph":"https://pith.science/api/pith-number/2C6NKJ3I7EMKSK2YFULG7G5JND/graph.json","fetch_events":"https://pith.science/api/pith-number/2C6NKJ3I7EMKSK2YFULG7G5JND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2C6NKJ3I7EMKSK2YFULG7G5JND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2C6NKJ3I7EMKSK2YFULG7G5JND/action/storage_attestation","attest_author":"https://pith.science/pith/2C6NKJ3I7EMKSK2YFULG7G5JND/action/author_attestation","sign_citation":"https://pith.science/pith/2C6NKJ3I7EMKSK2YFULG7G5JND/action/citation_signature","submit_replication":"https://pith.science/pith/2C6NKJ3I7EMKSK2YFULG7G5JND/action/replication_record"}},"created_at":"2026-05-18T01:21:38.206610+00:00","updated_at":"2026-05-18T01:21:38.206610+00:00"}