首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
  总被引:1,自引:0,他引:1  
We show that all-pay auctions dominate first-price sealed-bid auctions when bidders face budget constraints. This ranking is explained by the fact that budget constraints bind less frequently in the all-pay auctions, which leads to more aggressive bidding in that format.  相似文献   

2.
This note analyzes a two-player all-pay auction with incomplete information. More precisely, one bidder is uncertain about the size of the initial advantage of his rival modeled as a head start in the auction.I derive the unique Bayesian Nash equilibrium outcome for a large class of cumulative distribution functions of the head start. The stronger player generates an informational rent if and only if his head start distribution is not stochastically dominated by a uniform distribution. I identify why my results for an uncertain head start differ qualitatively from uncertainty about a cost function or a valuation.  相似文献   

3.
This paper extends the analysis of the n-player all-pay auction with complete information to cover the case of mn prizes, valued in weakly decreasing order, but symmetrically across players. We provide a complete characterization of the Nash equilibrium distributions for this class of auctions and provide an exact expression for the expected revenue generated.  相似文献   

4.
    
Olivier Bos   《Economics Letters》2011,110(3):262-264
  相似文献   

5.
    
We analyze the subgame perfect equilibrium of the round‐robin tournament with one strong (dominant) and two weak players, and we compare this tournament and the one‐stage contest with respect to the players' expected payoffs, expected total effort, and their probabilities of winning. We find that if the contest designer's goal is to maximize the players' expected total effort, then – if the asymmetry between the players is relatively low – the one‐stage contest should be used. However, if the asymmetry is relatively high, then the round‐robin tournament should be used.  相似文献   

6.
    
We revisit the two bidder complete information all-pay auction with bid-caps introduced by Che and Gale (1998), dropping their assumption that tie-breaking must be symmetric. Any choice of tie-breaking rule leads to a different set of Nash equilibria. Compared to the optimal bid-cap of Che and Gale we obtain that in order to maximize the sum of bids, the designer prefers to set a less restrictive bid-cap combined with a tie-breaking rule which slightly favors the weaker bidder. Moreover, the designer is better off breaking ties deterministically in favor of the weak bidder than symmetrically.  相似文献   

7.
In a dynamic contest the current incumbent competes against a randomly assigned entrant in a private value all pay auction each period. We focus on equilibria where the beliefs about the incumbent's type and the employed strategies are stationary. We show that inefficient types survive, even if the entrants arrive very frequently, because the entrant plays more aggressively than the incumbent, allowing a low type entrant to win against a high type incumbent. In an example we show that if the incumbent is challenged more often, then the equilibrium type of the incumbent is higher on average. When the value of the prize is the same for all players (the case studied in the public choice literature), the equilibrium rent of the bidders is fully dissipated as the incumbent is challenged infinitely often. The technical contribution lies in showing the existence of stationary equilibrium in an incomplete information game.  相似文献   

8.
Sequential vs. single-round uniform-price auctions   总被引:1,自引:0,他引:1  
We study sequential and single-round uniform-price auctions with affiliated values. We derive symmetric equilibrium for the auction in which k1 objects are sold in the first round and k2 in the second round, with and without revelation of the first-round winning bids. We demonstrate that auctioning objects in sequence generates a lowballing effect that reduces the first-round price. Total revenue is greater in a single-round, uniform auction for k=k1+k2 objects than in a sequential uniform auction with no bid announcement. When the first-round winning bids are announced, we also identify a positive informational effect on the second-round price. Total expected revenue in a sequential uniform auction with winning-bids announcement may be greater or smaller than in a single-round uniform auction, depending on the model's parameters.  相似文献   

9.
Unfair contests     
Real-world contests are often “unfair” in the sense that outperforming all rivals may not be enough to be the winner, because some contestants are favored by the allocation rule, while others are handicapped. This paper analyzes an unfair, two-player discriminatory contest (all-pay auction) with private values. We characterize equilibrium strategies, provide closed form solutions, and illustrate additional strategic issues arising in such unfair contests.  相似文献   

10.
  总被引:1,自引:0,他引:1  
I study a budget-constrained, private-valuation, sealed-bid sequential auction with two incompletely-informed, risk-neutral bidders in which the valuations and income may be non-monotonic functions of a bidder's type. Multiple equilibrium symmetric bidding functions may exist that differ in allocation, efficiency and revenue. The sequence of sale affects the competition for a good and therefore also affects revenue and the prices of each good in a systematic way that depends on the relationship among the valuations and incomes of bidders. The sequence of sale may affect prices and revenue even when the number of bidders is large relative to the number of goods. If a particular good, say α, is allocated to a strong bidder independent of the sequence of sale, then auction revenue and the price of good α are higher when good α is sold first.  相似文献   

11.
Brendan Kline   《Economics Letters》2009,104(3):129-132
This paper studies the consequences of a fine for violating a ceiling on permissible donations in a competition for a political prize. Increasing the fine can increase or decrease the amount of expected donations in equilibrium.  相似文献   

12.
Auctions with endogenous valuations: the snowball effect revisited   总被引:4,自引:0,他引:4  
Summary. This paper looks at the determination of ownership of capacity when there are two ex-ante symmetric agents bidding for many units of capacity which are sold sequentially. It is shown that convexity of payoffs in the final stage of the game is sufficient to ensure monopolization of capacity, but that increasing returns to scale are not sufficient to ensure monopolization. Received: March 14, 1997; revised version: December 1, 1997  相似文献   

13.
This paper presents an experimental study of a mechanism that is commonly used to sell multiple heterogeneous goods. The novel feature of this procedure is that instead of selling each good in a separate auction, the seller executes a single auction in which buyers, who may be interested in completely different goods, compete for the right to choose a good. We provide experimental evidence that a Right-to-Choose (RTC) auction can generate more revenue than the theoretically optimal auction. Moreover, in contrast to the “optimal” auction, the RTC auction is approximately efficient in the sense that the surplus it generates is close to the maximal one. Furthermore, a seller who would like to retain some of his goods can generate more revenue with a restricted RTC auction in which not all rights-to-choose are sold, than with the theoretically optimal auction.  相似文献   

14.
This paper examines the outcome of an ascending-price multiple-unit auction. Two bidders, facing continuous, downward-sloping demand functions, participate in the auction of some divisible objects. The auctioneer starts the process by announcing an initial price and asking both bidders to submit sealed-bids of desired quantities. The auctioneer increases the price until the total amount bid for is less than the total supply. We compute the outcome of this auction game under full information and suggest that this mechanism may not maximize expected revenue.  相似文献   

15.
    
We explore the performance of multi-round, price-guided combinatorial auctions for a previously untested class of value profiles in which synergies arise from shared fixed costs. We find that, in many cases, a simulator that bids straightforwardly does well in predicting auction performance, but exceptions arise because human bidders sometimes rely on cues besides prices to guide their package selection and because they sometimes bid aggressively on items for which they have no value in order to increase payments by bidders seeking complementary packages. In our experiments, this latter behavior not only raises prices, but can also improve efficiency by mitigating the threshold problem. Comparisons between a combinatorial clock auction (CCA) and a simultaneous ascending auction (SAA) are reported.  相似文献   

16.
A Sealed-Bid Auction That Matches the English Auction   总被引:1,自引:0,他引:1  
This paper analyzes a two-stage sealed-bid auction that is frequently employed in privatization, takeover, and merger and acquisition contests. This auction format yields the same expected revenue as the open ascending (English) auction, yet is less susceptible to preemptive bidding and collusion. Journal of Economic Literature Classification Number: D44.  相似文献   

17.
    
We study contest performance by focusing on the per capita payoffs of the contestants in an important class of asymmetric two-group contests. The group with the higher valuation has a greater chance of winning the contest whenever the rent-seeking technology is increasing and concave. We note that equilibrium efforts and payoffs per capita are uniquely defined and can be subjected to a comparative statics analysis. We show that payoff per capita for a group increases with its own valuation but decreases with the valuation of the opposing group. Per capita payoff for a group increases with its population.  相似文献   

18.
We consider an all-pay auction with complete information among the bidders; the seller does not observe the bidders’ values. We show that for some information structures in which the seller has a small uncertainty about the valuations, it is profitable for him to exclude from the auction all but two (randomly selected) bidders even though the latter are ex ante identical from his point of view.I am grateful to Paolo Bertoletti who introduced me to this topic and provided useful comments. I also thank Dan Kovenock (Co-Editor) and two anonymous referees for suggestions which considerably improved the exposition.  相似文献   

19.
Summary. We consider two ascending auctions for multiple objects, namely, an English and a Japanese auction, and derive a perfect Bayesian equilibrium of the Japanese auction by exploiting its strategic equivalence with the survival auction, which consists of a finite sequence of sealed-bid auctions. Thus an equilibrium of a continuous time game is derived by means of backward induction in finitely many steps. We then show that all equilibria of the Japanese auction induce equilibria of the English auction, but that many collusive or signaling equilibria of the English auction do not have a counterpart in the Japanese auction.Received: 2 September 2004, Revised: 20 April 2005, JEL Classification Numbers: C72, D44.Fabrizio Germano: Correspondence toWe are indebted to Philippe Jehiel for useful discussions and to Nicolas Vieille for suggestions in the proof of Proposition 2; we also thank seminar audiences in Athens, Basel, Beer-Sheva, Berlin, Brussels, Cambridge, Edinburgh, Exeter, Lausanne, Lisbon, London, Louvain-la-Neuve, Namur and Tel Aviv. Germano acknowledges financial support from Euopean Commission, TMR Network Grant ERBFMRXCT0055, “Cooperation and Information” as well from the Spanish Ministry of Science and Technology, Grants SEC2001-0792, SEJ2004-06319, and in form of a Ramon y Cajal Fellowship. Lovo is member of GREGHEC, unité CNRS, FRE-2810. The support of the Economic and Social Research Council (ESRC) is also gratefully acknowledged. The work was part of the programme of the ESRC Research for Economic Learning and Social Evolution.  相似文献   

20.
Truthful approximation mechanisms for restricted combinatorial auctions   总被引:1,自引:0,他引:1  
When attempting to design a truthful mechanism for a computationally hard problem such as combinatorial auctions, one is faced with the problem that most efficiently computable heuristics can not be embedded in any truthful mechanism (e.g. VCG-like payment rules will not ensure truthfulness).We develop a set of techniques that allow constructing efficiently computable truthful mechanisms for combinatorial auctions in the special case where each bidder desires a specific known subset of items and only the valuation is unknown by the mechanism (the single parameter case). For this case we extend the work of Lehmann, O'Callaghan, and Shoham, who presented greedy heuristics. We show how to use If-Then-Else constructs, perform a partial search, and use the LP relaxation. We apply these techniques for several canonical types of combinatorial auctions, obtaining truthful mechanisms with provable approximation ratios.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号