基于多数量需求拍卖机制的动态存贮/分配模型

该文分析了折扣准则下基于多数量需求拍卖机制的多阶段存贮问题,运用动态规划方法,在有限阶段对该问题研究了每个时期应该出售的最优产品数量、最优分配方案和最优订购策略,提出了运用修正的多需求二级价格拍卖模型来实现最优分配,并对无限阶段下的动态存贮/分配问题进行了讨论.     

拍卖网站多物品多批次拍卖收益分析研究

考虑到网上拍卖的特性,包括竞标者随机到达,末尾抢标效应,拍卖平台的存在和收费,以及多物品多批次,文中系统地研究了拍卖品不设置保留价和设置保留价时拍卖网站的收益问题,并利用动态规划模型求解了拍卖网站多物品多批次拍卖时的最优总收益,证明了在降低陈列费和增加佣金比例的同时,缩短拍卖时间有利于设计出激励相容的最优拍卖机制.     

国债招标拍卖的最优机制:数量与价格歧视

过去已有相当多的文献讨论国债拍卖,米勒和弗雷德曼认为统一价格比歧视价格拍卖有比较优势.研究国债拍卖最优分配方式的选择问题,采用最优机制设计方法分析国债拍卖活动,内生地得到最优拍卖机制.然而结果表明,如果使用价格歧视及数量歧视(定量分配),那么政府的销售收益会得到改善,这是一个最优拍卖机制,不同于米勒和弗雷德曼的观点.     

收入管理的MMV动态拍卖机制研究

随着互联网上交易的增多,多单位同质产品销售的拍卖机制成为了一个新的研究方向.针对易逝性服务产品的收入管理问题,提出将产品销售分为多个拍卖期的MMV(Multi-period and Multi-unit Vickrey(Auction with Reserve Pricing)动态拍卖机制,给出每期最优拍卖单位数和保留价格的确定方法,证明了最优拍卖单位数分别关于剩余存量和销售时间单增的性质,以及保留价格关于剩余存量的单降性.最后证明MMV机制的每期实际成交价格将高于Vulcano(2002)提出的MSP(Modified Second-Price)机制,根据易逝性服务产品的需求特点得到MMV机制优于MSP机制的结论.     

基于网上拍卖的共同价值托投标分析

基于信息不对称条件下的共同价值模型,刻画了网上拍卖过程中可能存在的托投标行为,并运用博弈理论结合竞价关系求解了竞标者的赢标概率和最优竞价策略．研究发现,在共同价值模型下,参与竞标的人数与嬴者诅咒的发生存在联系;在最高出价者赢标的概率模型基础上,分别建立了是否存在托投标行为时的竞标者收益模型,并求解了竞标者的均衡竞价策略．     

多物品网上拍卖机制中最优保留价比较分析

虑到网上拍卖的特性,包括竞标者随机到达、末尾抢标效应、拍卖平台的存在和收费等,文中系统地研究了多物品网上拍卖中的保留价问题.在同一分析框架下,分别求解了卖家不设定保留价和设定保留价时最优保留价所应满足的条件及影响因素,并证明了不公开保留价能给卖家带来更多的期望利润.     

基于在线拍卖的风险投资退出股权交易

为满足外部投资者随时到达网络拍卖平台购买股权的需求,建立了基于在线拍卖的风险投资退出股权交易模型,通过求解模型得到了最优股权在线拍卖机制.机制不仅可在完全未知将来投标和决策序列的情况下,立即对当前投标做出分配和支付的决策,而且能吸引外部投资者自愿参与,激励他们报告真实的股权估价信息以及到达和离开时间,并在此基础上,实现风险投资家的期望收益最大化.最后,通过一个简单算例验证了该机制的可行性和可操作性.     

城市再生水BOT项目特许经营权竞标机制设计

本文研究了城市再生水BOT项目特许经营权竞标机制设计问题.运用激励机制设计思想建立了满足个体理性和激励相容约束的拍卖模型,并通过求解此模型得到了最优的拍卖机制.最优拍卖机制不仅能诱导企业真实地披露自己的成本类型,还能提高政府对社会资源的配置效率.     

加工时间离散可控的分批配送排序问题

研究了工件的加工时间是离散可控的,并且工件加工完后需要分批配送到客户的单机排序问题.一个客户在初始时刻将一批工件交给一个制造商进行加工.每个工件有多种加工模式,分配给每个工件的加工资源越多,则其加工时间越短.工件生产完后需要分批配送到客户处,每一批需要花费一定的时间和费用.研究了排序理论中主要的四个目标函数,构建了单机情况下的具体模型,分析了问题的复杂性,对具体的问题给出了它们的最优算法.     

基于价格歧视策略的多单元逆向多属性英式拍卖机制

针对现有的多单元逆向多属性拍卖机制的市场分配效率都比较低,不利于社会效益最大化和采购双方长期合作等问题,设计了高效率的基于价格歧视策略的多单元逆向多属性英式拍卖机制,利用线性混合整数规划建立了赢者确定模型,并基于新建立的拍卖机制给出了拍卖流程和投标策略,为供应商提供投标决策支持。然后通过设计数值实例和对比模拟实验收集数据,采取统计分析的方法验证了新设计的拍卖机制市场分配效率和采购方的效益都比较高。上述研究结果适用于通过逆向多属性拍卖与信息技术相结合的网上自动化多单元商品采购。     

Competing trade mechanisms and monotone mechanism choice

We investigate the choice between posted prices and auctions of competing sellers with private valuations. Assuming that buyers face higher hassle costs in auctions, we show the existence of monotone pure strategy equilibria where sellers offer posted prices rather than auctions if and only if they have a sufficiently high reservation value. Posted prices sell with lower probability but yield a larger revenue in case of trade. Using an empirical strategy to compare revenues of posted prices and auctions that takes selling probabilities explicitly into account, we find our theoretical predictions supported by data from eBay auctions on ticket sales for the EURO 2008 European Football Championship.     

Coasian dynamics in repeated English auctions

We extend the Coase conjecture to the case of a seller with a single object, who faces n potential buyers and holds a sequence of English auctions until the object is sold. In an independent-private-values environment in which buyers and sellers share the same discount factor, we show that the (perfect Bayesian) equilibrium path of reserve prices obeys a Coasian logic. Moreover, the equilibrium reserve path lies below that for the repeated sealed-bid, second-price auctions studied by McAfee and Vincent (in Games Econ Behav 18:246–276). Nevertheless, the open (English) and sealed-bid formats are shown to be revenue equivalent.     

Dynamic lot-sizing in sequential online retail auctions

Retailers often conduct non-overlapping sequential online auctions as a revenue generation and inventory clearing tool. We build a stochastic dynamic programming model for the seller’s lot-size decision problem in these auctions. The model incorporates a random number of participating bidders in each auction, allows for any bid distribution, and is not restricted to any specific price-determination mechanism. Using stochastic monotonicity/stochastic concavity and supermodularity arguments, we present a complete structural characterization of optimal lot-sizing policies under a second order condition on the single-auction expected revenue function. We show that a monotone staircase with unit jumps policy is optimal and provide a simple inequality to determine the locations of these staircase jumps. Our analytical examples demonstrate that the second order condition is met in common online auction mechanisms. We also present numerical experiments and sensitivity analyses using real online auction data.     

A note on sequential auctions with multi-unit demand

Within the independent private value paradigm, this note first analyzes two-round sequential first-price auctions with multi-unit demand. We show that the expected price in the first round is strictly lower than that in the second round due to the “extraction effect”. We then compare the revenues for the sequential auctions and the simultaneous auctions. We show that the discriminatory auction, the Vickrey auction, and the sequential second-price auctions generate the same revenue for the seller, followed in order by the sequential first-price auctions, and by the uniform-price auction.     

车辆牌照拍卖模型

提出多个相同物品(如车辆牌照)同时密封拍卖的模型，给出对称均衡竞标策略；证明了该拍卖方式与第一价格密封连续拍卖产生相同的预期收益；对估价为均匀分布的拍卖预期收益进行了研究。     

On the robustness of non-linear personalized price combinatorial auctions

Though the VCG auction assumes a central place in the mechanism design literature, there are a number of reasons for favoring Iterative Combinatorial Auctions (ICAs). Several promising ICA formats were developed based on primal–dual and subgradient algorithms. Prices are interpreted as a feasible dual solution and the provisional allocation is interpreted as a feasible primal solution. iBundle(3), dVSV and Ascending Proxy Auction result in VCG payoffs when the coalitional value function satisfies buyer submodularity and bidders bid straightforward, which is an ex-post Nash equilibrium in this case. iBEA and CreditDebit auctions do not even require the buyer submodularity and achieve the same properties for general valuations. Often, however, one cannot assume straightforward bidding and it is not clear from the theory how these non-linear personalized price auctions (NLPPAs) perform in this case. Robustness of auctions with respect to different bidding behavior is a critical issue for any application. We conducted a large number of computational experiments to analyze the performance of NLPPAs with respect to different bidding strategies and valuation models. We compare NLPPAs with the VCG auction and with ICAs with linear prices, such as ALPS and the Combinatorial Clock Auction. While NLPPAs performed very well in case of straightforward bidding, we observe problems with revenue, efficiency, and speed of convergence when bidders deviate.     

Combining guaranteed and spot markets in display advertising: Selling guaranteed page views with stochastic demand

While page views are often sold instantly through real-time auctions when users visit websites, they can also be sold in advance via guaranteed contracts. In this paper, we present a dynamic programming model to study how an online publisher should optimally allocate and price page views between guaranteed and spot markets. The problem is challenging because the allocation and pricing of guaranteed contracts affect how advertisers split their purchases between the two markets, and the terminal value of the model is endogenously determined by the updated dual force of supply and demand in auctions. We take the advertisers’ purchasing behaviour into consideration, i.e., risk aversion and stochastic demand arrivals, and present a scalable and efficient algorithm for the optimal solution. The model is also empirically validated with a commercial dataset. The experimental results show that selling page views via both channels can increase the publisher’s expected total revenue, and the optimal pricing and allocation strategies are robust to different market and advertiser types.     

Hats,auctions and derandomization

We investigate derandomizations of digital good randomized auctions. We propose a general derandomization method which can be used to show that for every random auction there exists a deterministic auction having asymptotically the same revenue. In addition, we construct an explicit optimal deterministic auction for bi‐valued auctions. © 2013 Wiley Periodicals, Inc. Random Struct. Alg., 46, 478–493, 2015     

Charity auctions for the happy few

Recent literature has shown that all-pay auctions raise more money for charity than either winner-pay auctions or lotteries. We demonstrate that first-price and second-price winner-pay auctions have a better revenue performance than first-price and second-price all-pay auctions when bidders are sufficiently asymmetric. Lotteries can also provide higher revenue than all-pay auctions. To prove this, we consider a framework with complete information. Complete information is helpful and may reflect events that occur, for instance, in a local service club (such as a voluntary organization) or at a show-business dinner.     

Multiple unit auctions with economies and diseconomies of scale

This paper discusses multiple unit auctions for industrial procurement where the cost structures of suppliers capture economies and diseconomies of scale caused by the nature of the production cost and the opportunity value of suppliers’ capacities. The problem of winner determination and demand allocation is proven to be NP-complete. We propose a binary tree algorithm with bounds (BTB) which efficiently exploits the model’s optimality properties. BTB outperforms general integer optimization software in computational time, especially with existence of substantial economies and diseconomies of scale. The algorithm complexity is linear in demand volume. This property allows for efficient handling of high volume auctions and thus leads to increased benefit for the overall system. Under the assumption of the myopic best response strategies, we investigate the behavior of suppliers and price dynamics for iterative (multiple round) bidding with appropriate allocation and stopping rules. The allocation rules, featured by several tie breakers for multiple optimal solutions to the allocation model in each round, are proposed to induce suppliers’ dominant strategies and to improve the system’s performance.