10 resultados para auctions
em University of Queensland eSpace - Australia
Resumo:
Suppose a seller wants to sell k similar or identical objects and there are n > k potential buyers. Suppose that each buyer wants only one object. In this case, we suggest the use of a simultaneous auction that would work as follows. Players are asked to submit sealed bids for one object. The individual with the highest bid chooses an object first; the individual with the second-highest bid chooses the next object; and this process continues until the individual with the kth highest bid receives the last object. Each individual pays the equivalent to his or her bid. When objects are identical, we show that the proposed auction generates the same revenue as a first-price sealed-bid sequential auction. When objects are perfectly correlated, there is no known solution for sequential auctions, whereas we can characterize bidding strategies in the proposed auction. Moreover, the proposed auction is optimal (given an appropriately chosen reserve price), and it may be easier and cheaper to run than a sequential auction.
Resumo:
We examine a stylized version of EPA auctions when agents know the list of values of sellers and buyers. There are inefficient equilibria where no goods are traded and efficient equilibria where all exchange occurs at a uniform price. We also provide examples under incomplete information when the uniform price equilibrium holds and when it does not hold. (C) 1999 Elsevier Science S.A. All rights reserved. JEL classification: D44; Q29.
Resumo:
In this paper we analyze a hybrid auction that combines a first-price and a Vickrey auction. We show that this auction may generate more expected revenue than a standard first-price auction. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
Using detailed Australian wool auction data we test for further evidence of pricing anomalies at sequential auctions. We find that an anomaly frequently exists and order is frequently endogenously determined. Moreover, prices increase through some sales and decrease through others. We examine whether it is possible to explain the variation in the anomaly across sales and conclude that there is no systematic relationship between the direction of the price anomaly and the characteristics of the wool or the auction. We do, however, find evidence that an anomaly, is more likely in longer sales.
Resumo:
In this paper we consider sequential auctions with synergies where one player wants two objects and the remaining players want one object each. We show that expected prices may not necessarily decrease as predicted by Branco [Econ. Lett. 54 (1997) 159]. Indeed we show that expected prices can actually increase. (C) 2004 Elsevier B.V All rights reserved.
Resumo:
It is well known that the optimal auction-one that maximizes the seller's expected revenue-can be implemented using a standard auction format with a suitably chosen reserve price. This reserve price is above the seller's value of retaining the object and the mechanism requires a commitment not to sell the object below the reserve. This commitment is what makes the reserve valuable to the seller. However, in practice, a reserve price commits the seller to sell the object if the reserve is reached, but does not commit her to withhold the object from sale if bidding falls short of the reserve. In this note we investigate whether reserve prices remain valuable for the seller when she may negotiate with the highest bidder if the reserve is not met. We show that the value of the reserve price may be completely undermined if the seller is a sufficiently weak bargainer. (c) 2004 Elsevier B.V. All rights reserved.
Resumo:
We investigate how corruption affects the outcome of a first-price auction (bidding behavior, efficiency and the seller's expected revenue). The auctioneer approaches the winner to offer the possibility of a reduction in his bid in exchange for a bribe. The bribe can be a percentage of the difference between the winning and the second-highest bid or a fixed amount. We show that there exists a symmetric bidding strategy equilibrium that is monotone, i.e., higher valuation buyers bid higher. Corruption does not affect efficiency but both the auctioneer's expected bribe and the seller's expected revenue depend on the format of the bribe payments. We also find the optimal bribe scheme.
Resumo:
In this paper we suggest a model of sequential auctions with endogenous participation where each bidder conjectures about the number of participants at each round. Then, after learning his value, each bidder decides whether or not to participate in the auction. In the calculation of his expected value, each bidder uses his conjectures about the number of participants for each possible subgroup. In equilibrium, the conjectured probability is compatible with the probability of staying in the auction. In our model, players face participation costs, bidders may buy as many objects as they wish and they are allowed to drop out at any round. Bidders can drop out at any time, but they cannot come back to the auction. In particular we can determine the number of participants and expected prices in equilibrium. We show that for any bidding strategy, there exists such a probability of staying in the auction. For the case of stochastically independent objects, we show that in equilibrium every bidder who decides to continue submits a bid that is equal to his value at each round. When objects are stochastically identical, we are able to show that expected prices are decreasing.
Resumo:
The spectacular though short-lived operation of China's wool auctions graphically illustrates problems in reforming China's agribusiness sector. A selective coverage of product type and participants, a highly contrived process of price discovery, and an urgent need for parallel reform in related areas all led to the demise of the auctions and are a barrier to their re-emergence as a viable wool marketing channel. Despite the challenges facing wool auctions, this paper argues that they still have much to offer the marketing of wool in China.
Resumo:
In this tutorial paper we summarise the key features of the multi-threaded Qu-Prolog language for implementing multi-threaded communicating agent applications. Internal threads of an agent communicate using the shared dynamic database used as a generalisation of Linda tuple store. Threads in different agents, perhaps on different hosts, communicate using either a thread-to-thread store and forward communication system, or by a publish and subscribe mechanism in which messages are routed to their destinations based on content test subscriptions. We illustrate the features using an auction house application. This is fully distributed with multiple auctioneers and bidders which participate in simultaneous auctions. The application makes essential use of the three forms of inter-thread communication of Qu-Prolog. The agent bidding behaviour is specified graphically as a finite state automaton and its implementation is essentially the execution of its state transition function. The paper assumes familiarity with Prolog and the basic concepts of multi-agent systems.