Hats, auctions and derandomization

DOI10.1002/rsa.20512zbMath1321.91053OpenAlexW1978089484MaRDI QIDQ5252259

Guy Wolfovitz, Oren Ben-Zwi, Ilan Newman

Publication date: 29 May 2015

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20512

zbMATH Keywords

hat gamesbi-valued auctionsderandomizing auctionsdigital good auctionsunlimited supply auctions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (3)

Finite Dynamical Systems, Hat Games, and Coding Theory ⋮ Hat guessing on books and windmills ⋮ New Constructions and Bounds for Winkler's Hat Game

Cites Work

• Local and global price of anarchy of graphical games
• Problems and results in extremal combinatorics. II
• Competitive analysis of incentive compatible on-line auctions
• Competitive auctions
• A constructive proof of the general lovász local lemma
• A New Derandomization of Auctions
• Optimal Auction Design
• Probability Inequalities for Sums of Bounded Random Variables
• Algorithmic Game Theory
• An Exploration in the Theory of Optimum Income Taxation
• Derandomization of auctions
• Hat Guessing Games

This page was built for publication: Hats, auctions and derandomization