A Stochastic Model for Bidding

Competitive bidding situations involve considering a multiplicity of factors. Organizations must be able to weigh the relative probability of potential projects based on resource usage, project duration and competitor actions to decide which of many possible bids to submit. A bidding strategy designed to maximize expected long run return is crucial, since an organization can usually submit only one bid per project.This paper presents a family of stochastic dynamic programming models considering different bidding situations. Several projects, each with several potential bids, are available for each situation. The objective is to determine what bidding strategy will maximize expected returns. Models are developed for two principle bidding situations: sequential, where projects are bid individually; and simultaneous, where several projects are bid at one time. Next, the effects of over- or under-commitment of resources are incorporated into the models. Finally, changes in project timing and the resultant effects on bidding strategy are included.A numerical example traces the changes in bidding strategy which occur as the models are expanded. The general formulation of bidding problems is also discussed, including changing the bid success probabilities due to competitor actions, the possibility of crashing projects and alternate methods of performing projects.     

On the impact of low-balling: Experimental results in asymmetric auctions

The paper reports on a series of asymmetric auction experiments with private-independent values and two buyers. Maskin and Riley (2000) showed, under some conditions, that if one buyer has a greater probability than the other of not being able to bid, first-price auctions could yield lower revenues to the seller than second-price auctions. The data rejected this prediction because of an important overbidding when subjects received low values in first-price auctions. In this asymmetric setting, the observed overbidding cannot be explained by the usual risk aversion hypothesis and the detection of a learning pattern indicates that subjects used more an adaptive behaviour than a static one. An ad hoc bidding strategy for the buyers who are the most likely to bid explains the observed low bids better than the risk neutral equilibrium strategy. Finally, as subjects appear to have bid in equilibrium as if there were two other competitors instead of only one, their bidding behaviour can be thought to have displayed an over anxiousness about winning. Received: January 1999/Final version June 2001     

工程招投标中的激励机制分析

本文试图利用博弈理论 ,对工程招投标过程中存在的现象进行分析 ,并建立了相应的对策模型 .目的是通过所建模型讨论工程招投标过程中招投标双方的对策及博弈 ,力图达到一种均衡     

Combinatorial auctions

Combinatorial auctions are an important class of market mechanisms in which participants are allowed to bid on bundles of multiple heterogeneous items. In this paper, we discuss several complex issues that are encountered in the design of combinatorial auctions. These issues are related to the formulation of the winner determination problem, the expression of combined bids, the design of progressive combinatorial auctions that require less information revelation, and the need for decision support tools to help participants make profitable bidding decisions. For each issue, we survey the existing literature and propose avenues for further research. An earlier version of this paper appeared in 4OR 2, 1–33, 2004.     

Optimum Bid Estimation on Fixed Cost Contracts

The paper presents a competitive bidding model which can be readily implemented in a competitive bidding environment within the construction industry. A method of obtaining a fast and accurate approximation of the optimum bid for a class of bidding problems is developed. The Newton Approximation Method is employed in approximating the root of an equation which maximizes the expected monetary value of a contract. A bidding chart and an example application of the technique are presented.     

建筑业中投标合同的统计和模糊分析

许多货物和劳务合同是依据密标的拍卖签订的。在建筑业中，有报价选择特权的承包商决定工程的标价常常是一个艰难的过程。一般公认的标价办法是实际成本加毛利。本文运用主因素分析法和回归分析法来研究香港的竞争性承包商的投标成效，同时也用模糊线性回归来研究投标过程的结构。最后，根据香港建筑业投标数据库，比较了统计和模糊回归分析这两种方法的结果。     

How to bid in unified second-price auctions when requests are duplicated

In display advertising auctions, a unique display opportunity may trigger many bid requests being sent to the same buyer. Bid request duplication is an issue: programmatic bidding agents might bid against themselves. In a simplified setting of unified second-price auctions, the optimal solution for the bidder is to randomize the bid, which is quite unusual. Our results motivate the recent switch to a unified first-price auction by showing that a unified second-price auction could have been detrimental to all participants.     

A Bidding Simulation for Training Estimators

A simulation for training estimators and managers is described. The game simulates a bidding situation in the construction industry, with the participants split into teams which bid against each other for government contracts. The contracts are differentiated in terms of workload implications and location, and the teams are encouraged to use discriminating bidding strategies. The cost estimates provided include substantial uncertainty, and the teams can purchase more accurate estimates as well as buying competitive information. As a result of playing the game, participants appreciated the importance of expenditure on estimates, keeping good records, and using simple bidding models.     

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

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

Robust strategic bidding in auction-based markets

In this paper, we propose an alternative methodology for devising revenue-maximizing strategic bids under uncertainty in the competitors’ bidding strategy. We focus on markets endowed with a sealed-bid uniform-price auction with multiple divisible products. On recognizing that the bids of competitors may deviate from equilibrium and are of difficult statistical characterization, we proposed a two-stage robust optimization model with equilibrium constraints aiming to devise risk-averse strategic bids. The proposed model is a trilevel optimization problem that can be recast as a particular instance of a bilevel program with equilibrium constraints. Reformulation procedures are proposed to find a single-level equivalent formulation suitable for column-and-constraint generation (CCG) algorithm. Results show that even for the case in which an imprecision of 1% is observed on the rivals’ bids in the equilibrium point, the robust solution provides a significant risk reduction (of 79.9%) in out-of-sample tests. They also indicate that the best strategy against high levels of uncertainty on competitors’ bid approaches to a price-taker offer, i.e., bid maximum capacity at marginal cost.     

Estimating advertisers' values for paid search clickthroughs

Paid search is an important form of online advertisement. Clickthroughs from slots are bid for by advertisers. The process of formulating bids is a complex one involving bidders in competing against other advertisers in multiple auctions. It would be helpful in managing the bidding process if it were possible to determine the values placed on a clickthrough by different advertisers. The theory of two models for estimating advertiser values and associated parameters is presented. The models are applied to a set of data for searches on the term Personal Loans. The results of the model that fits the data better are evaluated. The utility of the model to practitioners is discussed. Some issues raised by the results about the role of bidding agents and the discriminatory power of Customer Relationship Management systems are considered. Ways to develop the preferred model are outlined. It is suggested that the model has implications for evaluating forecasting methods for use in paid search auctions.     

The value of information in competitive bidding

We consider the situation where two players compete to obtain a valuable object, e.g. a stand of timber in a competitive, sealed-bid environment. Prior to submitting a bid, each player may sample the stand while incurring a common, non-zero cost for each observation. On one hand, a player wishes to take as few observations as possible due to the cost of collecting information. However, one also wishes to obtain as many observations as possible to avoid a bid that overstates the value of the resource.Given different assumptions on the sampling process, the informational structure, and underlying distribution of value, we derive equilibrium bidding strategies. We use these bidding strategies to solve for equilibrium in an information collection problem from the forest products industry.     

完全信息下发电机组间竞价上网的非合作博弈行为分析

本文利用博弈论方法对电力市场中 ,电力总需求缺乏弹性时各发电机组间非合作关系下竞价上网的报价行为进行了分析、研究 .并通过多目标规划方法 ,求出了纳什均衡的近似解 .该解可以指导机组制定竞价上网的报价曲线 ,避免机组盲目报价 .     

Bidding in sequential electricity markets: The Nordic case

For electricity market participants trading in sequential markets with differences in price levels and risk exposure, it is relevant to analyze the potential of coordinated bidding. We consider a Nordic power producer who engages in the day-ahead spot market and the hour-ahead balancing market. In both markets, clearing prices and dispatched volumes are unknown at the time of bidding. However, in the balancing market, the market participant faces an additional risk of not being dispatched. Taking into account the sequential clearing of these markets and the gradual realization of market prices, we formulate the bidding problem as a multi-stage stochastic program. We investigate whether higher risk exposure may cause hesitation to bid into the balancing market. Furthermore, we quantify the gain from coordinated bidding, and by deriving bounds on this gain, assess the performance of alternative bidding strategies used in practice.     

Study on economic withholding in electricity market of Zhejiang Province,China

Power suppliers with market power intend to bid high-price to obtain excessive profit when intensions in the balance of electricity supply and demand emerge. New index is thus necessary to be defined to assess the economic withholding behavior associated with both bidding prices and corresponding bidding capacity. Stages of low price section, economic withholding section and reasonable adventure section were classified in this paper. Based on bidding prices and capacity, absolute index and relative index were proposed to measure the economic withholding degree, with the former used for estimation of the total power system while the latter for comparisons amongst different units. A case study on Zhejiang electricity market indicated that these two proposed indices can accurately assess the economic withholding behavior in the electricity market. Finally, upper limit was suggested to be set for the relative index to suppress the behavior of excessive bidding prices in short of capacity.     

Design of discrete Dutch auctions with an uncertain number of bidders

The focus of this paper is on Dutch auctions where the bidding prices are restricted to a finite set of values and the number of bidders follows a Poisson distribution. The goal is to determine what the discrete bid levels should be to maximize the auctioneer’s expected revenue, which is the same as the average selling price of the object under consideration. We take a new approach to the problem by formulating the descending-price competitive bidding process as a nonlinear program. The optimal solution indicates that the interval between two successive bids should be wider as the Dutch auction progresses. Moreover, the auctioneer’s maximum expected revenue increases with the number of bid levels to be set as well as the expected number of bidders. Numerical examples are provided to illustrate the key results from this study and their managerial implications are discussed.     

Recurrent Competitive Bidding

A competitive bidding policy can be formulated if prior probability distributions of competitors' bids for future contracts have been determined. A method for determining these prior probability distributions is described for markets where there are a large number of customers. The identity of each winning company and its bid are assumed to be available to competitors and other customers so that the market reacts quickly to changes. A real example of the use of the method is given. The suppliers' general levels of bidding and their variation with individual types of customer are evaluated quantitatively. The results are consistent with qualitative knowledge of the market.     

All-pay auctions with pre- and post-bidding options

Motivated by the emergence of online penny or pay-to-bid auctions, in this study, we analyze the operational consequences of all-pay auctions competing with fixed list price stores. In all-pay auctions, bidders place bids, and highest bidder wins. Depending on the auction format, the winner pays either the amount of their bid or that of the second-highest bid. All losing bidders forfeit their bids, regardless of the auction format. Bidders may visit the store, both before and after bidding, and buy the item at the fixed list price. In a modified version, we consider a setting where bidders can use their sunk bid as a credit towards buying the item from the auctioneer at a fixed price (different from the list price). We characterize a symmetric equilibrium in the bidding/buying strategy and derive optimal list prices for both the seller and auctioneer to maximize expected revenue. We consider two situations: (1) one firm operating both channels (i.e. fixed list price store and all-pay auction), and (2) two competing firms, each operating one of the two channels.     

Multi-period resource allocation for estimating project costs in competitive bidding

Central European Journal of Operations Research - In competitive bidding for project contracts, contractors estimate the cost of completing a project and then determine the bid price. Accordingly,...     

非合作n人投标报价服从N(μ,σ~2)分布时局中人投标报价策略的研究

推导了矩阵对策模型 ,对非合作 n人投标报价的分布进行 x2 检验。当非合作 n人投标报价服从N (μ,σ2 )分布时 ,根据参数区间公式 ,估计非合作 n人有效报价平均数的范围 ,局中人 最佳报价可根据矩阵对策模型来确定。该方法确定的报价与最佳标底的误差能控制在较小的范围内 ,适用于招标中合成标底的评标办法 ,对确定报价具有一定的实用价值。