We consider an infinite sequence of customers of types C = {1, 2, . . . , I } and an infinite sequence of servers of types S = {1, 2, . . . , J }, where a server of type j can serve a subset of customer types C(j ) and where a customer of type i can be served by a subset of server types S(i). We assume that the types of customers and servers in the infinite sequences are random, independent, and identically distributed, and that customers and servers are matched according to their order in the sequence, on a first-come-first-served (FCFS) basis. We investigate this process of infinite bipartite matching. In particular, we are interested in the rate r i,j that customers of type i are assigned to servers of type j . We present a countable state Markov chain to describe this process, and for some previously unsolved instances, we prove ergodicity and existence of limiting rates, and calculate r i,j .
A retailer is endowed with a finite inventory of a nonperishable product. Demand for this product is driven by a pricesensitive Poisson process that depends on an unknown parameter that is a proxy for the market size. The retailer has a prior belief on the value of this parameter that he updates as time and available information (prices and sales) evolve. The retailer's objective is to maximize the discounted long-term average profits of his operation using dynamic pricing policies. We consider two cases. In the first case, the retailer is constrained to sell the entire initial stock of the nonperishable product before a different assortment is considered. In the second case, the retailer is able to stop selling the nonperishable product at any time and switch to a different menu of products. For both cases, we formulate the retailer's problem as a (Poisson) intensity control problem and derive structural properties of an optimal solution, and suggest a simple and efficient approximated solution. We use numerical computations, together with asymptotic analysis, to evaluate the performance of our proposed policy.
We study the performance of a stylized supply chain where two firms, a retailer and a producer, compete in a Stackelberg game. The retailer purchases a single product from the producer and afterward sells it in the retail market at a stochastic clearance price. The retailer, however, is budget constrained and is therefore limited in the number of units that he may purchase from the producer. We also assume that the retailer's profit depends in part on the realized path or terminal value of some observable stochastic process. We interpret this process as a financial process such as a foreign exchange rate or interest rate. More generally, the process can be interpreted as any relevant economic index. We consider a variation (the flexible contract) of the traditional wholesale price contract that is offered by the producer to the retailer. Under this flexible contract, at t = 0 the producer offers a menu of wholesale prices to the retailer, one for each realization of the financial process up to a future time . The retailer then commits to purchasing at time a variable number of units, with the specific quantity depending on the realization of the process up to time . Because of the retailer's budget constraint, the supply chain might be more profitable if the retailer was able to shift some of the budget from states where the constraint is not binding to states where it is binding. We therefore consider a variation of the flexible contract, where we assume that the retailer is able to trade dynamically between zero and in the financial market. We refer to this variation as the flexible contract with hedging. We compare the decentralized competitive solution for the two contracts with the solutions obtained by a central planner. We also compare the supply chain's performance across the two contracts. We find, for example, that the producer always prefers the flexible contract with hedging to the flexible contract without hedging. Depending on model parameters, however, the retailer might or might not prefer the flexible contract with hedging.
In this paper we propose a methodology to set prices of perishable items in the context of a retail chain with coordinated prices among its stores and compare its performance with actual practice in a real case study. We formulate a stochastic dynamic programming problem and develop heuristic solutions that approximate optimal solutions satisfactorily. To compare this methodology with current practices in the industry, we conducted two sets of experiments using the expertise of a product manager of a large retail company in Chile. In the first case, we contrast the performance of the proposed methodology with the revenues obtained during the 1995 autumn-winter season. In the second case, we compare it with the performance of the experienced product manager in a “simulation-game” setting. In both cases, our methodology provides significantly better results than those obtained by current practices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.