检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:姚升保[1]
机构地区:[1]中南财经政法大学工商管理学院,湖北武汉430073
出 处:《中国管理科学》2013年第6期132-138,共7页Chinese Journal of Management Science
基 金:教育部人文社会科学研究青年基金项目(09YJC630229);中央高校基本科研业务费专项资金资助项目(31541110807)
摘 要:以采购问题为背景研究多属性拍卖问题,其中拍卖问题的特点是:(1)包含任意有限个属性;(2)买卖双方的效用函数均具有加性结构,且在除价格以外的单个属性上,买方的效用函数和卖方的成本函数均为一般幂函数形式。首先,设计了一种买方事先公布评分函数而卖方轮流提交投标的多属性英式拍卖机制;其次,在卖方对称的假设下分析了拍卖机制中的最优投标策略,确定了最优投标价格和最优非价格属性值;然后,分析得出了最具成本优势的卖方最终胜出的条件以及最优多属性投标;最后,计算了该拍卖机制中买方的期望收益,并求出了使其期望收益最大化的最优评分函数权重。In this paper, multi-attribute auction is studied in the context of procurement. The considered auction problem has the following two characteristics. One is that the auction contains any finite attributes,conother one is that the utility functions of the auctioneer and the bidders are additive power functions. Firstly, a multi-attribute English auction is designed in which the auctioneer announce the scoring function in advance and the bidders submit bids one by one. Secondly, the optimal bidding strategy of the bidders is analyzed based on the assumption that bidders are symmetry. The optimal bidding price and the optimal values of the non-price attributes are determined. Thirdly, it is proved that the bidder with the lowest cost will win at last only if the minimal increment is small enough. Furthermore, the winning bid can be predicted. At last, the expected payoff of the buyer in the proposed auction is estimated. From the buyer's point of view, the optimal values of the announced weights of the scoring function are calculated.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38