Increasingly, auctions are becoming an integral part of a company's strategy for procurement and excess disposal. Auctions can produce substantial cost savings by lowering transaction and negotiation costs, and reducing uncertainty. To remain competitive in this arena it is desirable to make optimal auction decisions. These decisions range from a seller setting the optimal reserve price to a bidder estimating the characteristics of his competitors. Underlying auction decisions is the joint distribution of bidder values. With this characterization of the auction market, structural variables can be estimated and bidder behavior can be forecast. Improved techniques for estimating bidders' bid values are desirable.
In at least some embodiments, a method comprises obtaining historical auction data, determining, from the historical auction data, a first parameter that is a function of a joint bid distribution and a density function related to the joint bid distribution, selecting a bidder, obtaining a value distribution for the selected bidder, and solving an equation. The equation may include the first parameter and the selected bidder's value distribution, and not the value distribution of other bidders. The equation computes a bid value associated with the selected bidder for a given bid.
In another embodiment, a system comprises a processor and memory containing software executable by the processor. When executing the software, the processor computes a ratio of an estimate of a density function to an estimate of a joint bid distribution, permits a bidder to be selected, obtains a probability value distribution for the selected bidder, and solves an ordinary differential equation. The ordinary differential equation may include the selected bidder's probability value distribution, and not the probability value distribution of other bidders, to compute a bid value associated with the selected bidder.
For a detailed description of the embodiments of the invention, reference will now be made to the accompanying drawings in which:
Certain terms are used throughout the following description and claims to refer to particular system components. As one skilled in the art will appreciate, various companies may refer to a component by different names. This document does not intend to distinguish between components that differ in name but not function. In the following discussion and in the claims, the terms “including” and “comprising” are used in an open-ended fashion, and thus should be interpreted to mean “including, but not limited to . . . ” Also, the term “couple” or “couples” is intended to mean either an indirect or direct electrical connection. Thus, if a first device couples to a second device, that connection may be through a direct electrical connection, or through an indirect electrical connection via other devices and connections.
The following discussion is directed to various embodiments of the invention. Although one or more of these embodiments may be preferred, the embodiments disclosed should not be interpreted, or otherwise used, as limiting the scope of the disclosure, including the claims. In addition, one skilled in the art will understand that the following description has broad application, and the discussion of any embodiment is meant only to be exemplary of that embodiment, and not intended to intimate that the scope of the disclosure, including the claims, is limited to that embodiment.
The subject matter described herein generally is directed to auctions comprising n bidders, where n is greater than one. The auctions may be implemented as first price, sealed bid auctions in which each bidder is permitted only one bid and the each bidder has no knowledge of the bid prices entered by other bidders. In accordance with the embodiments of the invention, an analytical process is provided herein in which an equation is solved for a given bidder to compute that bidders' “bid valuation” of the item being auctioned. As used herein, the term “bid valuation” refers to the amount (e.g., money) that the bidder theoretically had in mind when entering a particular bid. Alternatively stated, if a bidder believes a widget being auctioned has a particular value, a bid can be determined that is optimal for that particular value. A relationship exists, therefore, between the ith bidder's value vi and that bidder's bid bi. Moreover, a value distribution can be delineated for a given bidder. In this disclosure, the function φ(b) is the ith bidder's value as a function of the bid amount, bi. For a given value, the inverse of function φ(b) computes the ith bidder's optimal bid. Conversely, for a given bid, the function φ(b) computes the value that the bidder theoretically had in mind when entering that particular bid.
“Symmetric” auctions are auction in which all bidders are assumed to have the same value distribution. In “asymmetric” auctions, each bidder may have a different value distribution than other bidders participating in the auction. Mathematically, the asymmetric auction case can be represented as:
φi≠φ2≠ . . . ≠φk (1)
where the index i identifies one of k bidders.
For the asymmetric case, the following equation may be used to solve for a bidder's bid value:
Equation (2) is an ordinary differential equation (“ODE”) meaning that the equation involves a function of only one variable and the derivative of the function. In the embodiments described herein, the variable comprises the value distribution for a given bidder. Equation solvers and equation solving techniques are readily available and/or known for solving the ODE of equation (2). The terms of equation (2) comprise:
The function Ψ(b) is given by:
Summing up equation (2) for all k provides:
Solving for Ψ(b) results in:
With the result in equation (5), the estimation Ĝ(b) of G(b, . . . , b) is readily available from historical bids by counting assuming that a non-trivial number of data points are available in the data set. Thus,
where B={bi,j|i=1, . . . , n; j=1, . . . , N} and is the set of bidding data from N auctions with n bidders. In this way, Ψ(b) can be computed as the derivative of the logarithm of a smoothed version of Ĝ(b). Smoothing can be performed by polynomial curve fitting using, for example, splines, or other suitable techniques.
An alternative method for estimating Ψ(b) comprises using the standard kernel estimation of the derivative of G(b, . . . , b), that is ĝ(b), and then estimating Ψ(b) by:
To estimate ĝ(b), the n-dimensional data is turned into one-dimensional data by picking the maximum bid in each auction record before applying the kernel method. As such, the dimensionality of the kernel is 1. This results in an estimate of ĝ(b) as follows:
where Kg is a one-dimensional kernel function and hg is the bandwidth.
In block 102, an equation is solved that includes {circumflex over (Ψ)}(b) and the selected bidder's probability value distribution, and not the probability value distribution of other bidders, to compute a bid value associated with the selected bidder for a given bid. In this way, each bidder can be analyzed without having to use the probability value distributions of the other bidders. In accordance with the embodiments of the invention, the equation solved in block 102 comprises equation (2) above.
The above discussion is meant to be illustrative of the principles and various embodiments of the present invention. Numerous variations and modifications will become apparent to those skilled in the art once the above disclosure is fully appreciated. The following claims embrace all such variations and modifications.
Number | Name | Date | Kind |
---|---|---|---|
6061662 | Makivic | May 2000 | A |
7096197 | Messmer et al. | Aug 2006 | B2 |
20020046157 | Solomon | Apr 2002 | A1 |
20020069134 | Solomon | Jun 2002 | A1 |
20020082969 | O'Keeffe et al. | Jun 2002 | A1 |
20020116315 | Grey et al. | Aug 2002 | A1 |
20020120552 | Grey et al. | Aug 2002 | A1 |
20020147045 | La Mura et al. | Oct 2002 | A1 |
20020174052 | Guler et al. | Nov 2002 | A1 |
20030014349 | Guler et al. | Jan 2003 | A1 |
20030018515 | Guler et al. | Jan 2003 | A1 |
20030018562 | Guler et al. | Jan 2003 | A1 |
20030041001 | Hoffman et al. | Feb 2003 | A1 |
20030041007 | Grey et al. | Feb 2003 | A1 |
20030041008 | Grey et al. | Feb 2003 | A1 |
20030041009 | Grey et al. | Feb 2003 | A1 |
20030041011 | Grey et al. | Feb 2003 | A1 |
20030041013 | Grey et al. | Feb 2003 | A1 |
20030041014 | Grey et al. | Feb 2003 | A1 |
20030055773 | Guler et al. | Mar 2003 | A1 |
20030069825 | Hoffman et al. | Apr 2003 | A1 |
20030093357 | Guler et al. | May 2003 | A1 |
Entry |
---|
Jean-Jacques Laffont, Game theory and empirical economics: The case of auction data,European Economic Review 41—1997. 1-35. |
Haili Song, Chen-Ching Liu, Jacques LawarreeDecision Making of an Electricity Supplier's Bid in a Spot Market,Power Engineering Society Summer Meeting, 1999. IEEE (vol. 2 ). |
Yongjun Ren, and Francisco D. GalianaPay-as-Bid versus Marginal Pricing—Part I: Strategic Generator Offers,IEEE Transactions on Power Systems, vol. 19, No. 4, Nov. 2004. |
Kemal Guler, “Equilibrium in Copula Models of First Price Auction,” Dec. 20, 2002, 20 pp. |
Paul R. Milgrow et al., “A Theory of Auctions and Competitive Bidding,” Econometrica, vol. 50, No. 5, Sep. 1982, pp. 1089-1123. |
Emmanuel Guerre et al., “Optimal Nonparametric Estimation of First-Price Auctions,” Econometrica, vol. 68, No. 3, May 2000, pp. 525-574. |
Number | Date | Country | |
---|---|---|---|
20050080708 A1 | Apr 2005 | US |