1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2026★ 1 cited
The Complexity of Min-Max Optimization with Product Constraints
Martino Bernasconi, Matteo Castiglioni
We study the computational complexity of the problem of computing local min-max equilibria of games with a nonconvex-nonconcave utility function . From the work of Daskalakis, S…
cs.GT2025
Multi-Project Contracts
Tal Alon, Matteo Castiglioni, Junjie Chen +3
We study a new class of contract design problems where a principal delegates the execution of multiple projects to a set of agents. The principal's expected reward from each projec…