Pages that link to "Item:Q1651292"

The following pages link to The query complexity of correlated equilibria (Q1651292):

Displaying 17 items.

• Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
• Logarithmic query complexity for approximate Nash computation in large games (Q1733380) (← links)
• Communication complexity of approximate Nash equilibria (Q2155907) (← links)
• On adaptive heuristics that converge to correlated equilibrium (Q2183972) (← links)
• Learning convex partitions and computing game-theoretic equilibria from best response queries (Q2190390) (← links)
• Pricing lotteries (Q2253836) (← links)
• Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
• Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
• Lower bounds for the query complexity of equilibria in Lipschitz games (Q2670917) (← links)
• Query Complexity of Approximate Equilibria in Anonymous Games (Q3460801) (← links)
• Inapproximability of Nash Equilibrium (Q4571923) (← links)
• (Q4638112) (← links)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727) (← links)
• Optimally Deceiving a Learning Leader in Stackelberg Games (Q5026202) (← links)
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q6139831) (← links)
• Lower bounds for the query complexity of equilibria in Lipschitz games (Q6159025) (← links)
• ``Subjectivity and correlation in randomized strategies'': back to the roots (Q6615363) (← links)