Gerardo Berbeglia
Orcid: 0000-0003-0108-2936
According to our database1,
Gerardo Berbeglia
authored at least 36 papers
between 2009 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
2022
Manag. Sci., 2022
2021
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets.
Discret. Optim., 2021
2020
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments.
Algorithmica, 2020
2019
Eur. J. Oper. Res., 2019
Ann. Oper. Res., 2019
2018
Eur. J. Oper. Res., 2018
Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018
2017
Proceedings of the 26th International Conference on World Wide Web, 2017
2016
Assortment optimization under a multinomial logit model with position bias and social influence.
4OR, 2016
Asymptotic Optimality of Myopic Optimization in Trial-Offer Markets with Social Influence.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the Tenth International Conference on Web and Social Media, 2016
2015
CoRR, 2015
The Benefits of Segmentation in Trial-Offer Markets with Social Influence and Position Bias.
CoRR, 2015
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
2014
SIGMETRICS Perform. Evaluation Rev., 2014
Optimizing Expected Utility in a Multinomial Logit Model with Position Bias and Social Influence.
CoRR, 2014
Proceedings of the Web and Internet Economics - 10th International Conference, 2014
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014
2012
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis.
Transp. Sci., 2012
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem.
INFORMS J. Comput., 2012
2011
Transp. Sci., 2011
2010
2009
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete.
Discret. Appl. Math., 2009