Pages that link to "Item:Q837182"
From MaRDI portal
The following pages link to On the complexity of constrained Nash equilibria in graphical games (Q837182):
Displaying 8 items.
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- Pure Nash equilibria in graphical games and treewidth (Q2343086) (← links)
- The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564) (← links)
- Pairwise-Interaction Games (Q3012801) (← links)
- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach (Q3611934) (← links)
- On Sparse Discretization for Graphical Games (Q5130000) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
- Ordinal Graph-Based Games (Q6485332) (← links)