Ioannis Panageas

3 papers UC Irvine

• Efficient Kernelized Learning in Polyhedral Games beyond Full Information: From Colonel Blotto to Congestion Games
• The Complexity of Finding Local Optima in Contrastive Learning
• The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games