Related papers: Revenue maximization with access and information p…

The Network Revenue Management (NRM) problem is a well-known challenge in dynamic decision-making under uncertainty. In this problem, fixed resources must be allocated to serve customers over a finite horizon, while customers arrive…

We consider strategic arrivals to a FCFS service system that starts service at a fixed time and has to serve a fixed number of customers, e.g., an airplane boarding system. Arriving early induces a higher waiting cost (waiting before…

We consider a strategic M/M/1 queueing model under a first-come-first-served regime, where customers are split into two classes and class $A$ has priority over class $B$. Customers can decide whether to join the queue or balk, and, in case…

We develop a model for pricing, lead-time quotation and delay compensation in a Markovian make-to-order production or service system with strategic customers who exhibit risk aversion. Based on a concave utility function of their net…

We consider a general queueing system with price-sensitive customers in which the service provider seeks to balance two objectives, maximizing the average revenue rate and minimizing the average queue length. Customers arrive according to a…

We consider an M/M/1 queueing model where customers can strategically decide to enter or leave the queue. We characterize the class of queueing regimes such that, for any parameters of the model, the socially efficient behavior is an…

In a two node tandem network, customers decide to join or balk by maximizing a given profit function whose costs are proportional to the sojourn time they spend at each queue. Assuming that their choices are taken without knowing the…

This paper presents an extension of Naor's analysis on the join-or-balk problem in observable M/M/1 queues. While all other Markovian assumptions still hold, we explore this problem assuming uncertain arrival rates under the…

This paper examines a single-server queueing system that serves both scheduled and strategic walk-in customers. The service discipline follows a first-come, first-served policy, with scheduled customers granted non-preemptive priority. Each…

We consider a queueing facility where customers decide when to arrive. All customers have the same desired arrival time (w.l.o.g.\ time zero). There is one server, and the service times are independent and exponentially distributed. The…

We consider a Markovian queue subject to Poisson generated catastrophes. Whenever a catastrophe occurs, all customers are forced to abandon the system, the server is rendered inoperative and an exponential repair time is set on. We assume…

Buying and selling of data online has increased substantially over the last few years. Several frameworks have already been proposed that study query pricing in theory and practice. The key guiding principle in these works is the notion of…

We consider the revenue maximization problem for an online retailer who plans to display in order a set of products differing in their prices and qualities. Consumers have attention spans, i.e., the maximum number of products they are…

A multiclass queue with many servers is considered, where customers make a join-or-leave decision upon arrival based on queue length information, without knowing the scheduling policy or the state of other queues. A game theoretic…

Consider a population of customers each of which needs to decide independently when to arrive to a facility that provides a service during a fixed period of time, say a day. This is a common scenario in many service systems such as a bank,…

We derive a revenue-maximizing scheme that charges customers who are homogeneous with respect to their waiting cost parameter for a random fee in order to become premium customers. This scheme incentivizes all customers to purchase…

In this work, we investigate the profit maximization problem for a wireless network carrier and the payment minimization for end-users. Motivated by recent findings on proactive resource allocation, we focus on the scenario whereby…

We model parking in urban centers as a set of parallel queues and overlay a game theoretic structure that allows us to compare the user-selected (Nash) equilibrium to the socially optimal equilibrium. We model arriving drivers as utility…

We study service scheduling problems in a slotted system in which agents arrive with service requests according to a Bernoulli process and have to leave within two slots after arrival, service costs are quadratic in service rates, and there…

We consider a Markovian single server queue with impatient customers. There is a customer abandonment cost and a holding cost for customers in the system. We consider two versions of the problem. In the first version, customers pay a reward…