Pages that link to "Item:Q2347787"
From MaRDI portal
The following pages link to Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787):
Displayed 10 items.
- The query complexity of correlated equilibria (Q1651292) (← links)
- Learning to play efficient coarse correlated equilibria (Q1741209) (← links)
- Correlated equilibrium of games in fuzzy environment (Q2035290) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- Committing to correlated strategies with multiple leaders (Q2238721) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- Multilinear Games (Q2959817) (← links)
- (Q5009504) (← links)
- From Duels to Battlefields: Computing Equilibria of Blotto and Other Games (Q5108243) (← links)
- The Complexity of Contracts (Q5856150) (← links)