Sequential Auctions of Identical Items with Budget-Constrained Bidders
نویسندگان
چکیده
In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only natural equilibrium and is unique under a refinement of subgame perfect equilibria. We show certain interesting properties of this equilibrium; for instance, we show that the prices decrease as the auction progresses. This phenomenon has been observed in many experiments and previous theoretic work attributed it to features such as uncertainty in the supply or risk averse bidders. We show that such features are not needed for this phenomenon and that it arises purely from the most essential features: budget constraints and the sequential nature of the auction. A little surprisingly we also show that in this equilibrium one agent wins all his items in the beginning and then the other agent wins the rest. The major difficulty in analyzing such sequential auctions has been in understanding how the selling prices of the first few rounds affect the utilities of the agents in the later rounds. We tackle this difficulty by identifying certain key properties of the auction and the proof is via a joint induction on all of them. ∗University of Pennsylvania. Supported in part by an ONR MURI Grant N000140710907. Part of this work was done while the author was an intern at Microsoft Research, Redmond. Email: [email protected]. †Microsoft Research, Redmond. Email: [email protected]. ‡University of Wisconsin-Madison. Part of this work was done while the author was an intern at Microsoft Research, Redmond. Email: [email protected].
منابع مشابه
Sequential auctions for common value objects with budget constrained bidders
This paper analyzes sequential auctions for budget constrained bidders, for multiple heterogeneous common value objects. In most auctions, bidders not only have valuations for objects but also have budget constraints (i.e., constraints on how much they can actually spend in an auction). Given these constraints, the bidders’ problem is to determine how much to bid in each auction. To this end, t...
متن کاملMultiple-Object Auctions with Budget Constrained Bidders
A seller with two objects faces a group of bidders who are subject to budget constraints. The objects have common values to all bidders, but need not be identical and may be either complements or substitutes. In a simple complete information setting we show: (1) if the objects are sold by means of a sequence of open ascending auctions, then it is always optimal to sell the more valuable object ...
متن کاملRevenue prediction in budget-constrained sequential auctions with complementarities
When multiple items are auctioned sequentially, the ordering of auctions plays an important role in the total revenue collected by the auctioneer. This is true especially with budget constrained bidders and the presence of complementarities among items. It is difficult to develop efficient algorithms for finding an optimal sequence of items. However, when historical data are available, it is po...
متن کاملRepeated Auctions under Budget Constraints: Optimal bidding strategies and Equilibria
How should agents bid in repeated sequential auctions when they are budget constrained? A motivating example is that of sponsored search auctions, where advertisers bid in a sequence of generalized second price (GSP) auctions. These auctions, specifically in the context of sponsored search, have many idiosyncratic features that distinguish them from other models of sequential auctions: First, e...
متن کاملCORC Techreport TR-2006-02 Bidding strategically with budget-constraints in sequential auctions
We examine models of sequential auctions with budget-constrained bidders. These types of auctions are of particular importance in e-commerce. Our models are simple, but rich enough to posess interesting features such as bid-jamming, which is also found in internet search engine auctions. We apply adversarial analysis to find fixed-point bidding strategies which are distribution-free and randomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1209.1698 شماره
صفحات -
تاریخ انتشار 2012