-
作者：Candogan, Ozan; Bimpikis, Kostas; Ozdaglar, Asuman
作者单位：Massachusetts Institute of Technology (MIT); Stanford University
摘要：We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers who are embedded in a social network. A key feature of our model is that consumers experience a (positive) local network effect. In particular, each consumer's usage level depends directly on the usage of her neighbors in the social network structure. Thus, the monopolist's optimal pricing strategy may involve offering discounts to certain agents who have a central position in the underlying...
-
作者：Yaman, Hande; Karasan, Oya Ekin; Kara, Bahar Y.
作者单位：Ihsan Dogramaci Bilkent University
摘要：Inspired by a real-life problem faced by one of the largest ground-based cargo companies of Turkey, the current study introduces a new facet to the hub location literature. The release time scheduling and hub location problem aims to select a specified number of hubs from a fixed set of demand centers, to allocate each demand center to a hub, and to decide on the release times of trucks from each demand center in such a way that the total amount of cargo guaranteed to be delivered to every pot...
-
作者：Zhang, Minjiao; Kuecuekyavuz, Simge; Yaman, Hande
作者单位：University System of Ohio; Ohio State University; Ihsan Dogramaci Bilkent University
摘要：In this paper, we study a multiechelon uncapacitated lot-sizing problem in series (m-ULS), where the output of the intermediate echelons has its own external demand and is also an input to the next echelon. We propose a polynomial-time dynamic programming algorithm, which gives a tight, compact extended formulation for the two-echelon case (2-ULS). Next, we present a family of valid inequalities for m-ULS, show its strength, and give a polynomial-time separation algorithm. We establish a hiera...
-
作者：Fischetti, Matteo; Monaci, Michele; Salvagnin, Domenico
作者单位：University of Padua
摘要：We address the exact solution of the famous esc instances of the quadratic assignment problem. These are extremely hard instances that remained unsolved-even allowing for a tremendous computing power-by using all previous techniques from the literature. During this challenging task we found that three ideas were particularly useful and qualified as a breakthrough for our approach. The present paper is about describing these ideas and their impact in solving esc instances. Our method was able t...
-
作者：Reed, Josh; Tezcan, Tolga
作者单位：New York University; University of Rochester
摘要：We Obtain a heavy traffic limit for the GI/M/n + GI queue, which includes the entire patience time distribution. Our main approach is to scale the hazard rate function of the patience time distribution in such a way that our resulting diffusion approximation contains the entire hazard rate function. We then show through numerical studies that for various performance measures, our approximations tend to outperform those commonly used in practice. The robustness of our results is also demonstrat...
-
作者：Gurvich, Itai; Perry, Ohad
作者单位：Northwestern University; Northwestern University
摘要：Motivated by call center cosourcing problems, we consider a service network operated under an overflow mechanism. Calls are first routed to an in-house (or dedicated) service station that has a finite waiting room. If the waiting room is full, the call is overflowed to an outside provider (an overflow station) that might also be serving overflows from other stations. We establish approximations for overflow networks with many servers under a resource-pooling assumption that stipulates, in our ...
-
作者：Hu, Jian; Mehrotra, Sanjay
作者单位：Northwestern University
摘要：We introduce and study a family of models for multiexpert multiobjective/criteria decision making. These models use a concept of weight robustness to generate a risk-averse decision. In particular, the multiexpert multicriteria robust weighted sum approach (McRow) introduced in this paper identifies a (robust) Pareto decision that minimizes the worst-case weighted sum of objectives over a given weight region. The corresponding objective value, called the robust value of a decision, is shown to...
-
作者：Broder, Josef; Rusmevichientong, Paat
作者单位：Cornell University; University of Southern California
摘要：We consider a stylized dynamic pricing model in which a monopolist prices a product to a sequence of T customers who independently make purchasing decisions based on the price offered according to a general parametric choice model. The parameters of the model are unknown to the seller, whose objective is to determine a pricing policy that minimizes the regret, which is the expected difference between the seller's revenue and the revenue of a clairvoyant seller who knows the values of the param...
