Hats, auctions and derandomization

Oren Ben-Zwi; Ilan Newman; Guy Wolfovitz

doi:10.1002/rsa.20512

Hats, auctions and derandomization

Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	478-493
Number of pages	16
Journal	Random Structures and Algorithms
Volume	46
Issue number	3
DOIs	https://doi.org/10.1002/rsa.20512
State	Published - 1 May 2015

Bibliographical note

Publisher Copyright:
© 2013 Wiley Periodicals, Inc.

Keywords

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

Access to Document

10.1002/rsa.20512

Cite this

@article{39933786fe3c4703b7379b9e3cc0f914,

title = "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.",

keywords = "Bi-valued auctions, Derandomizing auctions, Digital good auctions, Hat games, Unlimited supply auctions",

author = "Oren Ben-Zwi and Ilan Newman and Guy Wolfovitz",

note = "Publisher Copyright: {\textcopyright} 2013 Wiley Periodicals, Inc.",

year = "2015",

month = may,

day = "1",

doi = "10.1002/rsa.20512",

language = "English",

volume = "46",

pages = "478--493",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "3",

}

TY - JOUR

T1 - Hats, auctions and derandomization

AU - Ben-Zwi, Oren

AU - Newman, Ilan

AU - Wolfovitz, Guy

PY - 2015/5/1

Y1 - 2015/5/1

N2 - 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.

AB - 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.

KW - Bi-valued auctions

KW - Derandomizing auctions

KW - Digital good auctions

KW - Hat games

KW - Unlimited supply auctions

UR - https://www.scopus.com/pages/publications/84924807760

U2 - 10.1002/rsa.20512

DO - 10.1002/rsa.20512

M3 - Article

AN - SCOPUS:84924807760

SN - 1042-9832

VL - 46

SP - 478

EP - 493

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 3

ER -

Hats, auctions and derandomization

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this