Program for stream Optimization, Learning, and Games

MB-10: Optimization, Learning, and Games I
Stream: Optimization, Learning, and Games
Room: B100/8011
Chair(s): Georgios Piliouras

• Convex Markov Games
  Ian Gemp
• The Complexity of Two-Team Polymatrix Games with Independent Adversaries
  Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan
• From min-max to harmonic games: Regret, learning, and the role of optimism
  Panayotis Mertikopoulos
• Revenue Efficiency of First Price Auctions over Approximate Correlated Equilibrium
  Efstratios Skoulakis

MC-10: Optimization, Learning, and Games II
Stream: Optimization, Learning, and Games
Room: B100/8011
Chair(s): Antonios Varvitsiotis

• Robust Generalized Nash Equilibria
  Mauro Passacantando, Sara Mattia
• A Stable-Set Bound and Maximal Numbers of Nash Equilibria in Bimatrix Games
  Constantin Ickstadt
• Sum-of-squares for Optimal Transport: The Gromov Wasserstein Problem
  Yong Sheng Soh
• Inducing Cooperation in Social Dilemmas
  Stefanos Leonardos