检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学管理学院 [2]华南理工大学工商管理学院,广州510641
出 处:《系统管理学报》2007年第6期590-595,共6页Journal of Systems & Management
基 金:中国博士后科学基金资助项目(20060400221)
摘 要:运用在线算法与竞争分析方法,研究了网络环境下当供应商在不同时刻到达,并投标而要求采购商接到每个投标时立即做出决策的在线反向拍卖机制。首先,证明了基于采购商需求曲线的在线反向拍卖是激励相容在线反向拍卖的充分必要条件。其次,对无限可分商品,在采购商需求量一定的前提下,运用文中给出的基于投标价格上涨威胁的策略,找到了采购商竞争的需求曲线,并求出了该在线策略相对于Vickrey反向拍卖策略的竞争比。最后,给出了在线反向拍卖操作的算法框架,并通过实例进行了说明。In this paper, we use the method of online algorithm and competitive analysis to study online reverse auctions, which are in a setting of internet where the different bidders arrive at different times and the reverse auction mechanism is required to make decisions about each bid as it is received. First, we show that an online reverse auction is incentive compatible if and only if the auction is based on a demand curve. Second, for the unlimited divisible commodity, we derive the competitive demand curve about an online reverse auction under the condition of the fixed demand by means of the bids increasing threat-based strategy. We prove that the reverse auction based on the demand curve is competitive with respect to the Vickery reverse auction, and the competitive ratio can be obtained. Finally, we present the operational process of the algorithm, and illuminate it by an example.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13