Nash Games Among Stackelberg Leaders. - Margarida Carvalho; Gabriele Dragotto; Felipe Feijoo; Andrea Lodi 001; Sriram Sankaranarayanan 002 (CoRR, 2019)

Merging combinatorial design and optimization: the Oberwolfach problem. - Fabio Salassa; Gabriele Dragotto; Tommaso Traetta; Marco Buratti; Federico Della Croce (Australas. J Comb., 2021)

The Cut and Play Algorithm: Computing Nash Equilibria via Outer Approximations. - Margarida Carvalho; Gabriele Dragotto; Andrea Lodi 001; Sriram Sankaranarayanan 002 (CoRR, 2021)

ZERO: Playing Mathematical Programming Games. - Gabriele Dragotto; Sriram Sankaranarayanan 002; Margarida Carvalho; Andrea Lodi 001 (CoRR, 2021)

On fairness and diversification in WTA and ATP tennis tournaments generation. - Federico Della Croce; Gabriele Dragotto; Rosario Scatamacchia (Ann. Oper. Res., 2022)

Learning Rationality in Potential Games. - Stefan Clarke; Gabriele Dragotto; Jaime Fernández Fisac; Bartolomeo Stellato (CDC, 2023)

Integer Programming Games: A Gentle Computational Overview. - Margarida Carvalho; Gabriele Dragotto; Andrea Lodi 001; Sriram Sankaranarayanan 002 (CoRR, 2023)

The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. - Gabriele Dragotto; Rosario Scatamacchia (INFORMS J. Comput., 2023)

Who Plays First? Optimizing the Order of Play in Stackelberg Games with Many Robots. - Haimin Hu; Gabriele Dragotto; Zixu Zhang; Kaiqu Liang; Bartolomeo Stellato; Jaime Fernández Fisac (Robotics: Science and Systems, 2024)

When Nash Meets Stackelberg. - Margarida Carvalho; Gabriele Dragotto; Felipe Feijoo; Andrea Lodi 001; Sriram Sankaranarayanan 002 (Manag. Sci., 2024)

The critical node game. - Gabriele Dragotto; Amine Boukhtouta; Andrea Lodi 001; Mehdi Taobane (J. Comb. Optim., 2024)

Integer Programming Games. - Margarida Carvalho; Gabriele Dragotto; Andrea Lodi 001; Sriram Sankaranarayanan 002 (Found. Trends Optim., 2025)