Gerardo Berbeglia

43 papers A* 5A 2B 1Journal 34Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Approximate Resolution of Stochastic Choice-Based Discrete Planning.
INFORMS J. Comput.
Jiajie Zhang, Yun Hui Lin, Gerardo Berbeglia
2024 J jnl
Bounds and Heuristics for Multiproduct Pricing.
Manag. Sci.
Guillermo Gallego, Gerardo Berbeglia
2022 J jnl
A Comparative Empirical Study of Discrete Choice Models in Retail Operations.
Manag. Sci.
Gerardo Berbeglia, Agustín Garassino, Gustavo J. Vulcano
2021 J jnl
Market segmentation in online platforms.
Eur. J. Oper. Res.
Franco Berbeglia, Gerardo Berbeglia, Pascal Van Hentenryck
2021 J jnl
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets.
Discret. Optim.
Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta
2020 J jnl
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments.
Algorithmica
Gerardo Berbeglia, Gwenaël Joret
2020 J jnl
Pricing under a multinomial logit model with non linear network effects.
CoRR
Felipe Maldonado, Gerardo Berbeglia, Pascal Van Hentenryck
2019 J jnl
Assortment optimization under the Sequential Multinomial Logit Model.
Eur. J. Oper. Res.
Álvaro Flores, Gerardo Berbeglia, Pascal Van Hentenryck
2019 J jnl
Pricing policies for selling indivisible storable goods to strategic consumers.
Ann. Oper. Res.
Gerardo Berbeglia, Gautam Rayaprolu, Adrian Vetta
2018 J jnl
Popularity signals in trial-offer markets with social influence and position bias.
Eur. J. Oper. Res.
Felipe Maldonado, Pascal Van Hentenryck, Gerardo Berbeglia, Franco Berbeglia
2018 J jnl
The generalized stochastic preference choice model.
CoRR
Gerardo Berbeglia
2018 B conf
Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets.
SAGT
Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta
2017 A* conf
Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments.
EC
Gerardo Berbeglia, Gwenaël Joret
2017 J jnl
Assortment Optimization under the General Luce Model.
CoRR
Álvaro Flores, Gerardo Berbeglia, Pascal Van Hentenryck
2017 J jnl
Assortment Optimization under the Sequential Multinomial Logit Model.
CoRR
Álvaro Flores, Gerardo Berbeglia, Pascal Van Hentenryck
2017 A* conf
Taming the Unpredictability of Cultural Markets with Social Influence.
WWW
Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck, Tad Hogg, Kristina Lerman
2016 A conf
Aligning Popularity and Quality in Online Cultural Markets.
ICWSM
Pascal Van Hentenryck, Andrés Abeliuk, Franco Berbeglia, Felipe Maldonado, Gerardo Berbeglia
2016 J jnl
Assortment optimisation under a general discrete choice model: A tight analysis of revenue-ordered assortments.
CoRR
Gerardo Berbeglia, Gwenaël Joret
2016 J jnl
Assortment optimization under a multinomial logit model with position bias and social influence.
4OR
Andrés Abeliuk, Gerardo Berbeglia, Manuel Cebrián, Pascal Van Hentenryck
2016 A* conf
Asymptotic Optimality of Myopic Optimization in Trial-Offer Markets with Social Influence.
IJCAI
Andrés Abeliuk, Gerardo Berbeglia, Felipe Maldonado, Pascal Van Hentenryck
2016 J jnl
Discrete choice models based on random walks.
Oper. Res. Lett.
Gerardo Berbeglia
2016 A* conf
Interdependent Scheduling Games.
IJCAI
Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh
2016 J jnl
Interdependent Scheduling Games.
CoRR
Andrés Abeliuk, Haris Aziz, Gerardo Berbeglia, Serge Gaspers, Petr Kalina, Nicholas Mattei, Dominik Peters, Paul Stursberg, Pascal Van Hentenryck, Toby Walsh
2016 J jnl
Trial-Offer Markets with Continuation.
CoRR
Pascal Van Hentenryck, Álvaro Flores, Gerardo Berbeglia
2015 A* conf
A Bargaining Mechanism for One-Way Games.
IJCAI
Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck
2015 J jnl
Bargaining Mechanisms for One-Way Games.
CoRR
Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck
2015 J jnl
Bargaining Mechanisms for One-Way Games.
Games
Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck
2015 J jnl
On the Optimality and Predictability of Cultural Markets with Social Influence.
CoRR
Pascal Van Hentenryck, Andrés Abeliuk, Franco Berbeglia, Gerardo Berbeglia
2015 J jnl
Popularity Signals in Trial-Offer Markets.
CoRR
Felipe Maldonado, Pascal Van Hentenryck, Gerardo Berbeglia, Franco Berbeglia
2015 J jnl
The Benefits of Segmentation in Trial-Offer Markets with Social Influence and Position Bias.
CoRR
Franco Berbeglia, Gerardo Berbeglia, Pascal Van Hentenryck
2015 J jnl
The Storable Good Monopoly Problem with Indivisible Demand.
CoRR
Gerardo Berbeglia, Gautam Rayaprolu, Adrian Vetta
2014 — conf
Bounds on the Profitability of a Durable Good Monopolist.
WINE
Gerardo Berbeglia, Peter Sloan, Adrian Vetta
2014 J jnl
Bounds on the Profitability of a Durable Good Monopolist.
CoRR
Gerardo Berbeglia, Peter Sloan, Adrian Vetta
2014 J jnl
Measuring and Optimizing Cultural Markets.
CoRR
Andrés Abeliuk, Gerardo Berbeglia, Manuel Cebrián, Pascal Van Hentenryck
2014 A conf
One-way games.
AAMAS
Andrés Abeliuk, Gerardo Berbeglia, Pascal Van Hentenryck
2014 J jnl
Optimizing Expected Utility in a Multinomial Logit Model with Position Bias and Social Influence.
CoRR
Andrés Abeliuk, Gerardo Berbeglia, Manuel Cebrián, Pascal Van Hentenryck
2014 J jnl
Pricing mechanisms for a durable good monopolist.
SIGMETRICS Perform. Evaluation Rev.
Gerardo Berbeglia, Peter Sloan, Adrian Vetta
2012 J jnl
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem.
INFORMS J. Comput.
Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte
2012 J jnl
Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis.
Transp. Sci.
Gerardo Berbeglia, Gilles Pesant, Louis-Martin Rousseau
2011 J jnl
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming.
Transp. Sci.
Gerardo Berbeglia, Gilles Pesant, Louis-Martin Rousseau
2010 J jnl
Dynamic pickup and delivery problems.
Eur. J. Oper. Res.
Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte
2009 J jnl
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete.
Discret. Appl. Math.
Gerardo Berbeglia, Gena Hahn
2009 J jnl
The counting complexity of a simple scheduling problem.
Oper. Res. Lett.
Gerardo Berbeglia