Computational Social Choice Team(Talk by Stanisław Jerzy Kazmierowski, University of Warsaw).

An online research talk hosted by the Computational Social Choice Team at RIKEN AIP. Stanisław Jerzy Kazmierowski of the University of Warsaw presents "Computing Equilibria in Conflicts with Multiple Battlefields", on models where competitors split limited resources across several simultaneous contests, such as the Colonel Blotto game. The talk covers two departures from the classical setting. With costs for obtaining and assigning resources, the game can be transformed into an equivalent fixed-budget Blotto game with one extra battlefield, giving polynomial-time Nash equilibrium computation. For non-additive conflicts, it presents hardness results for best responses and a practical method combining symmetrization, a polynomial-time clash-matrix algorithm and the double-oracle algorithm.