Gabriele Dragotto

Orcid: 0000-0002-5447-6245

Affiliations:
  • Princeton University, NJ, USA


According to our database1, Gabriele Dragotto authored at least 13 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Computing approximate Nash equilibria for integer programming games.
Optim. Lett., January, 2026

The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations.
Oper. Res., 2026

2025
Integer Programming Games.
Found. Trends Optim., 2025

2024
The critical node game.
J. Comb. Optim., July, 2024

When Nash Meets Stackelberg.
Manag. Sci., 2024

Who Plays First? Optimizing the Order of Play in Stackelberg Games with Many Robots.
Proceedings of the Robotics: Science and Systems XX, 2024

2023
The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming.
INFORMS J. Comput., 2023

Integer Programming Games: A Gentle Computational Overview.
CoRR, 2023

Learning Rationality in Potential Games.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
On fairness and diversification in WTA and ATP tennis tournaments generation.
Ann. Oper. Res., 2022

2021
ZERO: Playing Mathematical Programming Games.
CoRR, 2021

Merging combinatorial design and optimization: the Oberwolfach problem.
Australas. J Comb., 2021

2019
Nash Games Among Stackelberg Leaders.
CoRR, 2019


  Loading...