Pages that link to "Item:Q3224686"
From MaRDI portal
The following pages link to The Complexity of Nash Equilibria in Stochastic Multiplayer Games (Q3224686):
Displaying 12 items.
- Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (Q518409) (← links)
- Nash equilibria in symmetric graph games with partial observation (Q528190) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games (Q2211871) (← links)
- Optimal strategies for selecting coordinators (Q2217494) (← links)
- Cooperative concurrent games (Q2680769) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- (Q5015269) (← links)
- (Q5089213) (← links)
- (Q5092367) (← links)
