随机需求条件下的P2P网络借贷拍卖机制

在P2P网络借贷契约中,提供了一种关于随机借款需求的两阶段关闭式降价拍卖,并构成了借款人的一个最优机制。对此,首先设计借贷契约以确定初始借款需求;随后以事前对称贷款人为基准建立相应的拍卖模型,并进行一次标准的关闭式降价拍卖,再从中标贷款人中获得一个额外的借款需求;最后将这个机制拓展到事前非对称贷款人的情形,以分析非对称情形下的拍卖过程,并通过算例加以说明。这个机制对借款人是最优的,而且借款人和贷款人都比较熟悉这种简单拍卖,因此可以用于改进中国P2P网络借贷市场的交易机制。     

考虑再谈判的网上服务采购多属性拍卖研究

针对在线服务外包,研究了供应商投标服务方案(体现服务质量)和价格的买方决定制多属性采购拍卖,分析了交易双方关于服务内容的再谈判对供应商投标均衡、买方初始服务内容决策和各方期望利润的影响。结果表明,无再谈判情形下,供应商的服务质量投标均衡和信息租金都随初始服务内容递增;而有再谈判情形下,尽管买方对服务质量的评标权重随初始服务内容递增,但供应商服务质量、信息租金及买方期望利润都不受初始服务内容影响。换言之,初始服务内容对采购项目的规制作用被再谈判完全替代。不仅如此,相较于无再谈判情形,再谈判的存在能够激励供应商提供更高的服务质量,并促成更多的服务内容成交,最终使买方、获胜供应商和交易平台都获得更高期望利润。     

需求依赖于库存的易变质品在线采购问题研究

根据现实生活中常见的库存量越大越吸引消费者购买兴趣的现象,本文建立了需求依赖于库存的易变质品采购模型。在不假设价格服从任何分布的条件下,提出了采购价格不确定背景下的易变质品在线采购策略。本文采用在线问题及其竞争分析的方法来进行建模分析,设计出有效的在线竞争采购价格驱动的(s,S)策略,与离线最优策略进行比较,得出理论竞争比和最优经济采购数量和采购时间间隔。最后,通过数值算例说明该策略在现实中具有较好的实际竞争性能比,且在多个价格序列下都表现良好,从而说明了该策略是鲁棒的,可以为企业提供有价值的决策建议。     

固定价格与英式拍卖同时使用时顾客行为分析

很多网站采用在英式拍卖中加入固定价格选项的方式销售多件同类商品.我们证明了,在此规则下存在一个弱占优投标策略.若顾客对商品的估价低于固定价格,那么,当拍卖价格低于他的估价时,该顾客参与拍卖,且以自己的估价作为报价是他的弱占优投标策略;否则,当拍卖价格超过他的估价时,他退出拍卖.若顾客对商品的估价高于或等于固定价格,他会在参与拍卖和接受固定价格之间进行选择;若他参与拍卖,将固定价格作为报价是他的弱占优投标策略.我们发现,该顾客是选择参与拍卖、还是选择以固定价格购买主要依赖于顾客到达拍卖时距离拍卖结束的剩余时间.最后,通过算例,我们对影响顾客参与策略的因素进行了数值分析并得到了一些结论.     

Customer Behavior Modeling in Revenue Management and Auctions: A Review and New Research Opportunities

Customer behavior modeling has been gaining increasing attention in the operations management community. In this paper we review current models of customer behavior in the revenue management and auction literatures and suggest several future research directions.     

Keyword Auctions,Unit‐Price Contracts,and the Role of Commitment

Motivated by the enormous growth of keyword advertising, this paper explores the design of performance‐based unit‐price contract auctions, in which bidders bid their unit prices and the winner is chosen based on both their bids and performance levels. The previous literature on unit‐price contract auctions usually considers a static case where bidders' performance levels are fixed. This paper studies a dynamic setting in which bidders with a low performance level can improve their performance at a certain cost. We examine the effect of the performance‐based allocation on overall bidder performance, auction efficiency, and the auctioneer's revenue, and derive the revenue‐maximizing and efficient policies accordingly. Moreover, the possible upgrade in bidders' performance level gives the auctioneer an incentive to modify the auction rules over time, as is confirmed by the practice of Yahoo! and Google. We thus compare the auctioneer's revenue‐maximizing policies when she is fully committed to the auction rule and when she is not, and show that the auctioneer should give less preferential treatment to low‐performance bidders when she is fully committed.     

拍卖中的串通出价

本文在扩展的独立私有价值模型下,考虑第二价格和第一价格拍卖机制下的串通出价行为和卖方对串通出价的反映。第二价格串通出价机制和第一价格串通出价机制分别为在这两种拍卖机制下的激励相容、有效的直接显示串通出价机制。我们发现卖方若知道有串通行为,可以提高保留价来减少损失。由于卖方一般情况下不太可能确定是否存在串通行为及参与串通的人数k,但可以确定给定保留价时串通人数的'最优反应',在第二价格串通出价机制下,给定串通人数,增加保留价可以提高卖方的期望收益,对于确定的保留价,串通人数的增加会减少卖方的期望收益。从而存在这样的纳什均衡:所有的投标人串通,即,k=N,而卖方宣布与之相应的保留价r (N)。当然,并不是所有的串通出价对投标人都是有利可图的,在第一价格拍卖机制下,若卖方可以调整保留价,只有当参与竞投的人很多时,串通出价才有利可图。     

带佣金率和保留价的一级和二级价格拍卖

本文通过引入佣金率和保留价,分别讨论了一级和二级价格密封式拍卖,得到以下结论:(1)两种密封式拍卖的均衡报价随佣金率的提高而减少;(2)一级价格密封式拍卖的均衡报价随保留价的增加而增加,而二级价格密封式拍卖的均衡报价随保留价的增加而减少;(3)一级价格密封式拍卖的投标者预期收益与佣金率和保留价均呈反向变动,而二级价格密封式拍卖的投标者预期收益独立于佣金率和保留价;(4)收益等价定理仍然成立;(5)在两种密封式拍卖中,当佣金率增加时,卖方的预期收益减少,拍卖行的预期收益以及卖方和拍卖行的总预期收益可能增加也可能减少;(6)在两种密封式拍卖中,当保留价增加时,卖方的预期收益、拍卖行的预期收益以及卖方和拍卖行的总预期收益可能增加也可能减少;(7)给出了卖方的最优保留价的表达式;(8)把本文的结论与以前相应的研究工作做了比较。     

Behavior in Multi‐Unit Demand Auctions: Experiments with Uniform Price and Dynamic Vickrey Auctions

We experimentally investigate the sensitivity of bidders demanding multiple units of a homogeneous commodity to the demand reduction incentives inherent in uniform price auctions. There is substantial demand reduction in both sealed bid and ascending price clock auctions with feedback regarding rivals' drop‐out prices. Although both auctions have the same normal form representation, bidding is much closer to equilibrium in the ascending price auctions. We explore the behavioral process underlying these differences along with dynamic Vickrey auctions designed to eliminate the inefficiencies resulting from demand reduction in the uniform price auctions.     

网络销售中退货担保与定价决策

本文采用退货担保期权综合完全退货策略与部分退货策略的优点,构建了网络销售中基于期权的退货与定价模型,以商品的价格、退货策略和退货担保期权价格为决策变量,讨论了存在退货期权和不存在退货期权两种情况下,最优决策存在的条件,求解出销售商最优价格、退货策略和退货担保期权价格,分析了各个市场参数变化对最优值的影响,通过对担保退货期权与退货策略同时存在和购买期权才能退货二种策略的比较,发现供应商最优策略是前者。算例验证了以上结论,做了敏感性分析,总结了相关管理启示与未来研究方向。所得结论对网络销售商开展网上销售有重要参考价值。     

口碑效应下网络视频定价与广告投放最优决策

近年来,网络视频成为一种重要的新型消费内容,同时网络口碑对在线内容扩散的影响也日益深刻。本文考虑网络视频收费期内用户情绪效用产生的网络口碑对视频节目扩散过程的影响,运用数理分析方法,研究了网络视频运营商关于节目价格与广告投放量的最优决策问题,并分析了节目口碑属性、节目试看、节目体验质量和收费期等因素对最优决策结果的影响。研究发现,当付费用户与普通用户的视频体验质量差异足够大时,运营商将选择广告主导型策略(广告投放水平相对较高),反之则选择收费主导型策略(收费水平相对较高)。当节目口碑越好、试看时间越短、付费模式体验质量越低或免费模式体验质量越高时,运营商越倾向于选择收费主导型策略,相应的节目价格、广告投放量和运营商期望利润也将视条件发生不同变化。基于前述最优决策结果,运营商可进一步针对节目口碑属性对收费期进行优化。     

Optimal Reserve Prices in Name‐Your‐Own‐Price Auctions with Bidding and Channel Options

Few papers have explored the optimal reserve prices in the name‐your‐own‐price (NYOP) channel with bidding options in a multiple channel environment. In this paper, we investigate a double‐bid business model in which the consumers can bid twice in the NYOP channel, and compare it with the single‐bid case. We also study the impact of adding a retailer‐own list‐price channel on the optimal reserve prices. This paper focuses on achieving some basic understanding on the potential gain of adding a second bid option to a single‐bid system and on the potential benefits of adding a list‐price channel by the NYOP retailer. We show that a double‐bid scenario can outperform a single‐bid scenario in both single‐channel and dual‐channel situations. The optimal reserve price in the double‐bid scenario is no less than that in the single‐bid case. Furthermore, the addition of a retailer‐own list‐price channel could push up the reserve prices in both single‐bid and double‐bid scenarios.     

“线上销售/回收+线下服务”的闭环供应链定价与服务决策

对于“线上销售/回收+线下服务”的闭环供应链模式,研究了制造商在正向和逆向渠道中都与服务商进行收益共享情况下的最优销售/回收定价决策和最优服务水平决策,并比较了制造商领导的Stackelberg博弈、服务商领导的Stackelberg博弈、制造商与服务商Nash均衡博弈三种情形下的最优决策和最优利润。结果表明：最优的新产品销售价格和正向渠道服务水平均与正向渠道收益分成比例呈正相关;最优的废旧产品回收价格与逆向渠道收益分成比例呈负相关,而最优的逆向渠道服务水平与之呈正相关。制造商和服务商的最优利润不仅受正逆向渠道收益分成比例的影响,而且与新产品生产成本的大小有关：当新产品生产成本较小时,处于领导地位的一方获得的最优利润最大,而当新产品生产成本增大到一定程度后,对方处于领导地位时自身获得的最优利润反而最大,而双方均势时各自获得的最优利润均不占优。     

Optimal Control of Selling Channels for an Online Retailer with Cost‐per‐Click Payments and Seasonal Products

The problem studied in this paper is a predigestion of the decision faced by online retailers (etailers) that advertise on publisher or comparison‐shopping websites. An etailer may sell its product not only through its online and bricks‐and‐mortar stores, but also through the websites of one or more third parties (e.g., Yahoo.com). However, the etailer has to pay a certain amount to such third parties in an action‐based payment scheme, such as a cost‐per‐click (CPC) scheme. Under the CPC scheme, payment is based solely on click‐throughs, which means that the etailer pays only when a shopper clicks through to the product page of its website. Only a fraction of such clicks lead to actual sales. The extra cost that is associated with shoppers who first click through to the third‐party websites makes them less attractive as customers than those who directly visit the etailer's online store. Moreover, the CPC rate for a prominent placement is normally set by competitive bidding, and thus varies over time. Therefore, the etailer needs to decide dynamically whether or not to list on a third‐party website. The structural properties of the optimal policy are discussed, and numerical examples are given to show the revenue impact of dynamic listing control.     

First‐Price Auctions With General Information Structures: Implications for Bidding and Revenue

We explore the impact of private information in sealed‐bid first‐price auctions. For a given symmetric and arbitrarily correlated prior distribution over values, we characterize the lowest winning‐bid distribution that can arise across all information structures and equilibria. The information and equilibrium attaining this minimum leave bidders indifferent between their equilibrium bids and all higher bids. Our results provide lower bounds for bids and revenue with asymmetric distributions over values. We also report further characterizations of revenue and bidder surplus including upper bounds on revenue. Our work has implications for the identification of value distributions from data on winning bids and for the informationally robust comparison of alternative auction mechanisms.