arXiv (All)
open access
Subgame Perfection in Graph Games with $ω$-Recognizable Preference Relations
This paper investigates the constrained existence problem for subgame perfect equilibria (SPEs) in multiplayer graph games. In the proposed framework, each player has a preference relation over the set of plays, assumed to be $ω$-recognizable. Equivalently, he has a preference relation over a finite
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Maker-Breaker Largest Connected Subgraph Game in Trees#1090704
- Game Theory#702308
- Matroid Packing Games: The Core and the Nucleolus#1141321
- Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games#1066569
- A characterization of subgame perfect equilibria in single-leader multi-follower games#365635
Record · ID 1037589
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive