消费者导向类型与电商全渠道决策研究

从现实出发，基于不同消费者导向类型研究了电商的全渠道决策问题。首先建立电商单渠道销售的基础模型，并得出最优产品组合、价格和交付时间。在此基础上，给出了消费者为产品导向型和渠道导向型情况下电商采取全渠道决策的条件，得出双渠道产品组合、价格及交付时间的最优决策；并进行了数值验证。研究发现，同一渠道提供的产品其最优价格相同，最优交付时间只和消费者耐心程度及交付成本函数有关。若消费者为产品导向型，仅当双渠道运营成本之差较小且消费者耐心程度较低时，电商进入线下渠道才有利可图，且在线下渠道提供最受欢迎的产品，线上渠道提供剩余产品。若消费者为渠道导向型，电商进入线下渠道必然有利可图，且在线下渠道提供最受欢迎的产品，线上渠道提供所有产品。     

Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits

We consider assortment problems under a mixture of multinomial logit models. There is a fixed revenue associated with each product. There are multiple customer types. Customers of different types choose according to different multinomial logit models whose parameters depend on the type of the customer. The goal is to find a set of products to offer so as to maximize the expected revenue obtained over all customer types. This assortment problem under the multinomial logit model with multiple customer types is NP‐complete. Although there are heuristics to find good assortments, it is difficult to verify the optimality gap of the heuristics. In this study, motivated by the difficulty of finding optimal solutions and verifying the optimality gap of heuristics, we develop an approach to construct an upper bound on the optimal expected revenue. Our approach can quickly provide upper bounds and these upper bounds can be quite tight. In our computational experiments, over a large set of randomly generated problem instances, the upper bounds provided by our approach deviate from the optimal expected revenues by 0.15% on average and by less than one percent in the worst case. By using our upper bounds, we are able to verify the optimality gaps of a greedy heuristic accurately, even when optimal solutions are not available.     

Tractable Consideration Set Structures for Assortment Optimization and Network Revenue Management

Discrete‐choice models are widely used to model consumer purchase behavior in assortment optimization and revenue management. In many applications, each customer segment is associated with a consideration set that represents the set of products that customers in this segment consider for purchase. The firm has to make a decision on what assortment to offer at each point in time without the ability to identify the customer's segment. A linear program called the Choice‐based Deterministic Linear Program (CDLP) has been proposed to determine these offer sets. Unfortunately, its size grows exponentially in the number of products and it is NP‐hard to solve when the consideration sets of the segments overlap. The Segment‐based Deterministic Concave Program with some additional consistency equalities (SDCP+) is an approximation of CDLP that provides an upper bound on CDLP's optimal objective value. SDCP+ can be solved in a fraction of the time required to solve CDLP and often achieves the same optimal objective value. This raises the question under what conditions can one guarantee equivalence of CDLP and SDCP+. In this study, we obtain a structural result to this end, namely that if the segment consideration sets overlap with a certain tree structure or if they are fully nested, CDLP can be equivalently replaced with SDCP+. We give a number of examples from the literature where this tree structure arises naturally in modeling customer behavior.     

Assortment Planning for Vertically Differentiated Products

We consider the problem of a retailer managing a category of vertically differentiated products. The retailer has to pay a fixed cost for each product included in the assortment and a variable cost per product sold. Quality levels, fixed, and variable costs are exogenously determined. Customers differ in their valuation of quality and choose the product (if any) that maximizes their utility. First, we consider a setting in which the selling prices are also fixed. We find that the optimal set of products to offer depends on the distribution of customer valuations and might include dominated products, that is, products which are less attractive than at least one other product, on every possible dimension. We develop an efficient algorithm to identify an optimal assortment. Second, we consider a setting in which the retailer also determines the selling prices. We show that in this case the optimal assortment does not include any dominated product and does not vary with the distribution of customer valuations when there is no fixed cost. We develop several efficient algorithms to identify an optimal assortment and optimally price the products. We also test the applicability of our methods with realistic data for two product categories.     

谈讽喻的定义及分类

讽喻作为一种修辞格已基本为学者认可,只是,各家对讽喻的定义与分类还有出入。有鉴于此,在综合考察各家见解的基础上,结合讽喻的运用现实,对讽喻重新做了较全面的界定,并且将分类标准与名称也做了校正,分为寓言和类寓言两类。在为讽喻下定义和探讨分类的过程中,较详细地辨析了讽喻与引用、比喻之间的关系。     

清代词学文献的整理和研究

清代词学理论文献的主要形式有词话、词选、论词诗词、词律词韵、序跋批注、书札专论文等。本文分别评介了清代词学文献诸种形式的特点以及近年来学界研究的进展。     

从东亚汉文学看《瞿佑全集校注》之整理

通过对《瞿佑全集校注》的解读,认为其在现存瞿佑作品的发掘上有新的突破,辨伪精细,直面瞿佑研究领域的关键疑难问题,在此基础上,对由《瞿佑全集》的整理而引发的期待与展望进行了蠡测。     

Improving Profits by Bundling Vertically Differentiated Products

We consider a firm managing a category of vertically differentiated goods, that is, products which differ with respect to an attribute for which all consumers prefer more to less. The goods can be sold individually, in which case they are referred to as components, or in bundles. The firm chooses the assortment of components and bundles and their selling prices to maximize profit. We show that each bundling strategy (pure components, pure bundling or mixed bundling) can be optimal and obtain closed‐form expressions for the optimal selling prices. We provide insights on the structure of the optimal assortment and prices. In particular, we show that, when consumers benefit from consuming the components jointly, the products in the optimal assortment form nested sets. When consumers do not benefit from the joint consumption of components, the bundles should be offered at a positive discount. We find that bundling vertically differentiated products can significantly improve profits, even if consumers do not benefit from consuming the components jointly. The value of bundling comes from increased sales: a firm, which understands that its customers may buy multiple types of components, offers bundles of components, incentivizing customers to buy more.     

发扬蜀学传统,开展儒学研究--"四川大学《儒藏》工程"笔谈摘要

<儒藏>是四川大学承担的国家"211工程"、"985工程"规划项目,中国孔子基金会"重大项目".经过数年努力,首批50册于2005年5月正式出版,已引起学术界和社会各界的关注和评议.这里搜集和摘录了李学勤、张立文等专家学者关于川大<儒藏>首批成果的评议,汇录了郭齐、李文泽等<儒藏>参与者关于<儒藏>编纂体例的讨论.     

Product Assortment and Price Competition under Multinomial Logit Demand

The role of assortment planning and pricing in shaping sales and profits of retailers is well documented and studied in monopolistic settings. However, such a role remains relatively unexplored in competitive environments. In this study, we study equilibrium behavior of competing retailers in two settings: (i) when prices are exogenously fixed, and retailers compete in assortments only; and (ii) when retailers compete jointly in assortment and prices. For this, we model consumer choice using a multinomial Logit, and assume that each retailer selects products from a predefined set, and faces a display constraint. We show that when the sets of products available to retailers do not overlap, there always exists one equilibrium that Pareto‐dominates all others, and that such an outcome can be reached through an iterative process of best responses. A direct corollary of our results is that competition leads a firm to offer a broader set of products compared to when it is operating as a monopolist, and to broader offerings in the market compared to a centralized planner. When some products are available to all retailers, that is, assortments might overlap, we show that display constraints drive equilibrium existence properties.