20 citations · 145 across the 58 of their papers we have counts for
48 papers · 1 filter
Efficient representations for team and imperfect-recall equilibrium computation
Luca Carminati, Brian Hu Zhang, Federico Cacciamani +4
Equilibrium finding in two-player zero-sum games with perfect recall is a well-studied topic that has led to many breakthroughs in computational game theory. This paper aims to gen…
Hidden-Role Games: Equilibrium Concepts and Computation
Luca Carminati, Brian Hu Zhang, Gabriele Farina +2
In this paper, we study the class of games known as hidden-role games in which players are assigned privately to teams and are faced with the challenge of recognizing and cooperati…
Online Information Acquisition: Hiring Multiple Agents
Federico Cacciamani, Matteo Castiglioni, Nicola Gatti
We investigate the mechanism design problem faced by a principal who hires \emph{multiple} agents to gather and report costly information. Then, the principal exploits the informat…
Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games
Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides +7
We introduce a new approach for computing optimal equilibria via learning in games. It applies to extensive-form settings with any number of players, including mechanism design, in…
Online Mechanism Design for Information Acquisition
Federico Cacciamani, Matteo Castiglioni, Nicola Gatti
We study the problem of designing mechanisms for \emph{information acquisition} scenarios. This setting models strategic interactions between an uniformed \emph{receiver} and a set…
Selling Information while Being an Interested Party
Matteo Castiglioni, Francesco Bacchiocchi, Alberto Marchesi +2
We study the algorithmic problem faced by an information holder (seller) who wants to optimally sell such information to a budged-constrained decision maker (buyer) that has to und…