A Framework for Facilitating Sourcing and Allocation Decisions for Make‐to‐Order Items

This paper provides a fundamental building block to facilitate sourcing and allocation decisions for make‐to‐order items. We specifically address the buyer's vendor selection problem for make‐to‐order items where the goal is to minimize sourcing and purchasing costs in the presence of fixed costs, shared capacity constraints, and volume‐based discounts for bundles of items. The potential suppliers for make‐to‐order items provide quotes in the form of single sealed bids or participate in a dynamic auction involving open bids. A solution to our problem can be used to determine winning bids amongst the single sealed bids or winners at each stage of a dynamic auction. Due to the computational complexity of this problem, we develop a heuristic procedure based on Lagrangian relaxation technique to solve the problem. The computational results show that the procedure is effective under a variety of scenarios. The average gap across 2,250 problem instances is 4.65%.     

Bidding under auctioneer default risk

In a financially turbulent economy, participants of a procurement auction should consider in their bids the event of default of the auctioneer, which may result to substantial damages for the winning bidder. We examine a sealed bid auction, with private cost values and interdependence among the beliefs of the bidders about the auctioneer׳s default risk. The probability of payment of the bid price by the auctioneer is estimated by each bidder. For a first and a second price auction, we derive equilibrium bidding strategies, which address the risk of default and optimally adjust the bid price, introducing a risk premium in the form of an additional mark-up. A numerical illustration of the proposed strategies is provided. The effect of auctioneer׳s risk of default on the procurement project cost is examined. Financial arrangements that may be used to relax or eliminate the effect of the risk of default, such as early payment methods, third party guarantees or insurance programs are discussed and evaluated in comparison with the approach of risk premium on bid price.     

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.     

开放式逢低买入中买家数量确定的投标决策

逢低买入是一种新型的在线动态价格机制。本文以B2B开放式逢低买入拍卖为研究对象,在买家数量确定且独立投标的条件下,将已有的针对两个价格水平下买家最优订货决策拓展到更复杂的多个价格水平的最优订货决策问题。本文提出的零售商投标决策定理,不仅满足了买家的实际需求,也提高了决策的实用性。     

基于幂效用函数的多属性英式拍卖研究

以采购问题为背景研究多属性拍卖问题,其中拍卖问题的特点是：（1）包含任意有限个属性;（2）买卖双方的效用函数均具有加性结构,且在除价格以外的单个属性上,买方的效用函数和卖方的成本函数均为一般幂函数形式。首先,设计了一种买方事先公布评分函数而卖方轮流提交投标的多属性英式拍卖机制;其次,在卖方对称的假设下分析了拍卖机制中的最优投标策略,确定了最优投标价格和最优非价格属性值;然后,分析得出了最具成本优势的卖方最终胜出的条件以及最优多属性投标;最后,计算了该拍卖机制中买方的期望收益,并求出了使其期望收益最大化的最优评分函数权重。     

The Dynamic Pivot Mechanism

We consider truthful implementation of the socially efficient allocation in an independent private‐value environment in which agents receive private information over time. We propose a suitable generalization of the pivot mechanism, based on the marginal contribution of each agent. In the dynamic pivot mechanism, the ex post incentive and ex post participation constraints are satisfied for all agents after all histories. In an environment with diverse preferences it is the unique mechanism satisfying ex post incentive, ex post participation, and efficient exit conditions. We develop the dynamic pivot mechanism in detail for a repeated auction of a single object in which each bidder learns over time her true valuation of the object. The dynamic pivot mechanism here is equivalent to a modified second price auction.     

An Experimental Investigation of Procurement Auctions with Asymmetric Sellers

Electronic reverse auctions are a commonly used procurement mechanism. Research to date has focused on suppliers who are ex ante symmetric in that their costs are drawn from a common distribution. However, in many cases, a seller's range of potential costs depends on their own operations, location, or economies of scale and scope. Thus, understanding how different bidder types impact auction outcomes is key when designing an auction. This study reports the results of the first controlled laboratory experiment designed to compare prices between first‐price and second‐price procurement auctions for homogeneous goods when seller cost types are asymmetric and the number of bidders varies. The results indicate that first‐price auctions generate lower prices regardless of market composition. The results also reveal that first‐price auctions are at least weakly more efficient than second‐price auctions despite the theoretical prediction that the reverse should hold in asymmetric auctions. Post hoc analysis of individual bidders' behavior in first‐price auctions revealed evidence that bidders systematically underbid when their cost realizations were close to the lower bound. Furthermore, bidders adjust their behavior based on the type of the other bidders in the market in a manner inconsistent with theory. Consequently, adding a third bidder to a two‐bidder market is not advantageous to the buyer unless that third bidder is a low‐cost type.     

The Effect of Timing on Jump Bidding in Ascending Auctions

We investigate the role of timing in ascending auctions under the premise that time is a valuable resource. Traditional models of the English auction ignore timing issues by assuming that the auction occurs instantaneously. However, when auctions are slow, as Internet auctions used for procurement often are, there are significant opportunity or monitoring costs to bidders, and the choice of the size of the jump bid becomes a strategic decision. We study the choice in the experimental laboratory by systematically varying the opportunity costs associated with fast bidding. When time is more valuable bidders respond by choosing larger jump bids. Surprisingly, the economic performance of the auction is not significantly affected. We develop a simple model of ascending auctions with impatient bidders that provides insights into the effect jump bids have on auction performance.     

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.     

基于“柠檬”理论的在线信誉反馈系统有效性研究

信任问题是困扰在线拍卖市场发展的瓶颈之一.在线信誉反馈系统在消除信息不对称性,解决在线拍卖市场逆向选择问题中发挥着重要的作用.首先分析在线拍卖市场中逆向选择问题产生的原因,而后基于"柠檬"理论,从更换交易对手的重复博弈角度分析在线信誉反馈系统中信誉运行模型,对在线拍卖市场的信誉运行机理进行分析.研究指出在线信誉反馈系统能激励卖家诚信交易,一定程度上降低逆向选择问题,为我国在线拍卖网站和网络卖家更好地实施网络声誉战略提供一个思路.     

Procurement with Reverse Auction and Flexible Noncompetitive Contracts

This article investigates a hybrid procurement mechanism that combines a reverse auction with flexible noncompetitive contracts. A buyer adopts such mechanism to procure multiple units of a product from a group of potential suppliers. Specifically, the buyer first offers contracts to some suppliers who, if accepting the contract, do not participate in the auction while committing to selling a unit to the buyer at the price of the subsequent auction. For the suppliers rejecting the offers, they can join the subsequent auction with the other suppliers to compete on the remaining units. When the buyer offers only one flexible noncompetitive contract, we find that the selected supplier may accept the offer regardless of whether he knows his exact cost information. Meanwhile, the buyer can benefit from offering such a contract, as opposed to solely conducting a regular reverse auction or offering a noncompetitive contract that does not allow suppliers declining offers to join the subsequent auction. Moreover, we find that the suppliers' information about their own costs has a significant impact on the buyer's decision. When the buyer makes multiple offers, we analyze the resulting game behavior of the selected suppliers and demonstrate that the buyer can benefit more than just offering one such contract. Therefore, the hybrid procurement mechanism can be mutually beneficial for both the buyer and the selected suppliers.     

Increasing Revenue by Decreasing Information in Procurement Auctions

We report on results of several laboratory experiments that investigate on‐line procurement auctions in which suppliers bid on price, but exogenous bidder quality affects winner determination. In procurement auctions, bidder quality may or may not be publicly known to all bidders, and the effect of this quality transparency on the auction outcome is one aspect of auction design that we examine. The second aspect of auction design that we examine is the effect of price visibility on the auction outcome, and the interaction between price visibility and quality transparency. In terms of price visibility, we consider two extreme cases: the sealed bid request for proposals (RFPs), and the open‐bid dynamic auction event. In terms of bidder quality transparency, we also consider two extreme cases: a setting in which bidder qualities are publicly known and the case in which they are private. We find that in our laboratory experiments, the RFP format is consistent in generating higher buyer surplus levels than does the open‐bid dynamic format. This advantage is independent of the quality transparency. In contrast, the open‐bid format is highly sensitive to quality transparency, generating significantly lower buyer surplus levels when the information about bidder quality is public.     

AUCTION DESIGN WITHOUT COMMITMENT

In anonymous platforms like the Internet, committing to honor the outcome of an auction is difficult since the seller can benefit by reauctioning the good. We argue that how information is processed within the auction mechanism is crucially important in such circumstances. In our model, the seller uses an intermediary to extract information from the buyers but is not tied to sell the good with terms that the mechanism proposes. Instead, she may reauction the good again via some other intermediary. There are no restrictions on how many times and through which mechanisms the good can be reauctioned. The buyers may also choose their outside option at any stage of the game. We argue that a sequentially rational seller can only implement a version of the English auction, in particular the popular version where bidders employ proxy bids. This is a consequence of the informational properties of the English action: it reveals just the right information for the seller to be able to commit to the mechanism.     

Market‐Based Allocation with Indivisible Bids

We study multiunit double auctions accepting bids with indivisibility constraints. Modeling the auction problem as a Multiple Choice Knapsack Problem and using dynamic programming, we show that incremental computations during bid processing can speed the handling of key auction operations such as clearing and quoting. We propose different price‐quote policies and study their influence on the efficiency of market‐based allocation. Using a reconfigurable manufacturing scenario where agents trade large quantities of multiple goods, we demonstrate potential benefits of supporting indivisibility constraints in bidding. These benefits are highly sensitive to the form of price quote provided, indicating interesting tradeoffs in communication and allocation efficiency.     

Optimal Nonparametric Estimation of First‐price Auctions

This paper proposes a general approach and a computationally convenient estimation procedure for the structural analysis of auction data. Considering first‐price sealed‐bid auction models within the independent private value paradigm, we show that the underlying distribution of bidders' private values is identified from observed bids and the number of actual bidders without any parametric assumptions. Using the theory of minimax, we establish the best rate of uniform convergence at which the latent density of private values can be estimated nonparametrically from available data. We then propose a two‐step kernel‐based estimator that converges at the optimal rate.     

Design of Auction Parameters to Reduce the Effect of Collusion

Government departments are increasingly turning to auctions to procure goods and services. Collusion among bidders, however, reduces competition and raises winning bid prices. Since conventional collusion control measures based on the redesign of auction mechanisms are less effective in government procurement auctions, there is a need to devise control measures that decrease the effect of collusion. This article demonstrates how the principles of design of experiments can be applied in a system dynamics model to find the auction parameter values that substantially reduce the effect of collusion in government procurement auctions. This research makes a number of contributions. First, it develops a feedback‐based dynamic mechanism of collusion in government procurement auctions. The mechanism proposes the winning bid price as being determined not by the total number of bidders but by the number of independent bidders. It defines each cartel as one independent bidder regardless of the number of bidders in the cartel. Second, the mechanism is tested by developing a system dynamics model to government auctions for procuring contracts for roadwork projects in India. Third, the principles of experimental design are applied to find the auction parameter values that ensure high bid participation and low winning price‐to‐reserve price ratios.     

Facts and Theories of the Italian Labour Market (1970-1985): A Time Series Analysis of Wages,Employment and Prices

ABSTRACT: ln this paper an attempt is made to determine whether observed patterns of intertemporal variability in a number of Italian labour market characteristics are consistent with the predictions forthcoming from three prominent models of aggregate labour market behaviour. The behavioral models included in the analysis are: a) intertemporal substitution labour supply, b) staggered wage contracts, and c) intertemporal labour demand with adjustment costs. The empirical results provide relatively more support for the validity of the adjustment cost model.     

An Analysis of Scoring and Buyer‐Determined Procurement Auctions

In procurement auctions, the object for sale is a contract, bidders are suppliers, and the bid taker is a buyer. The suppliers bidding for the contract are usually the current supplier (the incumbent) and a group of potential new suppliers (the entrants). As the buyer has an ongoing relationship with the incumbent, he needs to adjust the bids of the entrants to include non‐price attributes, such as the switching costs. The buyer can run a scoring auction, in which suppliers compete on the adjusted bids or scores, or, he can run a buyer‐determined auction, in which suppliers compete on the price, and the buyer adjusts a certain number of the bids with the non‐price attributes after the auction to determine the winner. Unless the incumbent has a significant cost advantage over the entrants, I find that the scoring auction yields a lower average cost for the buyer, if the non‐price attributes are available. If the non‐price attributes are difficult or expensive to obtain, the buyer could run a buyer‐determined auction adjusting only the lowest price bid.     

Valuing Dealers' Informational Advantage: A Study of Canadian Treasury Auctions

In many financial markets, dealers have the advantage of observing the orders of their customers. To quantify the economic benefit that dealers derive from this advantage, we study detailed data from Canadian Treasury auctions, where dealers observe customer bids while preparing their own bids. In this setting, dealers can use information on customer bids to learn about (i) competition, that is, the distribution of competing bids in the auction, and (ii) fundamentals, that is, the ex post value of the security being auctioned. We devise formal hypothesis tests for both sources of informational advantage. In our data, we do not find evidence that dealers are learning about fundamentals. We find that the “information about competition” contained in customer bids accounts for 13–27% of dealers' expected profits.     

A Dynamic Reinterpretation of Nash Bargaining With Endogenous Threats

This paper concerns the two‐stage game introduced in Nash (1953). It formalizes a suggestion made (but not pursued) by Nash regarding equilibrium selection in that game, and hence offers an arguably more solid foundation for the “Nash bargaining with endogenous threats” solution. Analogous reasoning is then applied to an infinite horizon game to provide equilibrium selection in two‐person repeated games with contracts. In this setting, issues about enforcement of threats are much less problematic than in Nash's static setting. The analysis can be extended to stochastic games with contracts.