arXiv (OAI Expanded)
open access
An Automata-Based Approach to Games with $ω$-Automatic Preferences
This paper studies multiplayer turn-based games on graphs in which player preferences are modeled as $ω$-automatic relations given by deterministic parity automata. This contrasts with most existing work, which focuses on specific reward functions. We conduct a computational analysis of these games,
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
- Family_Winner: Integrating Game Theory and Heuristics to Provide Negotiation Support#203240
- Games with $ω$-Automatic Preference Relations#1129056
- Evolutionary game theory and typology: A case study#492614
- Equilibrium and Infeasibility: A new solution concept for games#1049889
- Universal Game Theory#772928
Record · ID 1123020
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