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.
|Number of pages||16|
|Journal||Random Structures and Algorithms|
|State||Published - 1 May 2015|
Bibliographical notePublisher Copyright:
© 2013 Wiley Periodicals, Inc.
- Bi-valued auctions
- Derandomizing auctions
- Digital good auctions
- Hat games
- Unlimited supply auctions
ASJC Scopus subject areas
- Mathematics (all)
- Computer Graphics and Computer-Aided Design
- Applied Mathematics