arXiv (All)
open access
Games with $ω$-Automatic Preference Relations
This paper investigates Nash equilibria (NEs) in multi-player turn-based games on graphs, where player preferences are modeled as $ω$-automatic relations via deterministic parity automata. Unlike much of the existing literature, which focuses on specific reward functions, our results apply to any pr
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
- An Automata-Based Approach to Games with $ω$-Automatic Preferences#1123020
- Family_Winner: Integrating Game Theory and Heuristics to Provide Negotiation Support#203240
- Combinatorial games and the golden ratio on digraphs#617862
- Combinatorial games and the golden ratio on digraphs#617362
- Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare#973158
Record · ID 1129056
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