Gianluca Brero

Gianluca Brero


Gianluca Brero
Ph.D. Student
Department of Informatics
University of Zurich
Binzmühlestrasse 14
CH-8050 Zürich
Room BIN 2.B.05
Tel +41 44 635 45 63

Short Bio

Since September 2014 Gianluca is a Ph.D. student in the Computation and Economics Research Group at the Department of Informatics of the University of Zurich. In 2014 he received a M.Sc. in Mathematical Engineering from Turin Polytechnic with a final thesis on games over networks. From 2012 to 2014 he has also been a student at Alta Scuola Politecnica, an educational joint venture of Milan Polytechnic and Turin Polytechnic which focuses on multidisciplinarity and innovation. During Summer 2016 he was a research intern at Microsoft Research Lab – New York City where he worked on Gaussian methods for market clearing under the supervision of Sébastien Lahaie.


Research Interests

Mechanism Design, Market Design, Auction Theory, Machine Learning, Statistical Learning Theory


  • Probably Approximately Efficient Combinatorial Auctions via Machine Learning.
    Gianluca Brero, Benjamin Lubin, and Sven Seuken. 
    In Proceedings of the Thirty-First AAAI Conference of Artificial Intelligence (AAAI-17), San Francisco, USA, February 2017.
  • Dynamics in Network Games with Local Coordination and Global Congestion Effects. 
    Gianluca Brero, Giacomo Como, and Fabio Fagnani. 
    In Proceedings of the Fifty-Third IEEE Conference on Decision and Control (CDC-2014), Los Angeles, USA, December 2014.
  • HaptiChem: Haptic and Visual Support in Interactions with the Microscopic World. 
    Elisa Magnanelli, Gianluca Brero, Rosa Virginia Espinoza Garnier, Giacomo Mazzoletti, Alessandro Maria Rizzi, and Sara Comai.
    In Learning and Collaboration Technologies. Technology-Rich Environments for Learning and Collaboration (pp. 72-82), Springer International Publishing, 2014.


Advised Theses

  • Computational Bayes-Nash Equilibrium Analysis of Overbidding Strategies in Combinatorial Auctions  
    Bachelor Thesis by Andreas Perschak. 2015.