Descending Price Auction Research Articles

Descending Price Auctions with Bounded Number of Price levels and Batched Prophet Inequality

Descending Price Auctions with Bounded Number of Price levels and Batched Prophet Inequality

Emergency Money: Lessons from the Paycheck Protection Program

The Paycheck Protection Program, or PPP, was huge. Between April 2020 and May 2021, it provided almost $800 billion to more than 11 million businesses—about a third of all U.S. businesses with 500 employees or fewer. The PPP was also flawed. Treasury and the Small Business Administration faced incomplete statutory instructions and a challenging tradeoff between speed and accuracy in distributing PPP funds. These flaws make the PPP a realistic and valuable case study; the PPP reveals tools that can be applied to similar distributions of emergency funds. One tool is back-end adjustments, meaning that funds are first distributed and then later it is decided whether recipients may keep the money. Another tool is distribution in descending order of necessity, meaning that the first recipients to receive funds are applicants that most clearly meet the criteria of the program. A fund can follow distribution in descending order of necessity to disburse all of its funds. This approach is similar to a descending price auction for the sale of bonds or a stock of goods. Disbursing amounts in descending order of necessity also allows a fund to collect information needed to improve future distribution policy.

Robust bidding and revenue in descending price auctions

We study the properties of Dutch auctions in an independent private value setting, where bidders face uncertainty over the type distribution of their opponents and evaluate their payoffs by the worst case from a set of probabilistic scenarios. In contrast to static auction formats, participants in the Dutch auction gradually learn about the valuations of other bidders. We show that the transmitted information can lead to changes in the worst-case distribution and thereby shift a bidder's payoff maximizing exit price over time. We characterise the equilibrium bidding function in this environment and show that the arriving information leads bidders to exit earlier at higher prices. As a result, the Dutch auction systematically generates more revenue than the first-price auction.

Split-Award Auctions: Insights from Theory and Experiments

We investigate procurement in a setting in which the buyer is bound by sourcing rules. Sourcing rules may limit the minimum and maximum amounts of business that can be awarded to a single supplier or dictate the minimum number of suppliers who are awarded business, thus necessitating split awards. The buyer announces the splits before the auction, and suppliers bid accordingly. We consider two auction formats: the sealed-bid first-price auction, and a version of the open-bid descending-price auction. We characterize the suppliers’ symmetric equilibrium bidding strategy for both formats and find that the two formats yield the same expected buyer’s cost. We characterize the cost of multisourcing, showing among other things that it is always costly for the buyer to split its award among more suppliers if the suppliers’ costs are regularly distributed, but that doing so can actually reduce the buyer’s expected auction payment if the suppliers’ costs are not regularly distributed. The results from controlled laboratory experiments, involving human subjects, indicate that expected cost equivalence fails when costs are regularly distributed because suppliers bid more aggressively in the sealed-bid auction. However, for split-award auctions with nonregularly distributed costs, the sealed-bid prices are actually higher than predicted by theory. We explain these mismatches between observations and theory through a behavioral model based on bidders’ aversion to anticipated regret. The experimental results indicate that the theory does a good job of predicting the relationship between the buyer’s average cost and the award splits, as well as the cost of multisourcing. Importantly, the experiments confirm that when suppliers’ costs come from a nonregular distribution, it may be to the buyer’s advantage to diversify the supply base more than is strictly necessitated by sourcing rules. The online appendix is available at https://doi.org/10.1287/mnsc.2017.2932 . This paper was accepted by Vishal Gaur, operations management.

Bidding Behavior in Dutch Auctions: Insights from a Structured Literature Review

ABSTRACTThe Dutch auction, also known as the descending-price auction or reverse clock auction, has a long-standing history in practice and in academic literature. In practice, the Dutch auction is commonly used to rapidly sell large quantities of homogeneous goods, such as cut flowers, fish, or tobacco. However, most e-commerce auction sites focus on other auction mechanisms, and overall research on human behavior in Dutch auctions is scant. To facilitate research on Dutch auctions and their applications in electronic commerce, we conduct a structured literature review of experimental studies and establish the current state of research on bidding behavior in single-unit and multi-unit Dutch auctions. The findings are based on an analysis of twenty-nine articles published in the fields of economics, information management, marketing, and operations research and management science between 1970 and 2016. This review reveals (1) the characteristics that make the Dutch auction unique compared to other auction formats, (2) the drivers of bidding behavior in Dutch auctions, and (3) an overview of how Dutch auctions can be employed in practice and to what advantage. Finally, we identify directions for future research on bidding behavior in Dutch auctions.

Auction-based tolling systems in a connected and automated vehicles environment: Public opinion and implications for toll revenue and capacity utilization

Autonomous and connected vehicles are expected to enable new tolling mechanisms, such as auction-based tolls, for allocating the limited roadway capacity. This research examines the public perception of futuristic auction-based tolling systems, with a focus on the public acceptance of such systems over current tolling practices on highways (e.g., dynamic and fixed tolling methodologies). Through a stated-preference survey, responses from 159 road-users residing in Virginia are elicited to understand route choice behavior under a descending price auction implemented on a hypothetical two-route network. Analysis of the survey data shows that there is no outright rejection of the presented auction-based tolling among those who are familiar with the current tolling methods. While males strongly support the new method, no clear pattern emerges among other demographic variables such as income and education level, and age. While high income respondents and regular commuters are more likely to pay higher tolls, no statistical significance between different genders, age groups, household sizes, and education levels is found. Based on the modeling results and the hypothetical road network, it is found that descending price tolling method yields higher average toll rates, and generates at least 70% more revenue when travel time saving is 30min, and improves capacity utilization of the toll road significantly compared to fixed tolls.

Selling to Advised Buyers

In many cases, agents that make purchase decisions are uninformed and rely on the advice of biased experts. For example, when contemplating an acquisition, the board of the bidder relies on the advice of the managerial team when deciding what offer to make for the target. We study how to sell assets to such “advised buyers” if the goal is (i) to maximize revenues; (ii) to maximize allocative efficiency. In static mechanisms, such as first- and second-price auctions, advisors communicate a coarsening of information and a version of the revenue equivalence theorem holds. In contrast, dynamic mechanisms, such as multiple-round auctions, result in more informative communication between buyers and their advisors, which leads to more efficient allocations. Whether this leads to higher revenues depends on the direction of the bias. When advisors are biased for overbidding, an ascending-price auction dominates static formats in both efficiency and expected revenues. When advisors are biased for underbidding, a descending-price auction dominates static mechanisms efficiency but often results in lower revenues.

Information Acquisition During a Descending Price Auction with Asymmetrically Informed Players

This paper considers equilibrium behavior in a descending price auction with two players that are asymmetrically informed. The ”informed” player knows his valuation while the other does not. The uninformed player can acquire information about his valuation with a positive cost during the auction. We assume that the information acquisition activity is covert and we characterize the equilibrium behavior in the setting where players’ valuations are independently and identically distributed. We derive the explicit ”inverse bid” functions in the case of the uniformly distributed valuations and provide a revenue comparison between the ascending and descending price auctions in this case.

Price Reveal Auctions

AbstractA price reveal auction (PRA) is a descending price auction in which the current price of the item on sale is hidden. Buyers can privately observe the price only by paying a fee, and every time an agent does so, the price falls by a predetermined amount. We show that if the number of participants,

Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach

Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate.

The case for multi-unit single-run descending-price auctions

We show that a multiple-unit descending-price auction in which the clock is not reset after each sale may be faster and yield more stable prices than an efficient alternative, thus providing sellers a rationale for using it in practice.

COLLUSION FACILITATING AND COLLUSION BREAKING POWER OF SIMULTANEOUS ASCENDING AND DESCENDING PRICE AUCTIONS

This article demonstrates that a robust tacit collusion evolves quickly in a “collusion incubator” environment but is destroyed by the simultaneous descending price auction. Theories of collusion‐producing behavior, along with the detail of the states on which strategies are conditioned, lead to a deeper understanding of how tacit collusion evolves and its necessary conditions. These theories explain how the descending price auction destroys the collusion. The experiments proceed by conducting simultaneous ascending price auctions in the collusion incubator. Then, once the tacit collusion developed, changing to the descending auction. The change moved prices from collusive levels to near‐competitive levels. (JEL C71, C92, D43, D44)

Multi-item Vickrey–Dutch auctions

Descending price auctions are adopted for goods that must be sold quickly and in private values environments, for instance in flower, fish, and tobacco auctions. In this paper, we introduce efficient descending auctions for two environments: multiple non-identical items and buyers with unit-demand valuations; and multiple identical items and buyers with non-increasing marginal values. Our auctions are designed using the notion of universal competitive equilibrium (UCE) prices and they terminate with UCE prices, from which the Vickrey payments can be determined. For the unit-demand setting, our auction maintains linear and anonymous prices. For the homogeneous items setting, our auction maintains a single price and adopts Ausubel's notion of “clinching” to compute the final payments dynamically. The auctions support truthful bidding in an ex post Nash equilibrium and terminate with an efficient allocation. In simulation, we illustrate the speed and elicitation advantages of these auctions over their ascending price counterparts.

Descending price multi-item auctions

We propose a simultaneous descending price auction mechanism to sell multiple heterogeneous items, each owned by a distinct seller, to a number of buyers. Each buyer has known private valuations on items, and wants at most one item. We show that if the sellers follow a descending price offer procedure and the buyers follow a greedy strategy for accepting the offers, the auction results in a nearly efficient allocation, and terminates close to a competitive equilibrium price vector. The descending price offer strategy of the sellers is close to a Nash equilibrium. However, we show that the buyers are better off waiting in our auction. There is a maximum limit (corresponding to the minimum competitive equilibrium price vector) till which they can wait without running into the risk of not winning any item. If the buyers wait within this limit, the prices can be brought arbitrarily close to a uniquely defined competitive equilibrium price vector.

Auctions of Homogeneous Goods with Increasing Returns: Experimental Comparison of Alternative “Dutch” Auctions

Most business-to-business (B2B) auctions are used to transact large quantities of homogeneous goods, and therefore use multiunit mechanisms. In the B2B context, bidders often have increasing returns to scale, or synergies. We compare two commonly used auction formats for selling multiple homogeneous objects, both sometimes called “Dutch” auctions, in a set of value environments that include synergies and potentially subject bidders to the “exposure” and “free-riding” problems. We find that the descending-price auction, best known for its use in the Dutch flower auctions, is robust and performs well in a variety of environments, although there are some situations in which the ascending uniform-price auction similar to the one used by eBay better avoids the free-riding problem. We discuss the factors that influence each mechanism's performance in terms of the overall efficiency, the informational requirements, the seller's revenue, and the buyer's profit.

Sequential Descending-Price Auctions with Asymmetric Buyers: Evidence from a Fish Market

The paper reports an analysis of price behaviour at a fish market which is organised as a sequence of descending-price auctions and which is attended by two different types of buyers: retailers and wholesalers. The main outcome of this study is that although each type of buyer paid different prices for quality-corrected lots of fish, the trends of prices are not significantly affected by buyers' asymmetric preferences and behaviours. In addition, the observed trends are best explained by Milgrom and Weber (1982) benchmark model which assumes symmetric risk neutral buyers and by its variations which assume risk averse buyers or an uncertain supply.