THU, 09.07.2020, 17:00-18:00 UTC+2
• Tree Polymatrix Games are PPAD-hard
• Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
• Knapsack Secretary with Bursty Adversary
• Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games
• Obviously Strategyproof Single-Minded Combinatorial Auctions
• The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem.