18 citations · 109 across the 28 of their papers we have counts for
3 papers · 1 filter
Formal Barriers to Simple Algorithms for the Matroid Secretary Problem
Maryam Bahrani, Hedyeh Beyhaghi, Sahil Singla +1
Babaioff et al. [BIK2007] introduced the matroid secretary problem in 2007, a natural extension of the classic single-choice secretary problem to matroids, and conjectured that a c…
Proof-of-Stake Mining Games with Perfect Randomness
Matheus V. X. Ferreira, S. Matthew Weinberg
Proof-of-Stake blockchains based on a longest-chain consensus protocol are an attractive energy-friendly alternative to the Proof-of-Work paradigm. However, formal barriers to "get…
Prior-free Dynamic Mechanism Design With Limited Liability
Mark Braverman, Jon Schneider, S. Matthew Weinberg
We study the problem of repeatedly auctioning off an item to one of bidders where: a) bidders have a per-round individual rationality constraint, b) bidders may leave the mecha…