default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriele Dragotto
Person information
- affiliation: Princeton University, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Gabriele Dragotto
, Amine Boukhtouta, Andrea Lodi, Mehdi Taobane:
The critical node game. J. Comb. Optim. 47(5): 74 (2024)- [j4]Margarida Carvalho, Gabriele Dragotto, Felipe Feijoo, Andrea Lodi, Sriram Sankaranarayanan:
When Nash Meets Stackelberg. Manag. Sci. 70(10): 7308-7324 (2024) - [i7]Haimin Hu, Gabriele Dragotto, Zixu Zhang, Kaiqu Liang, Bartolomeo Stellato, Jaime F. Fisac:
Who Plays First? Optimizing the Order of Play in Stackelberg Games with Many Robots. CoRR abs/2402.09246 (2024) - 2023
- [j3]Gabriele Dragotto, Rosario Scatamacchia:
The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. INFORMS J. Comput. 35(5): 1143-1160 (2023) - [c1]Stefan Clarke, Gabriele Dragotto, Jaime Fernández Fisac, Bartolomeo Stellato:
Learning Rationality in Potential Games. CDC 2023: 4261-4266 - [i6]Gabriele Dragotto, Amine Boukhtouta, Andrea Lodi, Mehdi Taobane:
The Critical Node Game. CoRR abs/2303.05961 (2023) - [i5]Margarida Carvalho, Gabriele Dragotto, Andrea Lodi, Sriram Sankaranarayanan:
Integer Programming Games: A Gentle Computational Overview. CoRR abs/2306.02817 (2023) - 2022
- [j2]Federico Della Croce, Gabriele Dragotto, Rosario Scatamacchia:
On fairness and diversification in WTA and ATP tennis tournaments generation. Ann. Oper. Res. 316(2): 1107-1119 (2022) - 2021
- [j1]Fabio Salassa, Gabriele Dragotto, Tommaso Traetta, Marco Buratti, Federico Della Croce:
Merging combinatorial design and optimization: the Oberwolfach problem. Australas. J Comb. 79: 141-166 (2021) - [i4]Margarida Carvalho, Gabriele Dragotto, Andrea Lodi, Sriram Sankaranarayanan:
The Cut and Play Algorithm: Computing Nash Equilibria via Outer Approximations. CoRR abs/2111.05726 (2021) - [i3]Gabriele Dragotto, Rosario Scatamacchia:
ZERO Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming. CoRR abs/2111.06382 (2021) - [i2]Gabriele Dragotto, Sriram Sankaranarayanan, Margarida Carvalho, Andrea Lodi:
ZERO: Playing Mathematical Programming Games. CoRR abs/2111.07932 (2021)
2010 – 2019
- 2019
- [i1]Margarida Carvalho, Gabriele Dragotto, Felipe Feijoo, Andrea Lodi, Sriram Sankaranarayanan:
Nash Games Among Stackelberg Leaders. CoRR abs/1910.06452 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
