Achieving Optimal Fairness from Biased Coinflips

DOI10.1007/978-3-0348-8295-8_22MaRDI QIDQ2708630zbMATH OpenOpenAlexFDO

Authors Mats Näslund, Alexander Russell

Publication date 17 July 2001

Published in Cryptography and Computational Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-0348-8295-8_22

Mathematics Subject Classification ID

Combinatorial probability (60C05) Random number generation in numerical analysis (65C10) Cryptography (94A60)

Recommendations

• On the fairness of random procedures
• Optimal fair computation
• On the complexity of fair coin flipping
• On the complexity of fair coin flipping
• Achieving fairness in the stochastic multi-armed bandit problem
• An instance-based algorithm for deciding the bias of a coin
• An optimally fair coin toss
• An Optimally Fair Coin Toss
• Stochastic orderings, folded beta distributions and fairness in coin flips
• scientific article; zbMATH DE number 1293331

Cited in

(10)

• Efficient simulations by a biased coin
• Bias-independent constructions from biased bisection and adjacency judgements
• On the Black-Box Complexity of Optimally-Fair Coin Tossing
• An Optimally Fair Coin Toss
• Measuring bias in cyclic random walks
• Extraction of optimally unbiased bits from a biased source
• scientific article; zbMATH DE number 1903384 (Why is no real title available?)
• scientific article; zbMATH DE number 5589306 (Why is no real title available?)
• SMALL-SCALE EQUIDISTRIBUTION OF RANDOM WAVES GENERATED BY AN UNFAIR COIN FLIP
• Making a fair roulette from a possibly biased coin

This page was built for publication: Achieving Optimal Fairness from Biased Coinflips

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708630)