消费者偏好背景下的买方抗衡势力形成与影响

与以往研究关注产业链内部因素不同,对于厂商利用消费者偏好因素的买方抗衡势力形成机理和影响的研究考虑了市场环境因素作用的买方抗衡势力理论研究新视角。将消费者偏好的市场差异建模为同一产品在不同市场中消费者效用差异,基于外部选择博弈和Hotelling博弈的基本原理,构建综合反映上、下游厂商纵向关系和市场内厂商间横向关系的博弈模型。对下游厂商跨市场并购前后均衡结果的变化进行考察,得到下游厂商利用消费者偏好特征形成自身买方抗衡势力的机理以及该行为对厂商本身和竞争对手谈判势力、收益水平和规模带来的影响。研究结果表明,存在消费者偏好差异的市场间厂商并购行为不仅可以提升合并厂商自身买方抗衡势力和收益,也不会对竞争对手造成负面影响,甚至可以提高部分竞争对手的买方抗衡势力、收益和规模,产生与水岸效应相反的结果。同时,对均衡结果进行福利分析,表明下游厂商的并购行为将提高总产业利润,但会降低消费者剩余和社会福利。     

企业主集权:边界理论的新观点

与企业主关系亲近会让经理人获得更多授权吗?本文借助边界理论的分析框架提出了一种新的理论逻辑,强调家族涉入管理会影响企业主边界行为策略,进而影响控制权配置行为。基于双样本和两重测量的实证研究发现,家族涉入管理与企业主集权程度正相关,而目前学界普遍认同的企业主与经理关系亲近就会向后者更多授权的命题,仅在家族不涉入管理的情况下成立,在家族涉入管理的情况下并不成立。上述研究结果表明,家族涉入管理容易诱导企业主将家长身份与企业家身份一体化,把职业经理也纳入家长式集权管理之下,即使他们与企业主之间建立起泛家族化的亲近关系,也不易获得企业主的更多授权。     

基于供应链金融的随机需求条件下的订货策略

本文将供应链金融中的融资问题融入到允许延迟支付的报童模型中,同时考虑了订货商的销售情况对偿还能力的影响,融资利息、销售收入利息以及支付信用期等现金管理要素,建立起订货商在连续随机需求条件下的库存管理模型,通过对模型的求解与灵敏度分析,对供应链金融模式下订货商的订货策略进行了深入探讨,得出了一系列有益的结论。所建立的模型同时为中小销售型企业提供一种新的资金获取以及确定订货策略的方法。     

中国企业渠道联盟关系影响因素研究

渠道联盟被认为是渠道关系中最高、最好的形式。学术界对渠道联盟关系影响因素的研究主要集中在承诺、信任、沟通与合作等方面。本文实证研究了影响中国企业渠道联盟关系的若干因素及其影响程度,特别是探讨了私人关系和行政因素等的影响程度。     

双寡头垄断市场的价格竞争与产品差异化策略——一个博弈论模型及其扩展

分析三阶段Bertrand-Stackelberg市场价格竞争与产品差异化选址策略,将之与Bertrand-Nash市场均衡进行静态比较;其次,构造一个具体的数字例子,演示随着产品差异化程度的提高,双寡头垄断市场中企业均衡利润的变动规律.在此基础上,识别经典的产品差异化定位博弈模型的各种假设条件,并在放松假设以讨论存在边际成本优势、消费者选择行为以及重复动态博弈的情形下,寡头垄断市场中的企业均衡利润和均衡价格的变化趋势及其稳定性问题.放松传统模型的假设条件有助于完整地理解和分析许多长期被孤立研究的产业竞争问题.     

市场时机对资本结构影响的持续度研究

市场股价信息会不断影响股权融资决策,对资本结构的影响甚至出现累积效应。为此,从中长期的角度探寻历史市场时机对公司资本结构形成和杠杆累计变动的影响,并具体测算出市场时机对资本结构影响的持续程度。研究表明,市场价格高的公司不仅在短时间内愿意进行股权融资,而且过去的市场价格信息也会对资本结构产生中长期的影响,在一定时间里不断累积。这种信息的影响大约会持续5年左右。     

基于反向物流的商品定价和退货政策研究

综述了基于反向物流的商品定价和退货政策的最新研究成果。在此基础上,通过建立模型,对基于反向物流的商品定价策略和退货政策进行了进一步的研究,并求出了商品的最优价格和最优退货价格。基于模型,对管理提出了一些建议。最后指出了将来可能的研究方向。     

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions

Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned n_i numbers with n_i lying in a given range. The goal is to maximize a Schur convex function F whose ith argument is the sum of numbers assigned to part i. The shape of a partition is the vector consisting of the sizes of its parts, further, a shape (without referring to a particular partition) is a vector of nonnegative integers (n₁,..., n_p) which sum to n. A partition is called size-consecutive if there is a ranking of the parts which is consistent with their sizes, and all elements in a higher-ranked part exceed all elements in the lower-ranked part. We demonstrate that one can restrict attention to size-consecutive partitions with shapes that are nonmajorized, we study these shapes, bound their numbers and develop algorithms to enumerate them. Our study extends the analysis of a previous paper by Hwang and Rothblum which discussed the above problem assuming the existence of a majorizing shape. This research is partially supported by ROC National Science grant NSC 92-2115-M-009-014.     

Optimal algorithms for uncovering synteny problem

The syntenic distance between two genomes is the minimum number of fusions, fissions, and translocations that can transform one genome to the other, ignoring the gene order within chromosomes. As the problem is NP-hard in general, some particular classes of synteny instances, such as linear synteny, exact synteny and nested synteny, are examined in the literature. In this paper, we propose a new special class of synteny instances, called uncovering synteny. We first present a polynomial time algorithm to solve the connected case of uncovering synteny optimally. By performing only intra-component moves, we then solve the unconnected case of uncovering synteny. We will further calculate the diameters of connected and unconnected uncovering synteny, respectively.     

Inapproximability and approximability of maximal tree routing and coloring

Let G be a undirected connected graph. Given g groups each being a subset of V(G) and a number of colors, we consider how to find a subgroup of subsets such that there exists a tree interconnecting all vertices in each subset and all trees can be colored properly with given colors (no two trees sharing a common edge receive the same color); the objective is to maximize the number of subsets in the subgroup. This problem arises from the application of multicast communication in all optical networks. In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Ω(g^1−ε)-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O√|E(G)|, which matches the theoretical bounds. Supported in part by the NSF of China under Grant No. 70221001 and 60373012.