Pages that link to "Item:Q5901104"
From MaRDI portal
The following pages link to Computing correlated equilibria in multi-player games (Q5901104):
Displaying 17 items.
- Action-graph games (Q625044) (← links)
- Correlated equilibria in continuous games: characterization and computation (Q632966) (← links)
- Strong mediated equilibrium (Q834404) (← links)
- Ranking games (Q835803) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Computing the cores of strategic games with punishment-dominance relations (Q933749) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
- Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures (Q972131) (← links)
- Communication complexity and stability of equilibria in economies and games (Q1022387) (← links)
- Nash equilibria in all-optical networks (Q1043952) (← links)
- Learning to play efficient coarse correlated equilibria (Q1741209) (← links)
- Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
- Directed graphical structure, Nash equilibrium, and potential games (Q2417148) (← links)
- The complexity of welfare maximization in congestion games (Q2892161) (← links)
- Correlated Equilibria and Communication in Games (Q5149729) (← links)
