487 research outputs found

    Auction Design Enhancements for Non-Combinatorial Auctions

    Get PDF
    We evaluate a number of possible enhancements to the FCC auctions. We consider only changes to the current auction rules that stay within the basic format of the simultaneous multiple round auction for individual licenses. This report summarizes and extends our e-mail exchanges with FCC staff on this topic. A subsequent report will cover auctions with combination bids. Overall, the FCC spectrum auctions have been an enormous success. However, there are two design goals in the auction where important improvement can be achieved within the basic rules structure. These are restricting collusion among bidders and reducing the time taken to complete the auction. This report focuses on enhancements that help to achieve these two goals. Some of the suggested changes also streamline the auction process so large auctions can be conducted more quickly without sacrificing efficiency.Auctions; Spectrum Auctions; Multiple-Round Auctions; Efficiency

    Spectrum Auctions

    Get PDF
    Auctions have emerged as the primary means of assigning spectrum licenses to companies wishing to provide wireless communication services. Since July 1994, the Federal Communications Commission (FCC) has conducted 33 spectrum auctions, assigning thousands of licenses to hundreds of firms. Countries throughout the world are conducting similar auctions. I review the current state of spectrum auctions. Both the design and performance of these auctions are addressed.Auctions, Spectrum Auctions, Multiple Item Auctions

    Bidding Markets

    Get PDF
    The existence of a ‘bidding market’ is commonly cited as a reason to tolerate the creation or maintenance of highly concentrated markets. We discuss three erroneous arguments to that effect: the ‘consultants’ fallacy’ that ‘market power is impossible’, the ‘academics’ fallacy’ that (often) ‘market power does not matter’, and the ‘regulators’ fallacy’ that ‘intervention against pernicious market power is unnecessary’, in markets characterized by auctions or bidding processes. Furthermore we argue that the term ‘bidding market’ as it is widely used in antitrust is unhelpful or misleading. Auctions and bidding processes do have some special features—including their price formation processes, common-values behaviour, and bid-taker power—but the significance of these features has been overemphasized, and they often imply a need for stricter rather than more lenient competition policy.Bidding Markets, Auctions, Antitrust, Competition Policy, Bidding, Market Power, Private Values, Common Values, Anti-trust

    Spectrum Auction Design

    Get PDF
    Spectrum auctions are used by governments to assign and price licenses for wireless communications. The standard approach is the simultaneous ascending auction, in which many related lots are auctioned simultaneously in a sequence of rounds. I analyze the strengths and weaknesses of the approach with examples from US spectrum auctions. I then present a variation, the package clock auction, adopted by the UK, which addresses many of the problems of the simultaneous ascending auction while building on its strengths. The package clock auction is a simple dynamic auction in which bidders bid on packages of lots. Most importantly, the auction allows alternative technologies that require the spectrum to be organized in different ways to compete in a technology-neutral auction. In addition, the pricing rule and information policy are carefully tailored to mitigate gaming behavior. An activity rule based on revealed preference promotes price discovery throughout the clock stage of the auction. Truthful bidding is encouraged, which simplifies bidding and improves efficiency. Experimental tests and early auctions confirm the advantages of the approach.Auctions, spectrum auctions, market design, package auction, clock auction, combinatorial auction

    The FCC Spectrum Auctions: An Early Assessment

    Get PDF
    This paper analyzes six spectrum auctions conducted by the Federal Communications Commission (FCC) from July 1994 to May 1996. These auctions were simultaneous multiple-round auctions in which collections of licenses were auctioned simultaneously. This auction form proved remarkably successful. Similar items sold for similar prices and bidders successfully formed efficient aggregations of licenses. Bidding behavior differed substantially in the auctions. The extent of bidder competition and price uncertainty played an important role in determining behavior. Bidding credits and installment payments also played a major role in several of the auctions.Auctions; Spectrum Auctions; Multiple-Round Auctions; Efficiency

    The European UMTS/IMT-2000 License Auctions

    Get PDF
    We survey the recent European UMTS license auctions and compare their outcomes with the predictions of a simple model that emphasizes future market structure as a main determinant of valuations for licenses. Since the main goal of most spectrum allocation procedures is economic efficiency, and since consumers (who are affected by the ensuing market structure) do not participate at the auction stage, good designs must alleviate the asymmetry among incumbents and potential entrants by actively encouraging entry.

    Putting auction theory to work : the simultaneous ascending auction

    Get PDF
    The"simultaneous ascending auction"was first introduced in 1994 to sell licenses to use bands of radio spectrum in the United States. Much of the attention devoted to the auction came from its role in reducing federal regulation of the radio spectrum and allowing market values, rather than administrative fiat, to determine who would use the spectrum resource. Several parts of economic theory proved helpful in designing the rules for simultaneous ascending auction and in thinking about how the design might be improved and adapted for new applications. After briefly reviewing the major rules of the auction in section 2, the author turns in section 3 to an analysis based on tatonnement theory, which regards the auction as a mechanism for discovering an efficient allocation and its supporting prices. The analysis reveals a fundamental difference between situations in which the licenses are mutual substitutes and others in which the same licenses are sometimes substitutes and sometimes complements. Section 4 is a selective account of some applications of game theory to evaluating the simultaneous ascending auction design for spectrum sales. Results like those reported in section 3 have led to renewed interest in auctions in which bids for license packages are permitted. In section 5, the author uses game theory to analyze the biases in a leading proposal for dynamic combinatorial bidding. Section 6 briefly answers two additional questions that economists often ask about auction design: If trading of licenses after the auction is allowed, why does the auction form matter at all for promoting efficient license assignments? Holding fixed the quantity of licenses to be sold, how sharp is the conflict between the objectives of assigning licenses efficiently and obtaining maximum revenue? Section 7 concludes.Economic Theory&Research,International Terrorism&Counterterrorism,Markets and Market Access,Environmental Economics&Policies,Labor Policies,Markets and Market Access,Access to Markets,Economic Theory&Research,Environmental Economics&Policies,International Terrorism&Counterterrorism

    Designing Coalition-Proof Reverse Auctions over Continuous Goods

    Full text link
    This paper investigates reverse auctions that involve continuous values of different types of goods, general nonconvex constraints, and second stage costs. We seek to design the payment rules and conditions under which coalitions of participants cannot influence the auction outcome in order to obtain higher collective utility. Under the incentive-compatible Vickrey-Clarke-Groves mechanism, we show that coalition-proof outcomes are achieved if the submitted bids are convex and the constraint sets are of a polymatroid-type. These conditions, however, do not capture the complexity of the general class of reverse auctions under consideration. By relaxing the property of incentive-compatibility, we investigate further payment rules that are coalition-proof without any extra conditions on the submitted bids and the constraint sets. Since calculating the payments directly for these mechanisms is computationally difficult for auctions involving many participants, we present two computationally efficient methods. Our results are verified with several case studies based on electricity market data
    • 

    corecore