arXiv (All)
open access
A Numerical Approach to the Realizability Problems for Memoryless Nash and Epsilon Equilibria in Concurrent Multiplayer Reachability Games
The existence of equilibria, which is called the realizability problem in the formal methods community, for probabilistic undiscounted state-based systems has proven to be an incredibly challenging research setting. In this paper, we consider a restricted version of the classic realizability problem
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
- Fair Stable Matching: A Nash Social Welfare Approach#632893
- An LLM agent-based framework for analytical characterization of Nash equilibria#377566
- Fair Stable Matching: A Nash Social Welfare Approach#924243
- Fair Stable Matching: A Nash Social Welfare Approach#920012
- Republican Freedom, Popular Control, and Collective Action#741656
Record · ID 927689
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