検索条件

キーワード
タグ
ツール
開催日
こだわり条件

タグ一覧

JavaScript
PHP
Java
Ruby
Python
Perl
Scala
Haskell
C言語
C言語系
Google言語
デスクトップアプリ
スマートフォンアプリ
プログラミング言語
U/UX
MySQL
RDB
NoSQL
全文検索エンジン
全文検索
Hadoop
Apache Spark
BigQuery
サーバ構成管理
開発サポートツール
テストツール
開発手法
BI
Deep Learning
自然言語処理
BaaS
PaaS
Iaas
Saas
クラウド
AI
Payment
クラウドソフトウェア
仮想化ソフトウェア
OS
サーバ監視
ネットワーク
WEBサーバ
開発ツール
テキストエディタ
CSS
HTML
WEB知識
CMS
WEBマーケティング
グラフィック
グラフィックツール
Drone
AR
マーケット知識
セキュリティ
Shell
IoT
テスト
Block chain
知識

[94th TrustML Young Scientist Seminar] Talk by Sai Ganesh Nagarajan (Zuse Institute Berlin) "Algorithms and Complexity for Two-Team Polymatrix Zero-Sum Games: Revisiting Constrained Bilinear Minmax Optimization"

2025/05/08(木)
02:00〜03:00

主催:RIKEN AIP Public

Date and Time: May 8, 2025: 11:00 - 12:00 (JST)
Venue: Online

Title: Algorithms and Complexity for Two-Team Polymatrix Zero-Sum Games: Revisiting Constrained Bilinear Minmax Optimization

Speaker: Sai Ganesh Nagarajan (Zuse Institute Berlin)

Abstract: Adversarial multiplayer games are an important object of study in multiagent learning. In particular, polymatrix zero-sum games are a multiplayer setting where Nash equilibria are known to be efficiently computable. Towards understanding the limits of tractability in polymatrix games, we study the computation of Nash equilibria in such games where each pair of players plays either a zero-sum or a coordination game. A setting that is particularly interesting is where players can be grouped into a small number of teams of identical interest [Von Stengel and Koller 1997]. While the three-team version of the problem is known to be PPAD-complete, the complexity for two teams has remained open [Cai and Daskalakis 2011]. In this talk, we show that the two-team version is CLS-hard and we do so by proving the hardness of finding any stationary point in the simplest type of non-convex-concave min-max constrained optimization problem, namely for a class of bilinear polynomial objective functions. Finally, we discuss some algorithms for a restricted version of this problem, namely a team with non-interacting adversaries.

Bio: Sai Ganesh Nagarajan is a postdoctoral researcher leading the Efficient and Sustainable Learning thrust at the IOL Lab, Zuse Institute Berlin. He previously held a postdoc in the Algorithms Group at EPFL and earned his PhD (President’s Graduate Fellowship) from the Singapore University of Technology and Design. Before that, he spent three years at Singapore’s Institute for Infocomm Research, where he developed spatio‑temporal statistical models and anomaly‑detection solutions for the Housing Development Board, the Ministry of Health, and various SMEs. Notably, he contributed to the Ministry of National Development’s R&D Award–winning project on understanding micro‑climatic effects of building design (UM-MIST).

Workship