Hats, auctions and derandomization
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](/style/images/pfeil_up_dunkelblau.gif)
- Ben-Zwi, Oren
- Newman, Ilan
- Wolfovitz, Guy
![Grafik](/style/images/pfeil_up_dunkelblau.gif)
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](/style/images/pfeil_up_dunkelblau.gif)