![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Gennaro Auricchio
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c6]Gennaro Auricchio, Jie Zhang, Mengxiao Zhang:
Extended Ranking Mechanisms for the m-Capacitated Facility Location Problem in Bayesian Mechanism Design. AAMAS 2024: 87-95 - [i9]Gennaro Auricchio, Zihe Wang, Jie Zhang:
Facility Location Problems with Capacity Constraints: Two Facilities and Beyond. CoRR abs/2404.13566 (2024) - [i8]Gennaro Auricchio, Jie Zhang:
The k-Facility Location Problem Via Optimal Transport: A Bayesian Study of the Percentile Mechanisms. CoRR abs/2407.06398 (2024) - [i7]Gennaro Auricchio, Harry J. Clough, Jie Zhang:
Mechanism Design for Locating Facilities with Capacities with Insufficient Resources. CoRR abs/2407.18547 (2024) - 2023
- [c5]Gennaro Auricchio, Jie Zhang:
On the Manipulability of Maximum Vertex-Weighted Bipartite b-Matching Mechanisms. ECAI 2023: 125-132 - [c4]Gennaro Auricchio, Ruixiao Zhang, Jie Zhang, Xiaohao Cai
:
A Bilevel Formalism for the Peer-Reviewing Problem. ECAI 2023: 133-140 - [i6]Gennaro Auricchio, Ruixiao Zhang, Jie Zhang, Xiaohao Cai:
A Bilevel Formalism for the Peer-Reviewing Problem. CoRR abs/2307.12248 (2023) - [i5]Gennaro Auricchio, Jie Zhang:
On the Manipulability of Maximum Vertex-Weighted Bipartite b-matching Mechanisms. CoRR abs/2307.12305 (2023) - [i4]Gennaro Auricchio, Qun Ma, Jie Zhang:
Edge Manipulations for the Maximum Vertex-Weighted Bipartite b-matching. CoRR abs/2310.11908 (2023) - [i3]Gennaro Auricchio, Jie Zhang, Mengxiao Zhang:
Extended Ranking Mechanisms for the m-Capacitated Facility Location Problem in Bayesian Mechanism Design. CoRR abs/2312.16034 (2023) - 2022
- [c3]Gennaro Auricchio
, Luca Ferrarini
, Stefano Gualandi
, Greta Lanzarotto
, Ludovico Pernazza:
A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons. CPAIOR 2022: 14-23 - 2021
- [i2]Gennaro Auricchio, Andrea Codegoni, Stefano Gualandi, Lorenzo Zambon:
The Fourier Loss Function. CoRR abs/2102.02979 (2021) - [i1]Gennaro Auricchio, Luca Ferrarini, Greta Lanzarotto:
An Integer Linear Programming Model for Tilings. CoRR abs/2107.04108 (2021)
2010 – 2019
- 2019
- [c2]Gennaro Auricchio, Federico Bassetti, Stefano Gualandi
, Marco Veneroni:
Computing Wasserstein Barycenters via Linear Programming. CPAIOR 2019: 355-363 - 2018
- [c1]Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni:
Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs. NeurIPS 2018: 5798-5808
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-08-27 22:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint