Gerardo Berbeglia

Orcid: 0000-0003-0108-2936

According to our database1, Gerardo Berbeglia authored at least 35 papers between 2009 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A Comparative Empirical Study of Discrete Choice Models in Retail Operations.
Manag. Sci., 2022

2021
Market segmentation in online platforms.
Eur. J. Oper. Res., 2021

Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets.
Discret. Optim., 2021

2020
Pricing under a multinomial logit model with non linear network effects.
CoRR, 2020

Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments.
Algorithmica, 2020

2019
Assortment optimization under the Sequential Multinomial Logit Model.
Eur. J. Oper. Res., 2019

Pricing policies for selling indivisible storable goods to strategic consumers.
Ann. Oper. Res., 2019

2018
Popularity signals in trial-offer markets with social influence and position bias.
Eur. J. Oper. Res., 2018

The generalized stochastic preference choice model.
CoRR, 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
Assortment Optimization under the General Luce Model.
CoRR, 2017

Taming the Unpredictability of Cultural Markets with Social Influence.
Proceedings of the 26th International Conference on World Wide Web, 2017

2016
Discrete choice models based on random walks.
Oper. Res. Lett., 2016

Trial-Offer Markets with Continuation.
CoRR, 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

Interdependent Scheduling Games.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Aligning Popularity and Quality in Online Cultural Markets.
Proceedings of the Tenth International Conference on Web and Social Media, 2016

2015
Bargaining Mechanisms for One-Way Games.
Games, 2015

Popularity Signals in Trial-Offer Markets.
CoRR, 2015

On the Optimality and Predictability of Cultural Markets with Social Influence.
CoRR, 2015

The Storable Good Monopoly Problem with Indivisible Demand.
CoRR, 2015

The Benefits of Segmentation in Trial-Offer Markets with Social Influence and Position Bias.
CoRR, 2015

A Bargaining Mechanism for One-Way Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Pricing mechanisms for a durable good monopolist.
SIGMETRICS Perform. Evaluation Rev., 2014

Optimizing Expected Utility in a Multinomial Logit Model with Position Bias and Social Influence.
CoRR, 2014

Measuring and Optimizing Cultural Markets.
CoRR, 2014

Bounds on the Profitability of a Durable Good Monopolist.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

One-way games.
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
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming.
Transp. Sci., 2011

2010
Dynamic pickup and delivery problems.
Eur. J. Oper. Res., 2010

2009
The counting complexity of a simple scheduling problem.
Oper. Res. Lett., 2009

Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete.
Discret. Appl. Math., 2009


  Loading...