Hats, auctions and derandomization

Hats, auctions and derandomization

Content
Grafik
Abstract

We investigate derandomizations of digital good randomized auctions. We propose a general derandomization method which can be used to show that for every random auction there exists a deterministic auction having asymptotically the same revenue. In addition, we construct an explicit optimal deterministic auction for bi-valued auctions.

Grafik Top
Authors
  • Ben-Zwi, Oren
  • Newman, Ilan
  • Wolfovitz, Guy
Grafik Top
Shortfacts
Category
 Journal Paper
Divisions
 Theory and Applications of Algorithms
Journal or Publication Title
 Random Structures and Algorithms
ISSN
 1042-9832
Publisher
 Wiley Periodicals, Inc.
Date
 2014
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.