Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gustavo J. Vulcano

dblp:58/3509 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0003-0083-4737ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
dynamic pricing
0.412020
The Value of Observability in Dynamic Pricing · EC 2020
Algorithmic game theory and mechanism design
revenue maximization
0.412020
The Value of Observability in Dynamic Pricing · EC 2020

Methods — techniques the papers use, named apart from their topics

worst-case ratio analysis · 0.4
YearPublicationVenuePosition
2020 The Value of Observability in Dynamic Pricing
abstract
Research on dynamic pricing has been growing during the last four decades due to its use in practice by a variety of companies as well as the several model variants that can be considered. In this work, we consider the particular pricing problem where a firm wants to sell one item to a single buyer in order to maximize expected revenues. The firm commits to a price function over an infinite horizon. The buyer has a private value for the item and purchases at the time when his utility is maximized. In our model, the buyer is more impatient than the seller and we study how important is to observe the buyer time arrival in terms of the seller's expected revenue. When the seller can observe the arrival of the buyer, she can make the price function contingent on the buyer's arrival time. On the contrary, when the seller cannot observe the arrival, her price function is fixed at time zero for the whole horizon. The value of observabilityis defined as the worst case ratio between the expected revenue of the seller when she observes the buyer's arrival and that when she does not. Our main result is to prove that in a very general setting, the value of observability is at most~4.911. To obtain this result we fully characterize the observable setting and use this solution to construct a random and periodic price function for the unobservable case.
José Correa 0001, Dana Pizarro, Gustavo J. Vulcano
EC3
2019 Analysis of a generalized Linear Ordering Problem via integer programming
Isabel Méndez-Díaz, Gustavo J. Vulcano, Paula Zabala
Discret. Appl. Math.2
2014 A branch-and-cut algorithm for the latent-class logit assortment problem
Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala
Discret. Appl. Math.3