default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGianluca Brero
Person information
- affiliation: University of Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c9]Gianluca Brero, Eric Mibuari, Nicolas Lepore, David C. Parkes:
Learning to Mitigate AI Collusion on Economic Platforms. NeurIPS 2022- [i7]Gianluca Brero, Nicolas Lepore, Eric Mibuari, David C. Parkes:
Learning to Mitigate AI Collusion on Economic Platforms. CoRR abs/2202.07106 (2022) - [i6]Gianluca Brero, Alon Eden, Darshan Chakrabarti, Matthias Gerstgrasser, Vincent Li, David C. Parkes:
Learning Stackelberg Equilibria and Applications to Economic Design Games. CoRR abs/2210.03852 (2022) - 2021
- [c8]Gianluca Brero, Alon Eden, Matthias Gerstgrasser, David C. Parkes, Duncan Rheingans-Yoo:
Reinforcement Learning of Sequential Price Mechanisms. AAAI 2021: 5219-5227 - [c7]Manuel Beyeler, Gianluca Brero, Benjamin Lubin, Sven Seuken:
iMLCA: Machine Learning-powered Iterative Combinatorial Auctions with Interval Bidding. EC 2021: 136 - 2020
- [i5]Manuel Beyeler, Gianluca Brero, Benjamin Lubin, Sven Seuken:
Machine Learning-powered Iterative Combinatorial Auctions with Interval Bidding. CoRR abs/2009.13605 (2020) - [i4]Gianluca Brero, Alon Eden, Matthias Gerstgrasser, David C. Parkes, Duncan Rheingans-Yoo:
Reinforcement Learning of Simple Indirect Mechanisms. CoRR abs/2010.01180 (2020)
2010 – 2019
- 2019
- [c6]Gianluca Brero, Sébastien Lahaie, Sven Seuken:
Fast Iterative Combinatorial Auctions via Bayesian Learning. AAAI 2019: 1820-1828 - [i3]Gianluca Brero, Benjamin Lubin, Sven Seuken:
Machine Learning-powered Iterative Combinatorial Auctions. CoRR abs/1911.08042 (2019) - 2018
- [c5]Gianluca Brero, Sébastien Lahaie:
A Bayesian Clearing Mechanism for Combinatorial Auctions. AAAI 2018: 941-948 - [c4]Gianluca Brero, Benjamin Lubin, Sven Seuken:
Combinatorial Auctions via Machine Learning-based Preference Elicitation. IJCAI 2018: 128-136 - [i2]Gianluca Brero, Sébastien Lahaie, Sven Seuken:
Fast Iterative Combinatorial Auctions via Bayesian Learning. CoRR abs/1809.05340 (2018) - 2017
- [c3]Gianluca Brero, Benjamin Lubin, Sven Seuken:
Probably Approximately Efficient Combinatorial Auctions via Machine Learning. AAAI 2017: 397-405 - [i1]Gianluca Brero, Sébastien Lahaie:
A Bayesian Clearing Mechanism for Combinatorial Auctions. CoRR abs/1712.05291 (2017) - 2014
- [c2]Gianluca Brero, Giacomo Como
, Fabio Fagnani:
Dynamics in network games with local coordination and global congestion effects. CDC 2014: 2100-2105 - [c1]Elisa Magnanelli, Gianluca Brero, Rosa Virginia Espinoza Garnier, Giacomo Mazzoletti, Alessandro Maria Rizzi, Sara Comai:
HaptiChem: Haptic and Visual Support in Interactions with the Microscopic World. HCI (15) 2014: 72-82
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 2025-01-09 13:16 CET 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:
