4,426 research outputs found

    Enabling Privacy-preserving Auctions in Big Data

    Full text link
    We study how to enable auctions in the big data context to solve many upcoming data-based decision problems in the near future. We consider the characteristics of the big data including, but not limited to, velocity, volume, variety, and veracity, and we believe any auction mechanism design in the future should take the following factors into consideration: 1) generality (variety); 2) efficiency and scalability (velocity and volume); 3) truthfulness and verifiability (veracity). In this paper, we propose a privacy-preserving construction for auction mechanism design in the big data, which prevents adversaries from learning unnecessary information except those implied in the valid output of the auction. More specifically, we considered one of the most general form of the auction (to deal with the variety), and greatly improved the the efficiency and scalability by approximating the NP-hard problems and avoiding the design based on garbled circuits (to deal with velocity and volume), and finally prevented stakeholders from lying to each other for their own benefit (to deal with the veracity). We achieve these by introducing a novel privacy-preserving winner determination algorithm and a novel payment mechanism. Additionally, we further employ a blind signature scheme as a building block to let bidders verify the authenticity of their payment reported by the auctioneer. The comparison with peer work shows that we improve the asymptotic performance of peer works' overhead from the exponential growth to a linear growth and from linear growth to a logarithmic growth, which greatly improves the scalability

    A Troubled Asset Reverse Auction

    Get PDF
    The US Treasury has proposed purchasing $700 billion of troubled assets to restore liquidity and solve the current financial crisis, using market mechanisms such as reverse auctions where appropriate. This paper presents a high-level design for a troubled asset reverse auction and discusses the auction design issues. We assume that the key objectives of the auction are to: 1) provide a quick and effective means to purchase troubled assets and increase liquidity; 2) protect the taxpayer by yielding a price for assets related to their value; and 3) offer a transparent rules-based process that minimizes discretion and favoritism. We propose a two-part approach. Part 1. Groups of related securities are purchased in simultaneous descending clock auctions. The auctions operate on a security-by-security basis to avoid adverse selection. To assure that the auction for each security is competitive, the demand for each security is capped at the total quantity offered by all but the largest three sellers. Demand bids from private buyers are also allowed. The simultaneous clock auctions protect the taxpayer by yielding a competitive price for each security and allow bidders to manage liquidity constraints and portfolio risk. The resulting price discovery also improves the liquidity of the securities that are not purchased in the auctions. Part 2. Following Part 1, the remaining quantity is purchased in descending clock auctions in which many securities are pooled together. To minimize adverse selection, reference prices are calculated for each security from a model that includes all of the characteristics of each security including the market information revealed in the security-by-security auctions of Part 1. Bids in the pooled auctions are specified in terms of a percentage of the reference price for each security.Auctions, financial auctions, financial crisis

    Bidding Behavior in Multi-Unit Auctions - An Experimental Investigation and some Theoretical Insights

    Get PDF
    We present laboratory experiments of five different multi-unit auction mechanisms. Two units of a homogeneous object were auctioned off among two bidders with at demand for two units. We test whether expected demand reduction occurs in open and sealed-bid uniform-price auctions. Revenue equivalence is tested for these auctions as well as for the Ausubel, the Vickrey and the discriminatory sealed-bid auction. Furthermore, we compare the five mechanisms with respect to the efficient allocation of the units. We also provide some theoretical insights concerning the equilibria of uniform-price auctions with incomplete information.Multi-Unit Auctions; Demand Reduction; Experimental Economics

    BIDDING BEHAVIOR IN MULTI-UNIT AUCTIONS - AN EXPERIMENTAL INVESTIGATION AND SOME THEORETICAL INSIGHTS

    Get PDF
    We present laboratory experiments of five different multi-unit auction mechanisms. Two units of a homogeneous object were auctioned off among two bidders with flat demand for two units. We test whether expected demand reduction occurs in open and sealed-bid uniform-price auctions. Revenue equivalence is tested for these auctions as well as for the Ausubel, the Vickrey and the discriminatory sealed-bid auction. Furthermore, we compare the five mechanisms with respect to the efficient allocation of the units. We also provide some theoretical insights concerning the equilibria of uniform-price auctions with incomplete information.Multi–Unit Auctions, Demand Reduction, Experimental Economics.
    corecore