Hats, auctions and derandomization

Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)478-493
Number of pages16
JournalRandom Structures and Algorithms
Issue number3
StatePublished - 1 May 2015

Bibliographical note

Publisher Copyright:
© 2013 Wiley Periodicals, Inc.


  • Bi-valued auctions
  • Derandomizing auctions
  • Digital good auctions
  • Hat games
  • Unlimited supply auctions

ASJC Scopus subject areas

  • Software
  • General Mathematics
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics


Dive into the research topics of 'Hats, auctions and derandomization'. Together they form a unique fingerprint.

Cite this