UNINSURED COUNTERCYCLICAL RISK: AN AGGREGATION RESULT AND APPLICATION TO OPTIMAL MONETARY POLICY

We consider an incomplete markets economy with capital accumulation and endogenous labor supply. Individuals face countercyclical idiosyncratic labor and asset risk. We derive conditions under which the aggregate allocations and price system can be found by solving a representative agent problem. This result is applied to analyze the properties of an optimal monetary policy in a New Keynesian economy with uninsured countercyclical individual risk. The optimal monetary policy that emerges from our incomplete markets economy is the same as the optimal monetary policy in a representative agent model with preference shocks. When price rigidity is the only friction the optimal monetary policy calls for stabilizing the inflation rate at zero.     

Offshore Remanufacturing with Variable Used Product Condition

We consider the acquisition and production decisions of a remanufacturer who acquires used products of variable condition and allocates remanufacturing activity to domestic and offshore facilities. The problem is formulated as a multicommodity network flow model with economies of scale and product obsolescence. We show that the remanufacturer's optimal strategy can be chosen from a finite set of simple policies in which each product is routed to a facility based on its condition. We then numerically investigate the impact of key parameters on optimal decisions regarding offshore remanufacturing.     

Quality‐Speed Competition in Customer‐Intensive Services with Boundedly Rational Customers

We consider a system in which two competing servers provide customer‐intensive services and the service reward is affected by the length of service time. The customers are boundedly rational and choose their service providers according to a logit model. We demonstrate that the service provider revenue function is unimodal in the service rate, its decision variable, and show that the service rate competition has a unique and stable equilibrium. We then study the price decision under three scenarios with the price determined by a revenue‐maximizing firm, a welfare‐maximizing social planner, or two servers in competition. We find that the socially optimal price, subject to the requirement that the customer actual utility must be non‐negative, is always lower than the competition equilibrium price which, in turn, is lower than the revenue‐maximizing monopoly price. However, if the customer actual utility is allowed to be negative in social optimization, the socially optimal price can be higher than the other two prices in a large market.     

A reinforcement-learning approach for admission control in distributed network service systems

In the distributed network service systems such as streaming-media systems and resource-sharing systems with multiple service nodes, admission control (AC) technology is an essential way to enhance performance. Model-based optimization approaches are good ways to be applied to analyze and solve the optimal AC policy. However, due to “the curse of dimensionality”, computing such policy for practical systems is a rather difficult task. In this paper, we consider a general model of the distributed network service systems, and address the problem of designing an optimal AC policy. An analytical model is presented for the system with fixed parameters based on semi-Markov decision process (SMDP). We design an event-driven AC policy, and the stationary randomized policy is taken as the policy structure. To solve the SMDP, both the state aggregation approach and the reinforcement-learning (RL) method with online policy optimization algorithm are applied. Then, we extend the problem by considering the system with time-varying parameters, where the arrival rates of requests at each service node may change over time. In view of this situation, an AC policy switching mechanism is presented. This mechanism allows the system to decide whether to adjust its AC policy according to the policy switching rule. And in order to maximize the gain of system, that is, to obtain the optimal AC policy switching rule, another RL-based algorithm is applied. To assess the effectiveness of SMDP-based AC policy and policy switching mechanism for the system, numerical experiments are presented. We compare the performance of optimal policies obtained by the solutions of proposed methods with other classical AC policies. The simulation results illustrate that higher performance and computational efficiency could be achieved by using the SMDP model and RL-based algorithms proposed in this paper.     

Dynamic Pricing and Inventory Management with Regular and Expedited Supplies

We consider a periodic‐review inventory system with regular and expedited supply modes. The expedited supply is faster than the regular supply but incurs a higher cost. Demand for the product in each period is random and sensitive to its selling price. The firm determines its order quantity from each supply in each period as well as its selling price to maximize the expected total discounted profit over a finite or an infinite planning horizon. We show that, in each period if it is optimal to order from both supplies, the optimal inventory policy is determined by two state‐independent thresholds, one for each supply mode, and a list price is set for the product; if only the regular supply is used, the optimal policy is a state‐dependent base‐stock policy, that is, the optimal base‐stock level depends on the starting inventory level, and the optimal selling price is a markdown price that decreases with the starting inventory level. We further study the operational impact of such supply diversification and show that it increases the firm's expected profit, reduces the optimal safety‐stock levels, and lowers the optimal selling price. Thus that diversification is beneficial to both the firm and its customers. Building upon these results, we conduct a numerical study to assess and compare the respective benefit of dynamic pricing and supply diversification.     

Competition and Coordination in Online Marketplaces

Online marketplaces, such as those operated by Amazon, have seen rapid growth in recent years. These marketplaces serve as an intermediary, matching buyers with sellers, whereas control of the good is left to the seller. In some cases, e.g., the Amazon marketplace system, the firm that owns and manages the marketplace system will also sell competing products through the marketplace system. This creates a new form of channel conflict, which is a focus of this article. We consider a setting in which a marketplace firm operates an online marketplace through which retailers can sell their products directly to consumers. We consider a single retailer, who currently sells its product only through its own website, but who may choose to contract with Amazon to sell its product through the marketplace system. Selling the product through the marketplace expands the available market for the retailer, but comes at some expense, e.g., a fixed participation fee or a revenue sharing requirement. Thus, a key question for the retailer is whether she should choose to sell through the marketplace system, and if so, at what price. We analyze the optimal decisions for both the retailer and the marketplace firm and characterize the system equilibrium.     

Inventory Control when the Lead‐time Changes

A single‐echelon inventory system with continuous review and Poisson demand is considered. There are standard linear holding and backorder costs but no ordering or set‐up costs. We study a change in the lead‐time, which is rather typical in connection with application of a Just‐In‐Time philosophy. Our main focus is a lead‐time decrease but we also consider a lead‐time increase. Due to the lead‐time change, the optimal steady state solution will also, in general, change. We consider the transient problem of minimizing the costs when bringing the system from its original steady state to the new steady state.     

Fiscal Rules and Discretion Under Persistent Shocks

This paper studies the optimal level of discretion in policymaking. We consider a fiscal policy model where the government has time‐inconsistent preferences with a present bias toward public spending. The government chooses a fiscal rule to trade off its desire to commit to not overspend against its desire to have flexibility to react to privately observed shocks to the value of spending. We analyze the optimal fiscal rule when the shocks are persistent. Unlike under independent and identically distributed shocks, we show that the ex ante optimal rule is not sequentially optimal, as it provides dynamic incentives. The ex ante optimal rule exhibits history dependence, with high shocks leading to an erosion of future fiscal discipline compared to low shocks, which lead to the reinstatement of discipline. The implied policy distortions oscillate over time given a sequence of high shocks, and can force the government to accumulate maximal debt and become immiserated in the long run.     

Dual Sourcing in a Serial System

We consider a finite‐horizon, periodic‐review model for a serial system with two uncapacitated external suppliers. While one external supplier (regular supplier) ships to the most upstream stage, the other one (emergency supplier) ships directly to a downstream stage. For this system, with general lead‐times we show that the optimal cost function is multimodular with respect to inventories in transit and inventories at different stages and obtain results that show how the optimal order quantities change with respect to these inventories. Our analysis also leads to sufficient conditions under which modified echelon‐basestock‐type policies are optimal.     

Market Good Flexibility in Capacity Auctions

We consider the allocation of limited production capacity among several competing agents through auctions. Our focus is on the contribution of flexibility in market good design to effective capacity allocation. The application studied is a capacity allocation problem involving several agents, each with a job, and a facility owner. Each agent generates revenue by purchasing capacity and scheduling its job at the facility. Ascending auctions with various market good designs are compared. We introduce a new market good that provides greater flexibility than those previously considered in the literature. We allow ask prices to depend both on agents’ utility functions and on the number of bids at the previous round of the auction, in order to model and resolve resource conflicts. We develop both optimal and heuristic solution procedures for the winner determination problem. Our computational study shows that flexibility in market good design typically increases system value within auctions. A further increase is achieved if each agent is allowed to bid for multiple market goods at each round. On average, the multiple flexible market goods auction provides over 95% of the system value found by centralized planning.     

Behavioral Modeling of Adversaries with Multiple Objectives in Counterterrorism

Attacker/defender models have primarily assumed that each decisionmaker optimizes the cost of the damage inflicted and its economic repercussions from their own perspective. Two streams of recent research have sought to extend such models. One stream suggests that it is more realistic to consider attackers with multiple objectives, but this research has not included the adaption of the terrorist with multiple objectives to defender actions. The other stream builds off experimental studies that show that decisionmakers deviate from optimal rational behavior. In this article, we extend attacker/defender models to incorporate multiple objectives that a terrorist might consider in planning an attack. This includes the tradeoffs that a terrorist might consider and their adaption to defender actions. However, we must also consider experimental evidence of deviations from the rationality assumed in the commonly used expected utility model in determining such adaption. Thus, we model the attacker's behavior using multiattribute prospect theory to account for the attacker's multiple objectives and deviations from rationality. We evaluate our approach by considering an attacker with multiple objectives who wishes to smuggle radioactive material into the United States and a defender who has the option to implement a screening process to hinder the attacker. We discuss the problems with implementing such an approach, but argue that research in this area must continue to avoid misrepresenting terrorist behavior in determining optimal defensive actions.     

Outsourcing vs. in-house production: a comparison of supply chain contracts with effort dependent demand

We analyze the effort and pricing decisions in a two facility supply chain in which one of the parties can exert costly effort to increase demand. We consider an outsourcing model in which the supplier makes the effort decision and an in-house production model in which the manufacturer decides on the effort level and we compare these two models with each other. We analyze and compare several contracts for decentralized supply chain models and we aim to find which contracts are best to use in different cases. We find the optimal contract parameters in each case and perform extensive computational testing to compare the efficiencies of these contracts. We also analyze the effect of the powers of the parties in the system and the effect of system parameters on the performances of the contracts and on the optimal values of the model variables such as price, effort and demand.     

A nested-compliance table policy for emergency medical service systems under relocation

The goal of Emergency Medical Service (EMS) systems is to provide rapid response to emergency calls in order to save lives. This paper proposes a relocation strategy to improve the performance of EMS systems. In practice, EMS systems often use a compliance table to relocate ambulances. A compliance table specifies ambulance base stations as a function of the state of the system. We consider a nested-compliance table, which restricts the number of relocations that can occur simultaneously. We formulate the nested-compliance table model as an integer programming model in order to maximize expected coverage. We determine an optimal nested-compliance table policy using steady state probabilities of a Markov chain model with relocation as input parameters. These parameter approximations are independent of the exact compliance table used. We assume that there is a single type of medical unit, single call priority, and no patient queue. We validate the model by applying the nested-compliance table policies in a simulated system using real-world data. The numerical results show the benefit of our model over a static policy based on the adjusted maximum expected covering location problem (AMEXCLP).     

Optimal Dynamic Order Scheduling under Capacity Constraints Given Demand‐Forecast Evolution

We consider a manufacturer without any frozen periods in production schedules so that it can dynamically update the schedules as the demand forecast evolves over time until the realization of actual demand. The manufacturer has a fixed production capacity in each production period, which impacts the time to start production as well as the production schedules. We develop a dynamic optimization model to analyze the optimal production schedules under capacity constraint and demand‐forecast updating. To model the evolution of demand forecasts, we use both additive and multiplicative versions of the martingale model of forecast evolution. We first derive expressions for the optimal base stock levels for a single‐product model. We find that manufacturers located near their market bases can realize most of their potential profits (i.e., profit made when the capacity is unlimited) by building a very limited amount of capacity. For moderate demand uncertainty, we also show that it is almost impossible for manufacturers to compensate for the increase in supply–demand mismatches resulting from long delivery lead times by increasing capacity, making lead‐time reduction a better alternative than capacity expansion. We then extend the model to a multi‐product case and derive expressions for the optimal production quantities for each product given a shared capacity constraint. Using a two‐product model, we show that the manufacturer should utilize its capacity more in earlier periods when the demand for both products is more positively correlated.     

Strategyproof mechanism design for facility location games with weighted agents on a line

Approximation mechanism design without money was first studied in Procaccia and Tennenholtz (2009) by considering a facility location game. In general, a facility is being opened and the cost of an agent is measured by its distance to the facility. In order to achieve a good social cost, a mechanism selects the location of the facility based on the locations reported by agents. It motivates agents to strategically report their locations to get good outcomes for themselves. A mechanism is called strategyproof if no agents could manipulate to get a better outcome by telling lies regardless of any configuration of other agents. The main contribution in this paper is to explore the strategyproof mechanisms without money when agents are distinguishable. There are two main variations on the nature of agents. One is that agents prefer getting closer to the facility, while the other is that agents prefer being far away from the facility. We first consider the model that directly extends the model in Procaccia and Tennenholtz (2009). In particular, we consider the strategyproof mechanisms without money when agents are weighted. We show that the strategyproof mechanisms in the case of unweighted agents are still the best in the weighted cases. We establish tight lower and upper bounds for approximation ratios on the optimal social utility and the minimum utility when agents prefer to stay close to the facility. We then provide the lower and upper bounds on the optimal social utility and lower bound on the minimum distance per weight when agents prefer to stay far away from the facility. We also extend our study in a natural direction where two facilities must be built on a real line. Secondly, we propose an novel threshold based model to distinguish agents. In this model, we present a strategyproof mechanism that leads to optimal solutions in terms of social cost.     

VMI环境下库存竞争性产品的补货策略及最优货架空间的确定

本文在文献[1]的研究基础上,通过深入剖析FKO模型,运用动态规划方法,探讨了呈现特殊需求性质的库存竞争性产品在VMI环境下的多期动态补货策略,以及传统库存管理中不加考虑的库存空间优化问题。本文一方面是对FKO模型的补充与扩展,同时也证实了对于在特定的VMI补货环境下采用多期库存盘查模式的供应商来说,封顶式的补货策略是最优的,并且其关于最优补货水平的多期决策都是无远见的。因此收益分享合同下的单期最优库存水平可以作为设定最优货架展示空间的依据。     

电子商务环境下双渠道供应链协调的补偿策略研究

构建了电子商务环境下由一个制造商与一个零售商组成的双渠道供应链模型,分析、比较了集中式决策与分散式决策下双渠道供应链的最优价格,从电子渠道与传统渠道合作的角度出发,研究了双渠道供应链协调的补偿策略,论证了这种补偿策略能够实现双渠道供应链协调,且在一定范围内可以保证双渠道供应链成员的双赢.最后通过算例分析,进一步检验了所设计的补偿策略对双渠道供应链协调的有效性.     

The Effects of Sharing Upstream Information on Product Rollover

The process of introducing new and phasing out old products is called product rollover. This paper considers a periodic‐review inventory system consisting of a manufacturer and a retailer, where the manufacturer introduces new and improved products over an infinite planning horizon using the solo‐roll strategy. We consider two scenarios: (1) the manufacturer does not share the upstream information about new‐product introduction with the retailer and (2) the manufacturer shares the information. For each scenario, we first derive the decentralized ordering policy and the system‐optimal ordering policy with given cost parameters. We then devise an optimal supply chain contract that coordinates the inventory system. We demonstrate that when the inventory system is coordinated, information sharing improves the performance of both supply chain entities. However, this may not be true if the inventory system is not coordinated. We also show that under the optimal contract, the manufacturer has no incentive to mislead the retailer about new‐product information in the information‐sharing model. When demand variability increases, information sharing adds more benefits to the coordinated supply chain. Our research provides insights about coordinating product, financial, and information flows in supply chains with product rollover.     

Optimal Control of Replenishment and Substitution in an Inventory System with Nonstationary Batch Demand

We study an inventory system in which a supplier supplies demand using two mutually substitutable products over a selling season of T periods, with a single replenishment opportunity at the beginning of the season. As the season starts, customer orders arrive in each period, for either type of products, following a nonstationary Poisson process with random batch sizes. The substitution model we consider combines the usual supplier‐driven and customer‐driven schemes, in that the supplier may choose to offer substitution, at a discount price, or may choose not to; whereas the customer may or may not accept the substitution when it is offered. The supplier's decisions are the supply and substitution rules in each period throughout the season, and the replenishment quantities for both products at the beginning of the season. With a stochastic dynamic programming formulation, we first prove the concavity of the value function, which facilitates the solution to the optimal replenishment quantities. We then show that the optimal substitution follows a threshold rule, and establish the monotonicity of the thresholds over time and with respect to key cost parameters. We also propose a heuristic exhaustive policy, and illustrate its performance through numerical examples.     

AN ECONOMIC PRODUCTION QUANTITY MODEL WITH LEARNING AND FORGETTING CONSIDERATIONS

The focus of this work is on the effects of learning on economic production quantity in batch production systems. We assumed that both unit variable manufacturing time and setup time follow a learning curve. We modified the classical Economic Production Quantity model to incorporate these two types of learning phenomena. We also incorporated the forgetting effect in our model so that a fraction of the learning is lost between consecutive lots. We developed a dynamic program to obtain the optimal solution to the problem. We investigated the nonincreasing lot size property and used it to improve the efficiency of our dynamic program. We consider a special case of the model in which all lot sizes are assumed equal. After theoretical treatment, we carried out a computational study of the effect of assuming equal lot sizes on the optimal solutions. The results of our examples strongly indicate that the assumption of equal lot sizes not only simplifies the determination of the optimal solutions, but also provides close approximations to the optimal solutions.