عملکرد بازار و تبانی پی در پی و به طور همزمان مزایده چندگانه: شواهدی از یک آزمایش مزایده صعودی
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|15420||2008||16 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 9004 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
|شرح||تعرفه ترجمه||زمان تحویل||جمع هزینه|
|ترجمه تخصصی - سرعت عادی||هر کلمه 90 تومان||13 روز بعد از پرداخت||810,360 تومان|
|ترجمه تخصصی - سرعت فوری||هر کلمه 180 تومان||7 روز بعد از پرداخت||1,620,720 تومان|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : International Journal of Industrial Organization, Volume 26, Issue 2, March 2008, Pages 557–572
We compare efficiency and susceptibility to collusion of two alternative ways to sell multiple objects in independent private values environments: simultaneous and sequential ascending auctions. Both auctions are common in the real world. With explicit communication among bidders, collusion was more frequent in sequential than in simultaneous auctions. We further analyze collusive schemes adopted by bidders.
Multi-object auctions have become a subject of close attention of economic theorists and experimentalists, both due to an academic interest, and to a growing use of multi-object auctions in practice. Government auctions to sell the electro magnetic spectrum are among the most broadly-discussed recent examples of multi-object auctions (e.g., Cramton, 1998 and Jehiel and Moldovanu, 2003). There are many other real-world examples, however. Multiple procurement contracts, real estate, utility procurement and school milk contracts are offered for sale annually (Pesendorfer, 2000). The auction formats vary from case to case, including both simultaneous and sequential auctions. Spectrum auctions in many countries adopted a simultaneous ascending auction format, with an argument that such format allows better coordination and promotes the efficient aggregation of complementary licenses (McAfee, 1999, Cramton, 1998, Cramton and Schwartz, 2000 and Klemperer, 2002). In other cases, multiple objects such as estate, used cars, cattle, fish, vegetables, timber and wine are often allocated in comparable lots at sequential auctions (Phillips et al., 2003, Caillaud and Mezzetti, 2004 and Raviv, 2006). In many cases, such as spectrum license sales, the auction format is chosen by the auctioneer with an objective to meet certain performance criteria, such as efficiency, revenue maximization and collusion–proofness. The laboratory research that compares different auction formats in view of these criteria is therefore of immediate interest. Indeed, several experimental studies have compared efficiency and revenue-raising properties of simultaneous and sequential multi-unit auction. Lunanders and Nilsson (2004) compare bidding behavior for multiple identical contracts in first-price simultaneous, first-price sequential and first-price combinatorial auctions. They report that when bidders have non-linear average costs of winning more than one contract, combinatorial auctions are the most efficient. Goeree et al. (2006) compare the performances of first-price simultaneous, first-price sequential, simultaneous descending and simultaneous ascending auctions in various bidding environments with single-unit demand. They find that simultaneous ascending auctions are the most efficient, but at the same time they yield lower and more variable revenues than other auction formats. While Goeree et al. note that low and variable revenues in uncompetitive situations yield suspicion of collusion, they do not study collusion per se and do not compare susceptibility to collusion across auction formats. This is what we do in this paper. We investigate and compare performances of simultaneous and sequential ascending multi-object auctions with an emphasis on their susceptibility to collusion. Vulnerability to collusive bidding has been a major concern in many real-world multi-unit auctions, such as auctions for school milk contracts (Pesendorfer, 2000), or spectrum auctions (Cramton and Schwartz, 2000 and Jehiel and Moldovanu, 2003). We focus on ascending auctions, which have been argued both to enhance efficiency, and to be more vulnerable to collusion than sealed bid auctions (Klemperer, 2003). Collusive tendencies may differ between sequential and simultaneous ascending auctions due to strategic or other differences among the institutions. For example, sequential auctions may discourage collusion through backwards induction:1 Collusive agreements cannot be sustained in the final period, possibly unraveling to earlier periods of the auction. On the other hand, if simultaneous nature of the auctions imposes high complexity costs on boundedly rational bidders, then bidders may find it easier to collude in sequential auctions. Another objective of this study is to see how bidders collude in ascending auctions. Theoretical literature analyzes collusive schemes supportable as equilibria under different auction institutions. McAfee and McMillan (1992) show that in a static single-object sealed bid auction without side payments, the best collusive scheme a cartel can use is random assignment of the object at the reserve price. Fudenberg et al. (1994) show that in repeated auctions with communication, a folk theorem implies that various collusive schemes can be supported as subgame perfect equilibria. Skrzypacz and Hopenhayn (2004) demonstrate that in repeated sealed-bid auctions with no communication and no side payments, collusion better than bid rotation of objects is feasible. Aoyagi (2003) also argues that if an auction with communication is repeated, then even without side payments, a dynamic scheme payoff-superior to any static one can be implemented. Such dynamic “splitting objects across time” schemes are somewhat similar to the static ranking mechanism discussed by Pesendorfer (2000) for collusion in multi-object auctions, where bidders submit their preferences for the objects. Due to the absence of side payments, each collusive scheme has to give each bidder a sufficiently high share of objects to insure incentive compatibility. Kwasnica (2000) notes that the serial dictator scheme, where an order of bidders is selected randomly, and then bidders proceed in turn each choosing one object, is another incentive compatible mechanism to allocate multiple objects within a cartel. Brusco and Lopomo (2002) show that in simultaneous ascending price auctions for multiple objects, collusion via signaling is possible even in a non-repeated setting without communication. A common feature of the multi-object and dynamic collusive mechanisms discussed above is that they all improve efficiency as compared to the random assignment by assigning each bidder the objects he or she values more with higher probability. In this paper, we allow explicit communication among bidders and consider collusive schemes adopted by bidders in view of the theoretical possibilities discussed above. The research on collusion in various experimental markets has been extensive, with early contributions including Fouraker and Siegel (1963) and Isaac and Walker (1985). Recently, more studies focus on multi-object auctions. Kwasnica (2000) reports that bidders successfully collude in multi-object sealed bid auctions with communication. He provides evidence that bidders used collusive schemes that were payoff-superior to random assignment; in particular, the ranking mechanism of Pesendorfer (2000) was adopted frequently. Kwasnica and Sherstyuk (2007) study tacit bidder collusion in simultaneous ascending price auctions but do not compare the results with the sequential auction setting. They provide evidence of collusion via signaling consistent with Brusco and Lopomo (2002) in two-person experimental markets. Burns (1985) reports some cases of collusion in sequential auctions. Phillips et al. (2003) give evidence of bidder collusion in sequential multi-unit ascending auctions for homogeneous goods with communication. In their design all bidders had identical demand schedules and therefore did not face a trade-off between efficiency and equity which occurs in heterogeneous bidders environments. The bidders successfully adopted simple bid rotation schemes to split the objects.2 In this paper we compare collusion in simultaneous and sequential ascending auctions with heterogeneous objects and bidders. To single out differences in collusive tendencies, if any, in our experimental design we eliminate all features of the environment that would give different across formats predictions if bidders behave competitively: First, there are no complementarities in bidder values across objects. Second, we assume each bidder's values for objects are independent of one another.3 In this sense, our sequential auctions setting resembles a repeated auction setting (e.g., Aoyagi, 2003), except in our case, bidders learn their valuations for a series of objects before these objects are auctioned, rather that for one object at a time. Traditionally, collusion has implied explicit communication (Isaac and Walker, 1985, Kwasnica, 2000 and Phillips et al., 2003), and we followed this tradition and allowed bidders in our experiment to communicate in between auction series.4 In line with earlier experiments with communication, we studied repeated interactions of subjects in a given auction setting. The repeated game framework is easily justifiable; for example, Aoyagi (2003) argues that “if collusion is a product of frequent interaction, … a more appropriate framework for analysis is that of repeated games…” (p. 80). We report a number of interesting findings from our experiments. We find that bidders were able to reach and sustain collusive agreements somewhat more often in sequential than in simultaneous auctions. We conjecture that simultaneous multi-object nature of the auction was rather complex for some bidders, preventing them from realizing the advantages of suppressed competition. In contrast, sequential auctions allowed bidders to focus on one object at a time, which helped them to realize the advantages of collusion. We thus suggest a connection between auction complexity and collusive behavior in multi-object settings.5 We further take a closer look at collusive schemes adopted by bidders. We find that colluding bidders were often able to allocate object efficiently, and the efficiency of outcomes under collusion was no lower than the efficiency before communication. These results nicely complement Kwasnica's (2000) findings on collusion in multi-object sealed bid auctions. Finally, we get another insight from our experiment. By varying auction closing rules in the simultaneous auctions, we observed that the auction closing rule had a noticeable effect on outcomes in multi-object auctions, not unlike to what Roth and Ockenfels (2002) observed in single-object internet auctions. While bidders focusing on end-of-period bidding led to somewhat higher than competitive bidder payoffs in some cases, it distracted bidder attention away from collusion and led to lower than collusive bidder payoffs in other cases.6
نتیجه گیری انگلیسی
The data from the experimental sessions are summarized in Table 1, Table 2 and Table 3 and Fig. 1, Fig. 2 and Fig. 3. Table 1, Table 2 and Table 3 list average market prices, efficiencies, and bidder payoffs per auction, pooled by session and treatment. Since the hard closing rule was used in two of the three treatments, we compare the actual data with the first price sealed bid (SB) auction predictions as well as with the ascending English auction (EA) predictions (see Roth and Ockenfels, 2002).11Fig. 1, Fig. 2 and Fig. 3 present market price dynamics for each session, in comparison with EA competitive predictions, by treatment. For expositional convenience, each auction in both SEQ and SIM treatments is represented as a separate period in the figures. For example, periods 1, 2, 3, 4 in the figures correspond to auctions for goods A, B, C, D in series 1. The auction series are separated by vertical lines.